CN107291400B - Snapshot volume relation simulation method and device - Google Patents
Snapshot volume relation simulation method and device Download PDFInfo
- Publication number
- CN107291400B CN107291400B CN201710522555.6A CN201710522555A CN107291400B CN 107291400 B CN107291400 B CN 107291400B CN 201710522555 A CN201710522555 A CN 201710522555A CN 107291400 B CN107291400 B CN 107291400B
- Authority
- CN
- China
- Prior art keywords
- node
- current
- linked list
- nodes
- root
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000004088 simulation Methods 0.000 title claims description 19
- 238000006243 chemical reaction Methods 0.000 claims description 20
- 238000012217 deletion Methods 0.000 claims description 5
- 230000037430 deletion Effects 0.000 claims description 5
- 230000001419 dependent effect Effects 0.000 claims description 2
- 230000010076 replication Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000011084 recovery Methods 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1448—Management of the data involved in backup or backup restore
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Quality & Reliability (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method and a device for simulating snapshot volume relationship, wherein the method comprises the following steps: step 1: acquiring a tree view of a snapshot volume, determining a root node of the tree view as a current root node, and putting the current root node into a linear linked list; step 2: determining a newly generated child node under a current root node in the tree view as a current child node, and placing the current child node at a position behind the current root node in the linear linked list; and step 3: judging whether the current child node is a leaf node, if so, executing the step 4, otherwise, determining that the current child node is a current root node, and executing the step 2; and 4, step 4: and (3) putting the newly generated child node except the current child node under the current root node in the tree view into the position behind the current child node in the linear chain table, determining the child node as the current child node, and executing the step 3 until all the nodes in the tree view are determined to be put into the linear chain table. And the snapshot volume relationship is more intuitively displayed through a linear linked list.
Description
Technical Field
The present invention relates to the field of storage disaster recovery technologies, and in particular, to a snapshot volume relationship simulation method and apparatus.
Background
In the cloud computing era, mass data fills the aspects of life, and on one hand, the data transmission is required to be fast, and on the other hand, the data is required not to be lost. The data replication technology is a disaster recovery technology for ensuring that data is not lost, and includes local replication, remote replication, double live and the like. In the local replication, the snapshot is the replication based on the time point, the response is quick, the host IO is not influenced, and the snapshot can be rolled back to any snapshot time point. As the amount of data continues to increase, users need to create multiple snapshots for the source volume, and to cascade the snapshots (snapshots of snapshots) to ensure data backup at multiple points in time. When the number of snapshots and cascaded snapshots is large, a tree view is often drawn to simulate a snapshot volume relationship (a snapshot volume relationship, i.e., a logical relationship between snapshots included in a snapshot volume), but the tree view is not intuitive enough, so that management of the snapshot volume relationship is not convenient.
In summary, a technical solution for displaying the snapshot volume relationship more intuitively to facilitate management of the snapshot volume relationship is a problem to be solved urgently by those skilled in the art.
Disclosure of Invention
The invention aims to provide a snapshot volume relationship simulation method and device, which can display a snapshot volume relationship more intuitively and facilitate management of the snapshot volume relationship.
In order to achieve the above purpose, the invention provides the following technical scheme:
a snapshot volume relationship simulation method, comprising:
step 1: the method comprises the steps of obtaining a tree view generated based on the logical relation between snapshots contained in a snapshot volume, determining a root node of the tree view as a current root node, and placing the current root node into a linear linked list;
step 2: determining a newly generated child node under a current root node in the tree view as a current child node, and placing the current child node at a position adjacent to and behind the current root node in the linear linked list;
and step 3: judging whether the current child node is a leaf node, if so, executing the step 4, otherwise, determining that the current child node is a current root node, and executing the step 2;
and 4, step 4: and (3) putting the newly generated child nodes except the current child node under the current root node in the tree view into the linear chain table at a position adjacent to the current child node and behind the current child node, determining the child node newly placed in the linear chain table as the current child node, and executing the step 3 until all the root nodes and the child nodes in the tree view are determined to be placed in the linear chain table.
Preferably, after determining that all root nodes and child nodes in the tree view are placed in the linear linked list, the method further includes:
and if the copy-on-write operation needs to be carried out on the root node which is firstly put into the linear linked list, copying the data which is stored in the root node into a node which is positioned behind the root node and is adjacent to the root node, and carrying out the copy-on-write operation on the root node which is firstly put into the linear linked list.
Preferably, after determining that all root nodes and child nodes in the tree view are placed in the linear linked list, the method further includes:
if the snapshot relationship between two adjacent nodes in the linear linked list needs to be deleted, determining that the two nodes needing to be deleted for the snapshot relationship are respectively a first node and a second node from early to late according to the time of being put into the linear linked list, copying the data of the second node which is dependent on the data of the node behind the second node and adjacent to the second node to the node behind the second node and adjacent to the second node, and deleting the snapshot relationship between the first node and the second node.
Preferably, after determining that all root nodes and child nodes in the tree view are placed in the linear linked list, the method further includes:
and displaying the linear linked list on a screen of a specified terminal.
A snapshot volume relationship simulation apparatus, comprising:
an acquisition module to: acquiring a tree view generated based on a logical relationship between snapshots contained in a snapshot volume;
a first conversion module to: determining a root node of the tree view as a current root node, and putting the current root node into a linear linked list;
a second conversion module to: determining a newly generated child node under a current root node in the tree view as a current child node, and placing the current child node at a position adjacent to and behind the current root node in the linear linked list;
a determination module configured to: judging whether the current child node is a leaf node, if so, indicating a third conversion module to work, and if not, determining that the current child node is a current root node and indicating a second conversion module to work;
a third conversion module to: and placing the newly generated child nodes except the current child node under the current root node in the tree view into the linear linked list at a position adjacent to the current child node and behind the current child node, determining the newly placed child node in the linear linked list as the current child node, and indicating the judging module to work until all the root nodes and the child nodes in the tree view are placed into the linear linked list.
Preferably, the method further comprises the following steps:
a copy-on-write module to: after all root nodes and child nodes in the tree view are determined to be placed in the linear linked list, if the root node which is placed in the linear linked list firstly needs to be subjected to copy-on-write operation, the data which is stored in the root node is copied to the node which is located behind the root node and adjacent to the root node, and the root node which is placed in the linear linked list firstly is subjected to copy-on-write operation.
Preferably, the method further comprises the following steps:
a relationship deletion module to: after all root nodes and child nodes in the tree view are determined to be placed in the linear linked list, if the snapshot relationship between two adjacent nodes in the linear linked list needs to be deleted, determining that the two nodes needing to be deleted are respectively a first node and a second node from early to late according to the time of being placed in the linear linked list, copying the second node to the node which is located behind the second node and is adjacent to the second node and depends on the data of the node which is located behind the second node and is adjacent to the second node, and deleting the snapshot relationship between the first node and the second node.
Preferably, the method further comprises the following steps:
a display module for: and after all root nodes and child nodes in the tree view are determined to be placed in the linear linked list, displaying the linear linked list on a screen of a specified terminal.
The invention provides a method and a device for simulating snapshot volume relationship, wherein the method comprises the following steps: step 1: the method comprises the steps of obtaining a tree view generated based on the logical relation between snapshots contained in a snapshot volume, determining a root node of the tree view as a current root node, and placing the current root node into a linear linked list; step 2: determining a newly generated child node under a current root node in the tree view as a current child node, and placing the current child node at a position adjacent to and behind the current root node in the linear linked list; and step 3: judging whether the current child node is a leaf node, if so, executing the step 4, otherwise, determining that the current child node is a current root node, and executing the step 2; and 4, step 4: and (3) putting the newly generated child nodes except the current child node under the current root node in the tree view into the linear chain table at a position adjacent to the current child node and behind the current child node, determining the child node newly placed in the linear chain table as the current child node, and executing the step 3 until all the root nodes and the child nodes in the tree view are determined to be placed in the linear chain table. In the technical scheme disclosed by the application, through the steps, the tree view obtained based on the logical relationship between the snapshots in the snapshot volume is converted into the linear linked list, so that the representation mode of the logical relationship between the snapshots in the snapshot volume is simplified, and the linear linked list is more visual compared with the tree view, so that the management of the logical relationship between the snapshots contained in the snapshot volume is more convenient.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a snapshot volume relationship simulation method according to an embodiment of the present invention;
fig. 2 is an exemplary diagram of a tree view corresponding to a snapshot volume in a snapshot volume relationship simulation method according to an embodiment of the present invention;
fig. 3 is an exemplary diagram of a linear linked list corresponding to a snapshot volume in a snapshot volume relationship simulation method according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a snapshot volume relationship simulation apparatus according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, a flowchart of a snapshot volume relationship simulation method according to an embodiment of the present invention is shown, where the method includes the following steps:
s11: the method comprises the steps of obtaining a tree view generated based on the logical relation between snapshots contained in a snapshot volume, determining a root node of the tree view as a current root node, and placing the current root node into a linear linked list.
It should be noted that the snapshot volume includes a source volume and a plurality of snapshots obtained by performing snapshot operations based on the source volume, and the snapshots include common snapshots and cascaded snapshots; the generation of the corresponding tree view based on the logical relationship between the snapshots included in the snapshot volume is consistent with the implementation principle of the corresponding technical scheme in the prior art, and is not described herein again. And a source volume in the snapshot volume is a root node in the tree view, and the root node is used as a first node in the linear linked list and is put into the linear linked list, so that the linear linked list with only one node is obtained.
S12: and determining a newly generated child node under a current root node in the tree view as a current child node, and placing the current child node in a linear linked list at a position adjacent to and behind the current root node.
Because a plurality of child nodes generally exist under the current root node, the child nodes are generally generated according to the time sequence, the newly generated child node is also the closest to the current moment in time, and the child node is placed in the linear linked list at a position adjacent to the current root node and behind the current root node, so that the conversion of the child node from the tree view to the linear linked list is realized.
S13: and judging whether the current child node is a leaf node, if so, executing S14, and if not, executing step S15.
The leaf node and the leaf node in the present application are concepts in discrete mathematics, and a node without a child node (i.e., degree of 0) in a tree is called a leaf node, which is called a "leaf" for short, i.e., a leaf refers to a node with degree of 0, which is also called a terminal node. The child nodes are leaf nodes, and therefore the child nodes of the child nodes do not exist under the child nodes.
S14: and S13 is executed until all root nodes and child nodes in the tree view are determined to be put into the linear chain table.
After the conversion from the tree view to the linear linked list of the next child node of the current root node is completed, the conversion from the tree view to the linear linked list of other child nodes existing under the current root node is realized through the step, the operation is stopped until all nodes in the tree view are put into the linear linked list, and the linear linked list obtained at the moment is the linear linked list obtained by the conversion from the tree view. It should be noted that, a determining step may be added after determining that the current child node is a leaf node, that is: judging whether nodes which are not put into the linear linked list exist in the tree view (the nodes in the application are general names of root nodes and child nodes contained in the tree view), if so, executing the step S14, otherwise, determining that all the root nodes and the child nodes in the tree view are put into the linear linked list, namely, completing the conversion from the tree view to the linear linked list.
S15: and determining that the current child node is the current root node, and executing the step S12.
In the technical scheme disclosed by the application, through the steps, the tree view obtained based on the logical relationship between the snapshots in the snapshot volume is converted into the linear linked list, so that the representation mode of the logical relationship between the snapshots in the snapshot volume is simplified, and the linear linked list is more visual compared with the tree view, so that the management of the logical relationship between the snapshots contained in the snapshot volume is more convenient.
The method for simulating a snapshot volume relationship provided in the embodiment of the present invention may further include, after determining that all root nodes and child nodes in the tree view are placed in the linear chain table:
if Copy On Write (COW) operation needs to be performed on the root node that is first put in the linear chain table, the data that has been stored in the root node is copied to a node that is located after and adjacent to the root node, and the copy on write operation is performed on the root node that is first put in the linear chain table.
It should be noted that the root node that is first placed in the linear linked list is the corresponding node of the corresponding source volume, and when copy-on-write operation needs to be performed on the source volume, only the data that already exists in the source volume needs to be copied to the node that is located behind the source volume and adjacent to the source volume in the linear linked list, and then copy-on-write operation is performed on the source volume. Different from the prior art that when the copy-on-write operation needs to be performed on the source volume, the existing data in the source volume needs to be determined according to the tree view, and the data in the source volume is directly written into the next node when the copy-on-write operation needs to be performed on the source volume by the method, so that the effective implementation of the copy-on-write operation and the effective storage of the corresponding data are ensured, the understanding of a user is facilitated, the execution program of the corresponding step is written simply, the execution efficiency is improved, and the management is facilitated.
The method for simulating a snapshot volume relationship provided in the embodiment of the present invention may further include, after determining that all root nodes and child nodes in the tree view are placed in the linear chain table:
if the snapshot relationship between two adjacent nodes in the linear linked list needs to be deleted, determining that the two nodes needing to be deleted are respectively a first node and a second node from early to late according to the time of being put into the linear linked list, copying the second node to the node which is behind the second node and is adjacent to the second node and depends on the data of the node behind the second node and is adjacent to the second node, and deleting the snapshot relationship between the first node and the second node.
It should be noted that the principle that any node depends on data of another node is consistent with the principle of the corresponding technical solution in the prior art, which generally means that the data is updated after the node stores any data and the data stored in the node is stored in another node, and correspondingly, the second node depends on data of a node located behind and adjacent to the second node, and generally means that the data is updated after the second node stores any data and the data stored in the second node is stored in a node located behind and adjacent to the second node when the data is updated. The second node is copied to the node which is behind the second node and adjacent to the second node depending on the data of the node which is behind the second node and adjacent to the second node, and then the snapshot relationship between the first node and the second node is deleted, so that the effective storage of the data can be ensured, and the deletion of the snapshot relationship can be simply, conveniently and quickly realized.
The implementation steps of the copy-on-write operation and the snapshot relation deletion are simple and general, so that the user can understand the steps conveniently, the corresponding step execution program is simple to write, the execution efficiency is improved, and the management is convenient.
The method for simulating a snapshot volume relationship provided in the embodiment of the present invention may further include, after determining that all root nodes and child nodes in the tree view are placed in the linear chain table:
and displaying the linear linked list to a screen of a specified terminal.
Wherein appointed terminal can be for the preset terminal that corresponds with appointed staff, through showing the linear linked list on the screen at appointed terminal, can make the staff know the linear linked list through this screen, and then determine snapshot book relation, convenient and fast through this linear linked list.
The above technical solutions disclosed in the present application are described in detail below with specific examples:
firstly, S represents a source volume, snapshots T1, T2, T3 and T4 are marked on S respectively, snapshots T5 and T6 are marked on T1, snapshots T7 and T8 are marked on T5, snapshot T9 is marked on T2, and snapshot T10 is marked on T4. The tree view is generated from the logical relationship of creating snapshots as described above, as shown in FIG. 2.
Converting the tree view into a linear chain table according to the technical scheme disclosed by the application, wherein a root node S is used as a head of the chain table, first-level child nodes T1, T2, T3 and T4 are arranged under the S according to time sequence, and the newly generated child nodes T4 are placed behind the S; since T4 is not a leaf node, taking T4 as the current root node, the child node T10 generated later is placed after T4; since T10 is a leaf node, the path traversal ends. The path of T3 is then traversed, T3 is placed in the linear linked list behind T10, and so on, until all nodes are traversed (i.e., all nodes are placed in the linear linked list), forming the linear linked list as shown in FIG. 3.
When a COW operation is performed on S, e.g., writing data to the source volume S, the old data on S (i.e., the already stored data) is copied to T4; when the snapshot relation between S and T4 needs to be deleted, the data of the snapshot volume T4, which depends on T10, is copied to the right to T10, so as to ensure the correctness of the data at other times.
An embodiment of the present invention further provides a snapshot volume relationship simulation apparatus, as shown in fig. 4, which may include:
an obtaining module 11, configured to: acquiring a tree view generated based on a logical relationship between snapshots contained in a snapshot volume;
a first conversion module 12 for: determining a root node of the tree view as a current root node, and putting the current root node into a linear linked list;
a second conversion module 13 for: determining a newly generated child node under a current root node in the tree view as a current child node, and placing the current child node in a linear chain table at a position adjacent to and behind the current root node;
a determining module 14, configured to: judging whether the current child node is a leaf node, if so, indicating a third conversion module to work, and if not, determining that the current child node is a current root node and indicating a second conversion module to work;
a third conversion module 15 for: and placing the newly generated child node except the current child node under the current root node in the tree view into a position which is adjacent to the current child node and behind the current child node in the linear chain table, determining the child node newly placed into the linear chain table as the current child node, and indicating the judgment module to work until all the root nodes and the child nodes in the tree view are placed into the linear chain table.
The snapshot volume relationship simulation apparatus provided in the embodiment of the present invention may further include:
a copy-on-write module to: after all root nodes and child nodes in the tree view are determined to be placed in the linear linked list, if the root node which is placed in the linear linked list firstly needs to be subjected to copy-on-write operation, the data which is stored in the root node is copied to the node which is located behind the root node and adjacent to the root node, and the copy-on-write operation is performed on the root node which is placed in the linear linked list firstly.
The snapshot volume relationship simulation apparatus provided in the embodiment of the present invention may further include:
a relationship deletion module to: after all root nodes and child nodes in the tree view are determined to be placed in the linear linked list, if the snapshot relationship between two adjacent nodes in the linear linked list needs to be deleted, determining that the two nodes needing to be deleted are respectively a first node and a second node from early to late according to the time of being placed in the linear linked list, copying the second node to the node which is located behind the second node and adjacent to the second node and deletes the snapshot relationship between the first node and the second node, wherein the two nodes needing to be deleted are the first node and the second node from early to late.
The snapshot volume relationship simulation apparatus provided in the embodiment of the present invention may further include:
a display module for: and after all root nodes and child nodes in the tree view are determined to be placed in the linear linked list, displaying the linear linked list on a screen of a specified terminal.
For a description of a relevant part in the snapshot volume relationship simulation apparatus according to the embodiment of the present invention, reference is made to detailed descriptions of a corresponding part in the snapshot volume relationship simulation method according to the embodiment of the present invention, and details are not described herein again. In addition, parts of the technical solutions provided in the embodiments of the present invention that are consistent with the implementation principles of the corresponding technical solutions in the prior art are not described in detail, so as to avoid redundant description.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (6)
1. A snapshot volume relationship simulation method, comprising:
step 1: the method comprises the steps of obtaining a tree view generated based on the logical relation between snapshots contained in a snapshot volume, determining a root node of the tree view as a current root node, and placing the current root node into a linear linked list;
step 2: determining a newly generated child node under a current root node in the tree view as a current child node, and placing the current child node at a position adjacent to and behind the current root node in the linear linked list;
and step 3: judging whether the current child node is a leaf node, if so, executing the step 4, otherwise, determining that the current child node is a current root node, and executing the step 2;
and 4, step 4: placing the newly generated child nodes except the current child node under the current root node in the tree view into the linear linked list at a position adjacent to the current child node and behind the current child node, determining the child nodes newly placed in the linear linked list as the current child nodes, and executing the step 3 until all the root nodes and the child nodes in the tree view are determined to be placed in the linear linked list;
after determining that all root nodes and child nodes in the tree view are placed in the linear linked list, the method further includes:
and if the copy-on-write operation needs to be carried out on the root node which is firstly put into the linear linked list, copying the data which is stored in the root node into a node which is positioned behind the root node and is adjacent to the root node, and carrying out the copy-on-write operation on the root node which is firstly put into the linear linked list.
2. The method of claim 1, wherein determining that all root nodes and child nodes in the treeview have been placed in the linear linked list further comprises:
if the snapshot relationship between two adjacent nodes in the linear linked list needs to be deleted, determining that the two nodes needing to be deleted for the snapshot relationship are respectively a first node and a second node from early to late according to the time of being put into the linear linked list, copying the data of the second node which is dependent on the data of the node behind the second node and adjacent to the second node to the node behind the second node and adjacent to the second node, and deleting the snapshot relationship between the first node and the second node.
3. The method of claim 1, wherein determining that all root nodes and child nodes in the treeview have been placed in the linear linked list further comprises:
and displaying the linear linked list on a screen of a specified terminal.
4. A snapshot volume relationship simulation apparatus, comprising:
an acquisition module to: acquiring a tree view generated based on a logical relationship between snapshots contained in a snapshot volume;
a first conversion module to: determining a root node of the tree view as a current root node, and putting the current root node into a linear linked list;
a second conversion module to: determining a newly generated child node under a current root node in the tree view as a current child node, and placing the current child node at a position adjacent to and behind the current root node in the linear linked list;
a determination module configured to: judging whether the current child node is a leaf node, if so, indicating a third conversion module to work, and if not, determining that the current child node is a current root node and indicating a second conversion module to work;
a third conversion module to: placing the newly generated child nodes except the current child node under the current root node in the tree view into the linear linked list, wherein the child nodes are adjacent to the current child node and behind the current child node, determining the child nodes newly placed in the linear linked list as the current child nodes, and indicating the judging module to work until all the root nodes and the child nodes in the tree view are placed in the linear linked list;
the device further comprises:
a copy-on-write module to: after all root nodes and child nodes in the tree view are determined to be placed in the linear linked list, if the root node which is placed in the linear linked list firstly needs to be subjected to copy-on-write operation, the data which is stored in the root node is copied to the node which is located behind the root node and adjacent to the root node, and the root node which is placed in the linear linked list firstly is subjected to copy-on-write operation.
5. The apparatus of claim 4, further comprising:
a relationship deletion module to: after all root nodes and child nodes in the tree view are determined to be placed in the linear linked list, if the snapshot relationship between two adjacent nodes in the linear linked list needs to be deleted, determining that the two nodes needing to be deleted are respectively a first node and a second node from early to late according to the time of being placed in the linear linked list, copying the second node to the node which is located behind the second node and is adjacent to the second node and depends on the data of the node which is located behind the second node and is adjacent to the second node, and deleting the snapshot relationship between the first node and the second node.
6. The apparatus of claim 4, further comprising:
a display module for: and after all root nodes and child nodes in the tree view are determined to be placed in the linear linked list, displaying the linear linked list on a screen of a specified terminal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710522555.6A CN107291400B (en) | 2017-06-30 | 2017-06-30 | Snapshot volume relation simulation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710522555.6A CN107291400B (en) | 2017-06-30 | 2017-06-30 | Snapshot volume relation simulation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107291400A CN107291400A (en) | 2017-10-24 |
| CN107291400B true CN107291400B (en) | 2020-07-28 |
Family
ID=60099294
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710522555.6A Active CN107291400B (en) | 2017-06-30 | 2017-06-30 | Snapshot volume relation simulation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107291400B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109240849B (en) * | 2018-08-09 | 2021-05-18 | 苏州市科远软件技术开发有限公司 | Data backup method and device and multipoint control unit for video conference system |
| CN110362431B (en) * | 2019-07-23 | 2022-07-05 | 中国工商银行股份有限公司 | Data backup method and device |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101042816A (en) * | 2007-04-27 | 2007-09-26 | 重庆邮电大学 | Interactive switching system and processing method based on SDL graphics relationship |
| CN102929745A (en) * | 2012-09-26 | 2013-02-13 | 东软集团股份有限公司 | Status data updating method and device for virtual equipments |
| CN103440263A (en) * | 2013-08-01 | 2013-12-11 | 清华大学 | Method for evolutionary analysis on anonymous graph data |
| CN103544077A (en) * | 2012-07-17 | 2014-01-29 | 华为技术有限公司 | Data processing method and device and shared memory device |
| CN103999034A (en) * | 2011-12-20 | 2014-08-20 | Netapp股份有限公司 | System, method and computer program product for providing sparse snapshots |
| CN105138281A (en) * | 2015-08-05 | 2015-12-09 | 华为技术有限公司 | Physical disk sharing method and apparatus |
| US9244928B1 (en) * | 2013-03-05 | 2016-01-26 | Ca, Inc. | Systems and methods for directory snapshot |
| CN105653716A (en) * | 2015-12-31 | 2016-06-08 | 北京奇艺世纪科技有限公司 | Database construction method and system based on classification-attribute-value |
-
2017
- 2017-06-30 CN CN201710522555.6A patent/CN107291400B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101042816A (en) * | 2007-04-27 | 2007-09-26 | 重庆邮电大学 | Interactive switching system and processing method based on SDL graphics relationship |
| CN103999034A (en) * | 2011-12-20 | 2014-08-20 | Netapp股份有限公司 | System, method and computer program product for providing sparse snapshots |
| CN103544077A (en) * | 2012-07-17 | 2014-01-29 | 华为技术有限公司 | Data processing method and device and shared memory device |
| CN102929745A (en) * | 2012-09-26 | 2013-02-13 | 东软集团股份有限公司 | Status data updating method and device for virtual equipments |
| US9244928B1 (en) * | 2013-03-05 | 2016-01-26 | Ca, Inc. | Systems and methods for directory snapshot |
| CN103440263A (en) * | 2013-08-01 | 2013-12-11 | 清华大学 | Method for evolutionary analysis on anonymous graph data |
| CN105138281A (en) * | 2015-08-05 | 2015-12-09 | 华为技术有限公司 | Physical disk sharing method and apparatus |
| CN105653716A (en) * | 2015-12-31 | 2016-06-08 | 北京奇艺世纪科技有限公司 | Database construction method and system based on classification-attribute-value |
Non-Patent Citations (1)
| Title |
|---|
| 基于人工标注的视频检索系统的设计与实现;田若坪;《中国优秀硕士学位论文全文数据库 信息科技辑》;20160731;第4.1.3-4.1.4节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107291400A (en) | 2017-10-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2021088724A1 (en) | Testing method and apparatus | |
| CN110147411B (en) | Data synchronization method, device, computer equipment and storage medium | |
| CN109739855B (en) | Method and system for realizing data sheet splicing and automatically training machine learning model | |
| JP4704893B2 (en) | Computer system, management computer, storage system, and backup management method | |
| WO2017162032A1 (en) | Method and device for executing data recovery operation | |
| CN104216793B (en) | Application Backup, the method and apparatus recovered | |
| CN111290956B (en) | Brain graph-based test method and device, electronic equipment and storage medium | |
| TWI497324B (en) | Flexible data archival using a model-driven approach | |
| CN103268226B (en) | A kind of test script file generates method and device | |
| US10726042B2 (en) | Replication control using eventually consistent meta-data | |
| CN106844089B (en) | Method and equipment for recovering tree data storage | |
| CN107491383A (en) | Catching method, device and the mobile terminal of application crashes Operation Log | |
| US8321867B1 (en) | Request processing for stateless conformance engine | |
| KR20130019366A (en) | Efficiently collecting transction-separated metrics in a distributed enviornment | |
| Salihoglu et al. | Graft: A debugging tool for apache giraph | |
| CN107291400B (en) | Snapshot volume relation simulation method and device | |
| CN105512276B (en) | Method and device for constructing junk file and electronic equipment | |
| CN114924914B (en) | Disk partition table information backup and recovery method and system | |
| US9201897B1 (en) | Global data storage combining multiple back-end storage devices | |
| CN109933461A (en) | A kind of method and apparatus of data processing | |
| US10552995B2 (en) | Hierarchical information visualizer and editor | |
| CN109522373B (en) | Data processing method and device, electronic equipment and storage medium | |
| CN112306870A (en) | Data processing method and device based on live APP | |
| WO2017067397A1 (en) | Data recovery method and device | |
| WO2014164079A1 (en) | Method and system for analyzing a trace timeline of computer system activity |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200701 Address after: 215100 No. 1 Guanpu Road, Guoxiang Street, Wuzhong Economic Development Zone, Suzhou City, Jiangsu Province Applicant after: SUZHOU LANGCHAO INTELLIGENT TECHNOLOGY Co.,Ltd. Address before: 450018 Henan province Zheng Dong New District of Zhengzhou City Xinyi Road No. 278 16 floor room 1601 Applicant before: ZHENGZHOU YUNHAI INFORMATION TECHNOLOGY Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |