CN107291400B - A method and device for simulating snapshot volume relationship - Google Patents
A method and device for simulating snapshot volume relationship 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
- linked list
- current
- linear linked
- nodes
- 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 25
- 238000006243 chemical reaction Methods 0.000 claims description 13
- 238000004088 simulation Methods 0.000 claims description 9
- 238000012217 deletion Methods 0.000 claims description 4
- 230000037430 deletion Effects 0.000 claims description 4
- 230000001419 dependent effect Effects 0.000 claims 1
- 230000009466 transformation Effects 0.000 description 6
- 230000010076 replication Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 238000006424 Flood reaction Methods 0.000 description 1
- 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
本发明公开了一种快照卷关系模拟方法及装置，该方法包括：步骤1：获取快照卷的树形视图，确定树形视图的根节点为当前根节点，将当前根节点放到线性链表中；步骤2：确定树形视图中当前根节点下最新生成的子节点为当前子节点，将当前子节点放到线性链表中位于当前根节点后面的位置；步骤3：判断当前子节点是否为叶子节点，如果是，执行步骤4，如果否，确定当前子节点为当前根节点，执行步骤2；步骤4：将树形视图中当前根节点下除当前子节点外最新生成的子节点、放到线性链表中位于当前子节点后面的位置，并确定该子节点为当前子节点，执行步骤3，直至确定树形视图中的全部节点均被放到线性链表为止。通过线性链表更加直观的展示快照卷关系。
The invention discloses a method and device for simulating a snapshot volume relationship. The method includes: step 1: acquiring a tree view of the snapshot volume, determining the root node of the tree view as the current root node, and placing the current root node in a linear linked list ; Step 2: Determine the newly generated child node under the current root node in the tree view as the current child node, and place the current child node in the linear linked list at the position behind the current root node; Step 3: Determine whether the current child node is a leaf node, if yes, go to step 4, if no, determine that the current child node is the current root node, go to step 2; The position behind the current child node in the linear linked list is determined, and the child node is determined as the current child node, and step 3 is performed until it is determined that all nodes in the tree view are placed in the linear linked list. The snapshot volume relationship is more intuitively displayed through a linear linked list.
Description
技术领域technical field
本发明涉及存储灾备技术领域，更具体地说，涉及一种快照卷关系模拟方法及装置。The present invention relates to the technical field of storage disaster recovery, and more particularly, to a method and device for simulating a snapshot volume relationship.
背景技术Background technique
在云计算时代，海量数据充斥着生活的方方面面，一方面要求数据传输快，一方面要求数据不丢失。数据复制技术就是为了保证数据不丢失的灾备技术，包括本地复制、远程复制、双活等。其中本地复制中，快照是基于时间点的复制，其响应快、不影响主机IO、可回滚到任一快照时间点。随着数据量的不断增大，用户需要对源卷创建多个快照，以及级联快照(快照的快照)，以保证多个时间点的数据备份。当快照及级联快照数目较多时，往往会画一个树形视图模拟快照卷关系(快照卷关系即快照卷中包含的快照间的逻辑关系)，但是由于树形视图不够直观，因此不便于对快照卷关系的管理。In the era of cloud computing, massive data floods all aspects of life. On the one hand, data transmission is required to be fast, and on the other hand, data is not lost. Data replication technology is a disaster recovery technology to ensure that data is not lost, including local replication, remote replication, active-active and so on. In local replication, snapshots are point-in-time replication, which responds quickly, does not affect host IO, and can be rolled back to any snapshot time point. As the amount of data continues to increase, users need to create multiple snapshots of the source volume, as well as cascading snapshots (snapshots of snapshots) to ensure data backup at multiple points in time. When the number of snapshots and cascading snapshots is large, a tree view is often drawn to simulate the snapshot volume relationship (the snapshot volume relationship is the logical relationship between the snapshots contained in the snapshot volume). However, since the tree view is not intuitive enough, it is inconvenient to Management of snapshot volume relationships.
综上所述，如何以供一种更加直观的展示快照卷关系以便于对快照卷关系进行管理的技术方案，是本领域技术人员亟待解决的问题。To sum up, how to provide a technical solution for more intuitively displaying the snapshot volume relationship so as to facilitate the management of the snapshot volume relationship is an urgent problem to be solved by those skilled in the art.
发明内容SUMMARY OF THE INVENTION
本发明的目的是提供一种快照卷关系模拟方法及装置，能够更加直观的展示快照卷关系，便于对快照卷关系进行管理。The purpose of the present invention is to provide a snapshot volume relationship simulation method and device, which can more intuitively display the snapshot volume relationship and facilitate the management of the snapshot volume relationship.
为了实现上述目的，本发明提供如下技术方案：In order to achieve the above object, the present invention provides the following technical solutions:
一种快照卷关系模拟方法，包括：A snapshot volume relationship simulation method, including:
步骤1：获取基于快照卷中包含的快照之间的逻辑关系生成的树形视图，确定所述树形视图的根节点为当前根节点，并将当前根节点放到线性链表中；Step 1: obtain a tree view generated based on the logical relationship between the snapshots contained in the snapshot volume, determine that the root node of the tree view is the current root node, and place the current root node in the linear linked list;
步骤2：确定所述树形视图中当前根节点下最新生成的子节点为当前子节点，并将当前子节点放到所述线性链表中与当前根节点相邻且位于当前根节点后面的位置；Step 2: Determine the newly generated child node under the current root node in the tree view as the current child node, and place the current child node in the linear linked list adjacent to the current root node and behind the current root node ;
步骤3：判断当前子节点是否为叶子节点，如果是，执行步骤4，如果否，确定当前子节点为当前根节点，执行步骤2；Step 3: determine whether the current child node is a leaf node, if so, go to step 4, if not, determine that the current child node is the current root node, go to step 2;
步骤4：将所述树形视图中当前根节点下除当前子节点外最新生成的子节点、放到所述线性链表中与当前子节点相邻且位于当前子节点后面的位置，并确定该最新放置到所述线性链表中的子节点为当前子节点，执行步骤3，直至确定所述树形视图中的全部根节点及子节点均被放到所述线性链表为止。Step 4: Put the newly generated child node except the current child node under the current root node in the tree view into the position adjacent to the current child node and behind the current child node in the linear linked list, and determine the The child node newly placed in the linear linked list is the current child node, and step 3 is performed until it is determined that all root nodes and child nodes in the tree view are placed in 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 a copy-on-write operation needs to be performed on the root node that is first placed in the linear linked list, the data already stored in the root node is copied to the node located after the root node and adjacent to the root node, and the The root node in the linear linked list is first placed to perform a copy-on-write operation.
优选的，确定所述树形视图中的全部根节点及子节点均被放到所述线性链表之后，还包括：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, it is determined that the two nodes whose snapshot relationship needs to be deleted are the first node and the first node according to the time of being placed in the linear linked list from early to late. Second node, copy the data of the second node depending on the node located behind and adjacent to it to the node located behind the second node and adjacent to the second node, and delete the first node A snapshot relationship between a 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:
将所述线性链表展示到指定终端的屏幕上。The linear linked list is displayed on the screen of the designated terminal.
一种快照卷关系模拟装置，包括：A snapshot volume relationship simulation device, comprising:
获取模块，用于：获取基于快照卷中包含的快照之间的逻辑关系生成的树形视图；an acquisition module, used to: acquire a tree view generated based on the logical relationship between the snapshots contained in the snapshot volume;
第一转化模块，用于：确定所述树形视图的根节点为当前根节点，并将当前根节点放到线性链表中；The first conversion module is used for: determining that the root node of the tree view is the current root node, and placing the current root node in the linear linked list;
第二转化模块，用于：确定所述树形视图中当前根节点下最新生成的子节点为当前子节点，并将当前子节点放到所述线性链表中与当前根节点相邻且位于当前根节点后面的位置；The second conversion module is used for: determining the newly generated child node under the current root node in the tree view as the current child node, and placing the current child node in the linear linked list adjacent to the current root node and located in the current the position behind the root node;
判断模块，用于：判断当前子节点是否为叶子节点，如果是，则指示第三转化模块工作，如果否，确定当前子节点为当前根节点，指示第二转化模块工作；The judgment module is used for: judging whether the current child node is a leaf node, and if so, instructs the third conversion module to work, if not, determines that the current subnode is the current root node, and instructs the second conversion module to work;
第三转化模块，用于：将所述树形视图中当前根节点下除当前子节点外最新生成的子节点、放到所述线性链表中与当前子节点相邻且位于当前子节点后面的位置，并确定该最新放置到所述线性链表中的子节点为当前子节点，指示所述判断模块工作，直至确定所述树形视图中的全部根节点及子节点均被放到所述线性链表为止。The third conversion module is used for: placing the newly generated child node except the current child node under the current root node in the tree view, into the linear linked list adjacent to the current child node and located behind the current child node position, and determine that the newest child node placed in the linear linked list is the current child node, instructing the judgment module to work until it is determined that all root nodes and child nodes in the tree view are placed in the linear list up to the chain.
优选的，还包括：Preferably, it also includes:
写时复制模块，用于：确定所述树形视图中的全部根节点及子节点均被放到所述线性链表之后，如果需要对最先放到所述线性链表中的根节点进行写时复制操作，则将该根节点中已经存储的数据拷贝至位于该根节点之后且与该根节点相邻的节点中，对最先放到所述线性链表中的根节点进行写时复制操作。A copy-on-write module is used to: determine that all root nodes and child nodes in the tree view are placed after the linear linked list, and if the root node first placed in the linear linked list needs to be written For a copy operation, the data already stored in the root node is copied to a node located after the root node and adjacent to the root node, and a copy-on-write operation is performed on the root node first placed in the linear linked list.
优选的，还包括：Preferably, it also includes:
关系删除模块，用于：确定所述树形视图中的全部根节点及子节点均被放到所述线性链表之后，如果需要删除所述线性链表中相邻两个节点间的快照关系，则确定需要被删除快照关系的两个节点按照被放到所述线性链表中时间由早到晚分别为第一节点和第二节点，将所述第二节点依赖于位于其后面且与其相邻的节点的数据、拷贝至位于所述第二节点后面且与所述第二节点相邻的节点中，并删除所述第一节点及所述第二节点间的快照关系。A relationship deletion module, configured to: determine that all root nodes and child nodes in the tree view are placed after the linear linked list, and if the snapshot relationship between two adjacent nodes in the linear linked list needs to be deleted, then It is determined that the two nodes whose snapshot relationship needs to be deleted are the first node and the second node respectively according to the time of being placed in the linear linked list from early to late, and the second node depends on the next node located behind and adjacent to it. The data of the node is copied to a node located behind the second node and adjacent to the second node, and the snapshot relationship between the first node and the second node is deleted.
优选的，还包括：Preferably, it also includes:
展示模块，用于：确定所述树形视图中的全部根节点及子节点均被放到所述线性链表之后，将所述线性链表展示到指定终端的屏幕上。The display module is configured to: after determining that all root nodes and child nodes in the tree view are placed in the linear linked list, display the linear linked list on the screen of a designated terminal.
本发明提供了一种快照卷关系模拟方法及装置，其中该方法包括：步骤1：获取基于快照卷中包含的快照之间的逻辑关系生成的树形视图，确定所述树形视图的根节点为当前根节点，并将当前根节点放到线性链表中；步骤2：确定所述树形视图中当前根节点下最新生成的子节点为当前子节点，并将当前子节点放到所述线性链表中与当前根节点相邻且位于当前根节点后面的位置；步骤3：判断当前子节点是否为叶子节点，如果是，执行步骤4，如果否，确定当前子节点为当前根节点，执行步骤2；步骤4：将所述树形视图中当前根节点下除当前子节点外最新生成的子节点、放到所述线性链表中与当前子节点相邻且位于当前子节点后面的位置，并确定该最新放置到所述线性链表中的子节点为当前子节点，执行步骤3，直至确定所述树形视图中的全部根节点及子节点均被放到所述线性链表为止。本申请公开的技术方案中，通过上述步骤，将基于快照卷中快照之间的逻辑关系得到的树形视图转化为线性链表，简化了快照卷中快照之间的逻辑关系的表示方式，且线性链表相对于树形视图来说更加直观，因此也更便于对快照卷中包含的快照间逻辑关系的管理。The present invention provides a method and device for simulating a snapshot volume relationship, wherein the method includes: Step 1: Acquire a tree view generated based on the logical relationship between snapshots included in the snapshot volume, and determine the root node of the tree view is the current root node, and the current root node is placed in the linear linked list; Step 2: Determine the newly generated child node under the current root node in the tree view as the current child node, and place the current child node in the linear linked list. The position in the linked list adjacent to the current root node and behind the current root node; Step 3: determine whether the current child node is a leaf node, if so, go to step 4, if not, determine that the current child node is the current root node, go to step 2; Step 4: place the newly generated child node except the current child node under the current root node in the tree view, and place it in the linear linked list at a position adjacent to the current child node and behind the current child node, and It is determined that the child node newly placed in the linear linked list is the current child node, and step 3 is performed until it is determined that all root nodes and child nodes in the tree view are placed in the linear linked list. In the technical solution disclosed in the present application, through the above steps, the tree view obtained based on the logical relationship between the snapshots in the snapshot volume is converted into a linear linked list, which simplifies the representation of the logical relationship between the snapshots in the snapshot volume, and the linearity Compared with the tree view, the linked list is more intuitive, so it is easier to manage the logical relationship between the snapshots contained in the snapshot volume.
附图说明Description of drawings
为了更清楚地说明本发明实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本发明的实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据提供的附图获得其他的附图。In order to explain the embodiments of the present invention or the technical solutions in the prior art more clearly, the following briefly introduces the accompanying drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only It is an embodiment of the present invention. For those of ordinary skill in the art, other drawings can also be obtained according to the provided drawings without creative work.
图1为本发明实施例提供的一种快照卷关系模拟方法的流程图；1 is a flowchart of a method for simulating a snapshot volume relationship according to an embodiment of the present invention;
图2为本发明实施例提供的一种快照卷关系模拟方法中快照卷对应树形视图的示例图；2 is an example diagram of a tree view corresponding to a snapshot volume in a method for simulating a snapshot volume relationship according to an embodiment of the present invention;
图3为本发明实施例提供的一种快照卷关系模拟方法中快照卷对应线性链表的示例图；3 is an example diagram of a linear linked list corresponding to a snapshot volume in a method for simulating a snapshot volume relationship provided by an embodiment of the present invention;
图4为本发明实施例提供的一种快照卷关系模拟装置的结构示意图。FIG. 4 is a schematic structural diagram of an apparatus for simulating a snapshot volume relationship according to an embodiment of the present invention.
具体实施方式Detailed ways
下面将结合本发明实施例中的附图，对本发明实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本发明一部分实施例，而不是全部的实施例。基于本发明中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本发明保护的范围。The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.
请参阅图1，其示出了本发明实施例提供的一种快照卷关系模拟方法的流程图，可以包括以下步骤：Please refer to FIG. 1, which shows a flowchart of a method for simulating a snapshot volume relationship provided by an embodiment of the present invention, which may include the following steps:
S11：获取基于快照卷中包含的快照之间的逻辑关系生成的树形视图，确定树形视图的根节点为当前根节点，并将当前根节点放到线性链表中。S11: Acquire a tree view generated based on the logical relationship between snapshots included in the snapshot volume, determine the root node of the tree view as the current root node, and place the current root node in the linear linked list.
需要说明的是，快照卷包含有源卷以及基于该源卷进行快照操作得到的多个快照，而这些快照中包含普通的快照及级联快照；基于快照卷中包含的快照之间的逻辑关系生成对应的树形视图与现有技术对应技术方案实现原理一致，在此不再赘述。快照卷中的源卷为树形视图中的根节点，将该根节点作为线性链表中的第一个节点放到线性链表中，从而得到只具有一个节点的线性链表。It should be noted that a snapshot volume includes an active volume and multiple snapshots obtained by performing a snapshot operation based on the source volume, and these snapshots include ordinary snapshots and cascaded snapshots; based on the logical relationship between the snapshots included in the snapshot volume The generation of the corresponding tree view is consistent with the implementation principle of the corresponding technical solution in the prior art, and details are not described herein again. The source volume in the snapshot volume is the root node in the tree view, and the root node is placed in the linear linked list as the first node in the linear linked list, so as to obtain a linear linked list with only one node.
S12：确定树形视图中当前根节点下最新生成的子节点为当前子节点，并将当前子节点放到线性链表中与当前根节点相邻且位于当前根节点后面的位置。S12: Determine the newly generated child node under the current root node in the tree view as the current child node, and place the current child node in a position adjacent to the current root node and behind the current root node in the linear linked list.
由于当前根节点下一般存在多个子节点，而这些子节点一般是按照时间先后顺序生成的，最新生成的子节点也即生成的时间距离当前时刻最近，将该子节点放到线性链表中与当前根节点相邻且位于当前根节点后面的位置，从而实现将该子节点由树形视图到线性链表中的转化。Since there are generally multiple child nodes under the current root node, and these child nodes are generally generated in chronological order, the newly generated child node is the generation time closest to the current moment, and the child node is placed in the linear linked list with the current time. The root node is adjacent to the position behind the current root node, so as to realize the transformation of the child node from the tree view to the linear linked list.
S13：判断当前子节点是否为叶子节点，如果是，执行S14，如果否，则执行步骤S15。S13: Determine whether the current child node is a leaf node, if yes, go to S14, if not, go to step S15.
本申请中的叶子节点同叶子结点，是离散数学当中的概念，一棵树当中没有子结点(即度为0)的结点，称为叶子结点，简称“叶子”，也即叶子是指度为0的结点，又称为终端结点。本申请中子节点为叶子节点，说明子节点下不存在该子节点的子节点。The leaf node in this application is the same as the leaf node, which is a concept in discrete mathematics. A node in a tree that has no child nodes (that is, the degree is 0) is called a leaf node, or "leaf" for short, that is, a leaf It refers to the node with degree 0, also known as the terminal node. In this application, the child node is a leaf node, which means that there is no child node of the child node under the child node.
S14：将树形视图中当前根节点下除当前子节点外最新生成的子节点、放到线性链表中与当前子节点相邻且位于当前子节点后面的位置，并确定该最新放置到线性链表中的子节点为当前子节点，执行步骤S13，直至确定树形视图中的全部根节点及子节点均被放到线性链表为止。S14: Put the newly generated child node except the current child node under the current root node in the tree view, and place it in the linear linked list at a position adjacent to the current child node and behind the current child node, and determine that the newly generated child node is placed in the linear linked list The child node in is the current child node, and step S13 is executed until it is determined that all root nodes and child nodes in the tree view are placed in the linear linked list.
完成对当前根节点下一子节点由树形视图到线性链表的转化后，通过该步骤实现对当前根节点下存在的其他子节点由树形视图到线性链表的转化，直至树形视图中的全部节点都被放到线性链表中则停止操作，此时得到的线性链表即为由树形视图转化得到的线性链表。需要说明的是，可以在确定出当前子节点是叶子节点之后加入一判断步骤，即：判断树形视图中是否存在未被放入至线性链表中的节点(本申请中的节点为对树形视图中包含的根节点及子节点的总称)，如果存在，则执行步骤S14，否则，则确定树形视图中的全部根节点及子节点均被放到线性链表，也即完成树形视图到线性链表的转化。After completing the transformation of the next child node of the current root node from a tree view to a linear linked list, this step is used to realize the transformation of other child nodes existing under the current root node from a tree view to a linear linked list, until the When all nodes are placed in the linear linked list, the operation is stopped, and the linear linked list obtained at this time is the linear linked list transformed from the tree view. It should be noted that, after determining that the current child node is a leaf node, a judgment step may be added, namely: judging whether there is a node in the tree view that has not been put into the linear linked list (the node in this application is a pair of tree-shaped nodes). The general name of the root node and the child nodes contained in the view), if there is, step S14 is executed, otherwise, it is determined that all the root nodes and child nodes in the tree view are placed in the linear linked list, that is, the tree view is completed to Linear linked list transformation.
S15：确定当前子节点为当前根节点，执行步骤S12。S15: It is determined that the current child node is the current root node, and step S12 is executed.
本申请公开的技术方案中，通过上述步骤，将基于快照卷中快照之间的逻辑关系得到的树形视图转化为线性链表，简化了快照卷中快照之间的逻辑关系的表示方式，且线性链表相对于树形视图来说更加直观，因此也更便于对快照卷中包含的快照间逻辑关系的管理。In the technical solution disclosed in the present application, through the above steps, the tree view obtained based on the logical relationship between the snapshots in the snapshot volume is converted into a linear linked list, which simplifies the representation of the logical relationship between the snapshots in the snapshot volume, and the linearity Compared with the tree view, the linked list is more intuitive, so it is easier to manage the logical relationship between the snapshots contained in the snapshot volume.
本发明实施例提供的一种快照卷关系模拟方法，确定树形视图中的全部根节点及子节点均被放到线性链表之后，还可以包括：A method for simulating a snapshot volume relationship provided by an embodiment of the present invention, after determining that all root nodes and child nodes in the tree view are placed in the linear linked list, may further include:
如果需要对最先放到线性链表中的根节点进行写时复制操作(copy on write，COW)，则将该根节点中已经存储的数据拷贝至位于该根节点之后且与该根节点相邻的节点中，对最先放到线性链表中的根节点进行写时复制操作。If a copy-on-write operation (COW) needs to be performed on the root node first placed in the linear linked list, the data already stored in the root node is copied to the root node located after the root node and adjacent to the root node Among the nodes, the copy-on-write operation is performed on the root node that is first placed in the linear linked list.
需要说明的是，最先放到线性链表中的根节点即为对应源卷对应节点，当需要向源卷中进行写时复制操作时，只需将源卷中已经存在的数据拷贝至在线性链表中位于源卷之后且与源卷相邻的节点中，再对源卷进行写时复制操作即可。不同于现有技术中当需要向源卷进行写时复制时还需要依据树形视图考虑确定向哪个节点写入源卷中已有的数据，本申请中通过上述方式在需要向源卷实现写时复制操作时直接将源卷中的数据写入下一个节点即可，不仅保证了写时复制操作的有效实现及对应数据的有效存储，且便于用户理解，编写对应的步骤执行程序也简单，提高了执行效率，便于管理。It should be noted that the root node that is first placed in the linear linked list is the node corresponding to the source volume. When copy-on-write operation is required to the source volume, it is only necessary to copy the existing data in the source volume to the online linear link. In the linked list, the node located after the source volume and adjacent to the source volume can perform the copy-on-write operation on the source volume. Different from the prior art, when copy-on-write needs to be performed to the source volume, it is necessary to consider and determine which node to write the existing data in the source volume to according to the tree view. During the copy-on-write operation, the data in the source volume can be directly written to the next node, which not only ensures the effective implementation of the copy-on-write operation and the effective storage of the corresponding data, but also is easy for users to understand, and it is also simple to write the corresponding step execution program. Improve execution efficiency and facilitate management.
本发明实施例提供的一种快照卷关系模拟方法，确定树形视图中的全部根节点及子节点均被放到线性链表之后，还可以包括：A method for simulating a snapshot volume relationship provided by an embodiment of the present invention, after determining that all root nodes and child nodes in the tree view are placed in the linear linked list, may further include:
如果需要删除线性链表中相邻两个节点间的快照关系，则确定需要被删除快照关系的两个节点按照被放到线性链表中时间由早到晚分别为第一节点和第二节点，将第二节点依赖于位于其后面且与其相邻的节点的数据、拷贝至位于第二节点后面且与第二节点相邻的节点中，并删除第一节点及第二节点间的快照关系。If the snapshot relationship between two adjacent nodes in the linear linked list needs to be deleted, it is determined that the two nodes whose snapshot relationship needs to be deleted are the first node and the second node respectively according to the time when they were placed in the linear linked list from early to late. The second node depends on the data of the node behind and adjacent to it, copies the data to the node behind and adjacent to the second node, and deletes the snapshot relationship between the first node and the second node.
需要说明的是，任一节点依赖于另一节点的数据与现有技术中对应技术方案的原理一致，一般指该节点存储任一数据后该数据被更新且另一节点存储有更新后的该数据的情况下该节点中存储的数据，对应的，第二节点依赖于位于其后面且与其相邻的节点的数据、一般指第二节点存储任一数据后该数据被更新且位于第二节点后面且与其相邻的节点中存储有更新后的该数据的情况下、第二节点中存储的该数据。将第二节点依赖于位于其后面且与其相邻的节点的数据、拷贝至位于第二节点后面且与第二节点相邻的节点中后删除第一节点和第二节点之间的快照关系，不仅可以保证数据的有效存储，还能够简便快速的实现快照关系的删除。It should be noted that the principle that any node depends on the data of another node is consistent with the corresponding technical solutions in the prior art, which generally means that after the node stores any data, the data is updated and the other node stores the updated data. In the case of data, the data stored in the node, correspondingly, the second node depends on the data of the node located behind and adjacent to it, generally means that after the second node stores any data, the data is updated and located in the second node. When the updated data is stored in the following and adjacent nodes, the data is stored in the second node. After the second node depends on the data of the node located behind and adjacent to it, copied to the node located behind the second node and adjacent to the second node, delete the snapshot relationship between the first node and the second node, It can not only ensure the effective storage of data, but also can easily and quickly delete the snapshot relationship.
上述关于写时复制操作和快照关系删除的实现步骤简单且通用，便于用户理解，编写对应的步骤执行程序也简单，提高了执行效率，便于管理。The above-mentioned implementation steps for the copy-on-write operation and the deletion of the snapshot relationship are simple and common, which is easy for users to understand, and it is also simple to write a corresponding step execution program, which improves the execution efficiency and facilitates management.
本发明实施例提供的一种快照卷关系模拟方法，确定树形视图中的全部根节点及子节点均被放到线性链表之后，还可以包括：A method for simulating a snapshot volume relationship provided by an embodiment of the present invention, after determining that all root nodes and child nodes in the tree view are placed in the linear linked list, may further include:
将线性链表展示到指定终端的屏幕上。Displays the linearly linked list on the screen of the specified terminal.
其中指定终端可以为预先设定的与指定工作人员对应的终端，通过将线性链表展示在指定终端的屏幕上，可以使得工作人员可以通过该屏幕获知线性链表，进而通过该线性链表确定出快照卷关系，方便快捷。The designated terminal can be a preset terminal corresponding to the designated staff. By displaying the linear linked list on the screen of the designated terminal, the staff can know the linear linked list through the screen, and then determine the snapshot volume through the linear linked list. relationship, convenient and quick.
下面以具体示例对本申请公开的上述技术方案进行详细说明：The above-mentioned technical solutions disclosed in the present application will be described in detail below with specific examples:
首先，S表示源卷，对S分别先后打了快照T1、T2、T3、T4，继而对T1打了快照T5、T6，又对T5打了快照T7、T8，对T2打了快照T9，对T4打了快照T10。根据如上创建快照的逻辑关系生成树形视图，如图2所示。First, S represents the source volume, and snapshots T1, T2, T3, and T4 have been taken for S, followed by snapshots T5 and T6 for T1, T7 and T8 for T5, and T9 for T2. T4 played snapshot T10. A tree view is generated according to the logical relationship of the snapshot created above, as shown in Figure 2.
按照本申请公开的上述技术方案将树形视图转化成线链表，其中根节点S作为链表头，S下按照时间先后，一级子节点为T1、T2、T3、T4，将最新生成的子节点、即T4放到S后面；由于T4不是叶子节点，因此将T4作为当前根节点，后面生成的子节点T10放到T4后面；由于T10是叶子节点，那么该条路径遍历结束。然后遍历T3这条路径，将T3放到线性链表中T10后面，以此类推，直到所有节点遍历完成(即所有节点都被放到线性链表中)，形成如图3所示的线性链表。According to the above technical solution disclosed in the present application, the tree view is converted into a line linked list, wherein the root node S is used as the head of the linked list, and the first-level child nodes under S are T1, T2, T3, and T4 in chronological order. , that is, T4 is placed after S; since T4 is not a leaf node, T4 is used as the current root node, and the child node T10 generated later is placed after T4; since T10 is a leaf node, the traversal of this path ends. Then traverse the path of T3, put T3 behind T10 in the linear linked list, and so on, until all nodes are traversed (that is, all nodes are placed in the linear linked list), forming a linear linked list as shown in Figure 3.
当对S执行COW操作时，例如往源卷S写数据，将S上的旧数据(即已经存储的数据)拷贝到T4；当需要删除S和T4间快照关系时，将快照卷T4依赖于T10的数据向右拷贝到T10上，以保证其他时刻数据的正确性。When a COW operation is performed on S, such as writing data to the source volume S, the old data on S (that is, the data that has been stored) is copied to T4; when the snapshot relationship between S and T4 needs to be deleted, the snapshot volume T4 depends on the The data of T10 is copied to the right to T10 to ensure the correctness of the data at other times.
本发明实施例还提供了一种快照卷关系模拟装置，如图4所示，可以包括：An embodiment of the present invention also provides a snapshot volume relationship simulation device, as shown in FIG. 4 , which may include:
获取模块11，用于：获取基于快照卷中包含的快照之间的逻辑关系生成的树形视图；an
第一转化模块12，用于：确定树形视图的根节点为当前根节点，并将当前根节点放到线性链表中；The
第二转化模块13，用于：确定树形视图中当前根节点下最新生成的子节点为当前子节点，并将当前子节点放到线性链表中与当前根节点相邻且位于当前根节点后面的位置；The
判断模块14，用于：判断当前子节点是否为叶子节点，如果是，则指示第三转化模块工作，如果否，确定当前子节点为当前根节点，指示第二转化模块工作；
第三转化模块15，用于：将树形视图中当前根节点下除当前子节点外最新生成的子节点、放到线性链表中与当前子节点相邻且位于当前子节点后面的位置，并确定该最新放置到线性链表中的子节点为当前子节点，指示判断模块工作，直至确定树形视图中的全部根节点及子节点均被放到线性链表为止。The
本发明实施例提供的一种快照卷关系模拟装置，还可以包括：A snapshot volume relationship simulation device provided by an embodiment of the present invention may further include:
写时复制模块，用于：确定树形视图中的全部根节点及子节点均被放到线性链表之后，如果需要对最先放到线性链表中的根节点进行写时复制操作，则将该根节点中已经存储的数据拷贝至位于该根节点之后且与该根节点相邻的节点中，对最先放到线性链表中的根节点进行写时复制操作。The copy-on-write module is used to: determine that all root nodes and child nodes in the tree view are placed after the linear linked list. The data already stored in the root node is copied to the node located after the root node and adjacent to the root node, and the copy-on-write operation is performed on the root node that is first placed in the linear linked list.
本发明实施例提供的一种快照卷关系模拟装置，还可以包括：A snapshot volume relationship simulation device provided by an embodiment of the present invention may further include:
关系删除模块，用于：确定树形视图中的全部根节点及子节点均被放到线性链表之后，如果需要删除线性链表中相邻两个节点间的快照关系，则确定需要被删除快照关系的两个节点按照被放到线性链表中时间由早到晚分别为第一节点和第二节点，将第二节点依赖于位于其后面且与其相邻的节点的数据、拷贝至位于第二节点后面且与第二节点相邻的节点中，并删除第一节点及第二节点间的快照关系。The relationship deletion module is used to: determine that all root nodes and child nodes in the tree view are placed in the linear linked list, and if the snapshot relationship between two adjacent nodes in the linear linked list needs to be deleted, it is determined that the snapshot relationship needs to be deleted. The two nodes are the first node and the second node according to the time they are placed in the linear linked list from early to late. In the following nodes and adjacent to the second node, the snapshot relationship between the first node and the second node is deleted.
本发明实施例提供的一种快照卷关系模拟装置，还可以包括：A snapshot volume relationship simulation device provided by an embodiment of the present invention may further include:
展示模块，用于：确定树形视图中的全部根节点及子节点均被放到线性链表之后，将线性链表展示到指定终端的屏幕上。The display module is used for: after confirming that all root nodes and child nodes in the tree view are placed in the linear linked list, the linear linked list is displayed on the screen of the designated terminal.
本发明实施例提供的一种快照卷关系模拟装置中相关部分的说明请参见本发明实施例提供的一种快照卷关系模拟方法中对应部分的详细说明，在此不再赘述。另外本发明实施例提供的上述技术方案中与现有技术中对应技术方案实现原理一致的部分并未详细说明，以免过多赘述。For the description of the relevant part of the device for simulating a snapshot volume relationship provided by the embodiment of the present invention, please refer to the detailed description of the corresponding part in the method for simulating a snapshot volume relationship provided by the embodiment of the present invention, which is not repeated here. In addition, the parts of the above 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 descriptions.
对所公开的实施例的上述说明，使本领域技术人员能够实现或使用本发明。对这些实施例的多种修改对本领域技术人员来说将是显而易见的，本文中所定义的一般原理可以在不脱离本发明的精神或范围的情况下，在其它实施例中实现。因此，本发明将不会被限制于本文所示的这些实施例，而是要符合与本文所公开的原理和新颖特点相一致的最宽的范围。The above description of the disclosed embodiments enables 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 implemented in 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)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710522555.6A CN107291400B (en) | 2017-06-30 | 2017-06-30 | A method and device for simulating snapshot volume relationship |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710522555.6A CN107291400B (en) | 2017-06-30 | 2017-06-30 | A method and device for simulating snapshot volume relationship |
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 | A method and device for simulating snapshot volume relationship |
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 |
|---|---|---|
| JP4704893B2 (en) | Computer system, management computer, storage system, and backup management method | |
| US9176871B1 (en) | Garbage collection of chunks | |
| JP5166735B2 (en) | System and method capable of synchronous data replication in a very short update interval | |
| JP5260802B2 (en) | Method, system, and computer program product for operating a copy function | |
| CN106201846B (en) | Method for monitoring performance and device in automatic test | |
| CN107590277A (en) | Data synchronization method, device, electronic device and storage medium | |
| US8321867B1 (en) | Request processing for stateless conformance engine | |
| US9940066B2 (en) | Snapshot management in hierarchical storage infrastructure | |
| BR102012000929A2 (en) | unsaved documents | |
| CN102902762B (en) | A kind of methods, devices and systems of deleting duplicated data | |
| CN102331957B (en) | File backup method and device | |
| CN103645970B (en) | Realizing method and device for de-weighting increments among multiple snapshots for remote copy | |
| CN103248503B (en) | A kind of method and device of network management configuration data backup restoration function | |
| JP2010231656A (en) | File management device | |
| CN107291400B (en) | A method and device for simulating snapshot volume relationship | |
| CN104820625B (en) | A kind of data record, backup and the restoration methods of Information management system | |
| CN101206596A (en) | Method for restoring system operation | |
| CN107301186A (en) | A kind of recognition methods of invalid data and device | |
| CN108733567A (en) | The monitoring method and system of software resource leak case | |
| CN104462290B (en) | File system clone method and device | |
| CN115048254A (en) | Simulation test method, system, equipment and readable medium of data distribution strategy | |
| CN109445989A (en) | A kind of file system data backup method and device | |
| CN109522373B (en) | Data processing method and device, electronic equipment and storage medium | |
| CN113468158A (en) | Data repair method, system, electronic device and medium | |
| CN101572618B (en) | System and method for configuring combined network interface |
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 |