CN108446187A - Data back up method and data restoration method - Google Patents
Data back up method and data restoration method Download PDFInfo
- Publication number
- CN108446187A CN108446187A CN201810186108.2A CN201810186108A CN108446187A CN 108446187 A CN108446187 A CN 108446187A CN 201810186108 A CN201810186108 A CN 201810186108A CN 108446187 A CN108446187 A CN 108446187A
- Authority
- CN
- China
- Prior art keywords
- backup
- page
- data
- data page
- target
- 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.)
- Granted
Links
Classifications
-
- 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
- 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/1458—Management of the backup or restore process
- G06F11/1464—Management of the backup or restore process for networked environments
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a kind of data back up method and data restoration methods.The data back up method includes：According to data backup requests, identification is set with the matched target backup of the data backup requests, and the target backup tree includes at least one node, and different nodes correspond to different data pages；According to the matched backup rules of logical relation between data page corresponding with target backup tree, the corresponding data page of each node for including with target backup tree is backed up, Backup Data page is obtained, record has location information of the node in target backup tree in the data page；Each Backup Data page of sequential storage in Coutinuous store space carries the logical relation between each Backup Data page in the storage order.Technical solution through the invention can carry out efficient, nondestructively data backup and reduction to certain database objects.
Description
Technical field
The present embodiments relate to the information processing technology more particularly to a kind of data back up method and data restoration method.
Background technology
With the arriving of information age, data safety is increasingly valued by people, wherein data backup can be described as
A kind of effective means to guarantee data security.Currently, the common backup means of database include mainly that physical backup and logic are standby
Part.
Physical backup is usually to be carried out from database purchase angle, and direct scan data file copies the allocated use
Data page to backup file in；Data page is copied in data file again when reduction.Physical backup principle is simple, efficiency
Height, but be inconvenient to filter the data page that certain database objects use, so, the unsuitable specific data of backup of physical backup
Library object, such as table.
Query result is stored in backup file by backup logic in the form of text generally by SQL statement mode is executed
In, it is not related to physical storage data page, directly backs up logical data, the backup requirements of certain database objects such as table can be met.
But backup logic mode needs to scan all data pages, each record is parsed, by network by data from server end
It is transmitted to export instrument client terminal, and is converted into character string forms preservation；Reduction process is then that will export result by executing SQL
The mode of sentence, inserts data into database again.As it can be seen that standby to the progress of table data using backup logic reduction mode
During part reduction, there are three record parsing, type conversion and network transmission parts, therefore, the backup and reduction of data
The problem of inefficient, and the conversion of floating number may cause precision to lose.
Invention content
A kind of data back up method of offer of the embodiment of the present invention and data restoration method, to realize to certain database objects
Carry out efficient, nondestructively data backup and reduction.
In a first aspect, an embodiment of the present invention provides a kind of data back up method, including：
According to data backup requests, identification is set with the matched target backup of the data backup requests, the target backup
Tree includes at least one node, and different nodes correspond to different data pages；
According to the matched backup rules of logical relation between the corresponding data page of target backup tree, will with it is described
The corresponding data page of each node that target backup tree includes is backed up, and is obtained Backup Data page, is remembered in the data page
Record has location information of the node in target backup tree；
Each Backup Data page of sequential storage in Coutinuous store space carries each backup number in the storage order
According to the logical relation between page.
Second aspect, the embodiment of the present invention additionally provide a kind of data restoration method, and this method includes：
It is asked according to data convert, obtains and ask each node that matched target also elite tree includes with the data convert
Corresponding Backup Data page；
Include according to storage order of the Backup Data page in Coutinuous store space and the target also elite tree
The corresponding Backup Data page of each node, reduction obtain the target also elite tree；
Wherein, the logical relation between storage order Backup Data page corresponding with the target also elite tree is matched
Backup rules are associated.
The third aspect, the embodiment of the present invention additionally provide a kind of data backup device, which includes：
Backup tree identification module, for according to data backup requests, identification and the matched target of the data backup requests
Backup tree, the target backup tree includes at least one node, and different nodes correspond to different data pages；
Data page backup module, for being matched according to the logical relation between data page corresponding with target backup tree
Backup rules, the corresponding data page of each node for including with target backup tree is backed up, backup number is obtained
According to page, record has location information of the node in target backup tree in the data page；
Backed-up pages memory module is used for each Backup Data page of sequential storage, the storage in Coutinuous store space
The logical relation between each Backup Data page is carried in sequence.
Fourth aspect, the embodiment of the present invention additionally provide a kind of data recovery device, which includes：
Backed-up pages acquisition module obtains for being asked according to data convert and asks matched target with the data convert
The corresponding Backup Data page of each node that also elite tree includes；
Also elite tree recovery module is used for the storage order in Coutinuous store space and institute according to the Backup Data page
The corresponding Backup Data page of each node that target also elite tree includes is stated, reduction obtains the target also elite tree；
Wherein, the logical relation between storage order Backup Data page corresponding with the target also elite tree is matched
Backup rules are associated.
5th aspect, the embodiment of the present invention additionally provide a kind of computer equipment, which includes：
One or more processors；
Memory, for storing one or more programs；
When one or more of programs are executed by one or more of processors so that one or more of processing
Device realizes the data back up method as described in any in the embodiment of the present invention.
6th aspect, the embodiment of the present invention additionally provide a kind of computer readable storage medium, are stored thereon with computer
Program realizes the data back up method as described in any in the embodiment of the present invention when program is executed by processor.
7th aspect, the embodiment of the present invention additionally provide a kind of computer equipment, which includes：
One or more processors；
Memory, for storing one or more programs；
When one or more of programs are executed by one or more of processors so that one or more of processing
Device realizes the data restoration method as described in any in the embodiment of the present invention.
Eighth aspect, the embodiment of the present invention additionally provide a kind of computer readable storage medium, are stored thereon with computer
Program realizes the data restoration method as described in any in the embodiment of the present invention when program is executed by processor.
The embodiment of the present invention is set by identification and the matched target backup of data backup requests, and tree pair is backed up according to target
The matched backup rules of logical relation between the data page answered, each node for including with target backup tree is corresponding
Data page is backed up, and Backup Data page, and each Backup Data page of sequential storage in Coutinuous store space are obtained, be utilized by
It the advantages of capable of preserving logical relation between data page according to the data page of the backup of certain backup rules and sequential storage, solves existing
Have in technology because simple by the way of physical backup and backup logic, otherwise and lead to that specific database pair can not be backed up
As or the problem of backup and reduction efficiency is low, data damage, realize and certain database objects efficiently, nondestructively count
According to the effect of backup-and-restore.
Description of the drawings
Fig. 1 a are a kind of flow diagrams for data back up method that the embodiment of the present invention one provides；
Fig. 1 b are a kind of structural schematic diagrams for 3 layers of B+ trees that the embodiment of the present invention one provides；
Fig. 1 c are that each Backup Data page is empty in Coutinuous store under a kind of preferred backup rules that the embodiment of the present invention one provides
Between in distribution schematic diagram；
Fig. 1 d are the flow diagrams of data back up method under a kind of preferred backup rules that the embodiment of the present invention one provides；
Fig. 2 a are a kind of flow diagrams of data restoration method provided by Embodiment 2 of the present invention；
Fig. 2 b are the structural schematic diagrams of three arrays provided by Embodiment 2 of the present invention；
Fig. 2 c are the flow diagrams of data restoration method under a kind of preferred backup rules provided by Embodiment 2 of the present invention；
Fig. 3 is a kind of structural schematic diagram for data backup device that the embodiment of the present invention three provides；
Fig. 4 is a kind of structural schematic diagram for data recovery device that the embodiment of the present invention four provides；
Fig. 5 is a kind of structural schematic diagram for computer equipment that the embodiment of the present invention five provides.
Specific implementation mode
The present invention is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched
The specific embodiment stated is used only for explaining the present invention rather than limitation of the invention.It also should be noted that in order to just
Only the parts related to the present invention are shown in description, attached drawing rather than entire infrastructure.
Embodiment one
Fig. 1 a are a kind of flow diagram for data back up method that the embodiment of the present invention one provides.This method is applicable to
The case where being backed up to tree construction data, this method can be executed by data backup device, the device can by hardware and/or
Software forms, and can generally be integrated in computer, server and all terminals comprising data backup function.Specifically include as
Under：
S110, it is set according to data backup requests, identification and the matched target backup of data backup requests, in target backup tree
Including at least one node, different nodes correspond to different data pages.
Optionally, data backup requests can be directed to the backup request of certain database objects in database, such as table,
And store the table content can be a data tree, such as B+ trees.Illustratively, data backup requests can be from user to data
Library server is initiated, and when database server receives the data backup requests, can be identified according to the data backup requests
The data tree for storing certain database objects content is backed up as target and is set.Wherein, from tree construction, target backup tree
It may include that at least one node, each node are a data page, that is to say, that different nodes can correspond to different data
Page.
By taking B+ trees as an example, only there are one root node (ROOT) pages for each B+ trees, wherein the number of plies where ROOT pages is B+ tree layers
Number -1；Undermost data page is leaf node (LEAF) page, wherein the number of plies where LEAF pages is 0, and without son's page；It is intermediate
The data page of layer is intermediate node (INNER) page, wherein INNER pages certainly exists son's page, and recorded on each data page
The number of son's page and storage address per son page, for example, in 3 layers of B+ tree constructions as shown in Figure 1 b, INNER
(0) there are 3 size subpages, be LEAF (0), LEAF (1) and LEAF (2) respectively, therefore, INNER has recorded these three sons on (0)
The address of page and son's number 3；The data page of same layer controls fraternal page each other, and mutual brother is also recorded on data page
Relationship, for example, as shown in Figure 1 b, in the 0th layer (LEVEL 0), the left brother of LEAF (0) is empty (NULL), and right brother is LEAF
(1), the left brother of LEAF (N) is LEAF (N-1), and right brother is NULL, and the left brother of LEAF (1) is LEAF (0), and right brother is
LEAF (2) etc., therefore, record has the storage address of the fraternal page in left and right on each data page；ROOT pages can also be LEAF pages,
For example B+ trees only have 1 layer, if the B+ tree numbers of plies certainly exist son's page more than 1, ROOT pages.
S120, according to the matched backup rules of logical relation between the corresponding data page of target backup tree, will be with mesh
The corresponding data page of each node that mark backup tree includes is backed up, and Backup Data page is obtained, and record has section in data page
Location information of the point in target backup tree.
Optionally, target is backed up and sets used backup rules when carrying out data backup, can be used for determining to each section
The backup sequence that the corresponding data page of point is backed up, wherein the corresponding backup sequence of different backup rules can be different, optional
, backup sequence can be backed up one by one according to default rule direction along each node in target backup tree it is suitable
Sequence is backed up for example, by using the mode traversed similar to rear root.Specifically, backup rules and each data page in target backup tree
Between logical relation match, wherein belong to it is same backup tree data page between logical relation may include set membership
And brotherhood.It is centainly patrolled that is, can be searched out according to the logical relation between data page and be had with current data page
The data page for the relationship of collecting, and then push the progress of back-up job.Specifically, can be in each node pair in traversal target backup tree
Current data page is backed up in backup file while the data page answered, generates corresponding Backup Data page.
Optionally, record has position of the node in target backup tree to believe in each data page in target backup tree
Breath, wherein location information may include：The number of plies, son's number where the corresponding data page of the node, and/or, with the data
Page has the storage address and the data page storage address of itself of the data page of set membership and/or brotherhood.
Preferably, the matched backup rules of logical relation between data page corresponding with target backup tree, including：
The data page progress sequence of the data page of whole childs corresponding with destination node and destination node is standby
Part rule, destination node be and intermediate node and/or root node with child.
Optionally, the rule of sequence backup is：The data page of the corresponding whole childs of first backup target node, then it is standby
The data page of part destination node.Wherein, the backup of the data page of whole childs corresponding to destination node can be continuous
, it can also be discontinuous, be not limited thereto.For example, when the corresponding child of destination node is in target backup tree
Leaf node when, then backup be continuous；And when the corresponding child of destination node is the middle node in target backup tree
When point, then backup is discontinuous.Optionally, when determining that the data page of the corresponding whole childs of destination node backed up
At then backing up the data page of the destination node immediately.
Illustratively, a kind of preferred backup rules are lifted, if the destination node currently traversed in the backup of target backup tree
Corresponding data page is INNER page of the 1st layer, then can finish INNER pages of all sons page i.e. LEAF pages successively backup
This INNER pages is backed up again afterwards；It, can be by ROOT pages of son page if the corresponding data page of destination node is ROOT pages
I.e. INNER pages (for 3 layers or more of target backup tree) or LEAF pages (for 2 layers of targets back up tree) is successively
This ROOT pages is backed up again after backup.A concrete instance is lifted, it is as shown in Figure 1 b, standby for one 3 layers of target
Part tree, all sons page LEAF (0), LEAF (1) and the LEAF (2) that can first back up INNER (0), then INNER (0) is backed up, then
All sons page of backup INNER (1), then INNER (1) is backed up, and so on, until having backed up INNER (N), finally back up
ROOT pages.
Optionally, tree is backed up for 3 layers or more of target, backing up tree to the target according to the preferred backup rules carries out
Backup, can show following rule：One INNER pages of son's page first backs up, and is backed up followed by INNER pages；In same layer
Belong between different INNER pages of son's page across one INNER pages of backup；ROOT pages is all standby in other all data pages
Just last backup after part finishes.
It preferably, will be with according to the matched backup rules of logical relation between the corresponding data page of target backup tree
The corresponding data page of each node that target backup tree includes is backed up, and Backup Data page is obtained, including：
Set corresponding first data page of root node of target backup tree to current page；
Obtain the location information recorded in current page；
If determining that current page includes the son's page being not backed up according to location information, obtained according to setting sequence current
One in the page son's page being not backed up returns to execute and obtains the location information recorded in current page as new current page
Operation；
If it does not include the son's page being not backed up to determine current page according to location information, current page is backed up, is obtained standby
Part data page, and when it is the first data page to determine current page not returns after setting father's page of current page to new current page
Receipt row obtains the operation of the location information recorded in current page；
When it is the first data page to determine current page, the backup to target backup tree is completed.
Illustratively, as shown in Figure 1 d, specific as follows to the backup-step of target backup tree：
S121, setting current page are ROOT pages.
Wherein, corresponding first data page of root node of target backup tree is ROOT pages.
S122, judge whether current page has the son's page being also not backed up, if so, executing S123；If it is not, then executing
S124。
Specifically, the location information recorded in current page can be first obtained, the son's page letter for including according to the location information
Breath judges son's page of the whether also promising backup of current page.
S123, one in the current page son being not backed up page is obtained according to setting sequence as new current page, and return
Receipt row S122.
Wherein, optionally, setting sequence can be sequence from left to right, can also be sequence from right to left, herein
It is not construed as limiting.Illustratively, first son being also not backed up page can be obtained according to sequence from left to right as newly current
Page.
S124, backup current page, and judge whether current page is ROOT pages, if so, executing S126；If it is not, then executing
S125。
Specifically, current page can be copied in new data page, to generate Backup Data page.
S125, it sets father's page of current page to new current page, and returns and execute S122.
S126, terminate backup.
Target backup tree is backed up according to above step, it can be achieved that being carried out according to above-mentioned preferred backup rules standby
The regularity showed when part, certainly, other unrequited modes, such as adjustment are not backed up the acquisition sequence of son's page,
Similar regularity can be obtained, belong to backup mode described in the present embodiment.
S130, each Backup Data page of sequential storage in Coutinuous store space carry each Backup Data in storage order
Logical relation between page.
Optionally, after the completion of backup, Backup Data page can be stored in a Coutinuous store successively according to backup sequencing
In space, the logical relation between data page is backed up in a manner of each data page storage order in Coutinuous store space by realizing
Get off.
Since the present embodiment is substantially by each data page direct copying in target backup tree to new data page, and sequence
It is stored in a Coutinuous store space, to be finally completed the backup to target backup tree, therefore, when each Backup Data page is pressed
When being stored according to backup sequencing, left and right brotherhood and different layers data page between all same layer data pages it
Between set membership, be backed up together with data page itself, formed it is a kind of it is novel between traditional physical backup and
Half backup logic mode between backup logic.It therefore, can be suitable according to the storage correspondingly, when being restored to data page
Logical relation between ordered pair data page and data page is restored.It can be seen that the backup mode of half logic is standby due to its
Not only specific database object can be found when part according to certain logical order to be backed up, but also needs not move through complicated logical number
According to transfer process, thus the defect that cannot individually back up certain database objects in physical backup mode was not only overcome, but also solved
The problems such as data backup reduction efficiency is low, data are easily lost in backup logic mode, compared to traditional physics and logic
Backup and reduction mode, the backup and reduction mode of half logic may be implemented more efficiently, nondestructively to carry out backup-and-restore to data.
It preferably, will be with if the matched backup rules of logical relation between the corresponding data page of target backup tree are
The rule of the data page carry out sequence backup of the data page and the destination node of the corresponding whole childs of destination node,
Then correspondingly, in Coutinuous store space, the Backup Data page sequence of whole child corresponding with same destination node is deposited
Storage, the Backup Data page of destination node are stored in the tail portion of the storage location of the Backup Data page of corresponding whole childs,
The Backup Data page of root node is stored in the tail portion in memory space.
One specific example of act, the data tree in Fig. 1 b is backed up as target and is set, to target backup tree according to such as figure
Step shown in 1d is backed up, wherein and the data page of same layer is backed up according to the sequence backed up successively from left to right,
It after the completion of backup, is sequentially stored in a Coutinuous store space, can be obtained such as Fig. 1 c from left to right according to backup sequencing
Backup Data page distribution situation.
The technical solution of the present embodiment is set by identification and data backup requests matched target backup, according to target
The matched backup rules of logical relation between corresponding data page are set in backup, each section that will include with target backup tree
The corresponding data page of point is backed up, and Backup Data page, and each Backup Data page of sequential storage in Coutinuous store space are obtained,
The advantages of capable of preserving logical relation between data page according to the data page of the backup of certain backup rules and sequential storage is utilized,
It solves in the prior art because simple by the way of physical backup and backup logic, otherwise and lead to that specific number can not be backed up
According to the problem of library object or backup and reduction efficiency are low, data damage, realizes and efficient, nothing is carried out to certain database objects
The effect of damage ground data backup and reduction.
Embodiment two
Fig. 2 a are a kind of flow diagram of data restoration method provided by Embodiment 2 of the present invention.This method is applicable to
The case where being restored to tree construction data, this method can be executed by data recovery device, the device can by hardware and/or
Software forms, and can generally be integrated in computer, server and all terminals comprising data convert function.Specifically include as
Under：
S210, it is asked according to data convert, obtains and ask each section that matched target also elite tree includes with data convert
The corresponding Backup Data page of point.
Optionally, data convert request can be directed to be stored with the corresponding backup of each node that target also elite tree includes
The reduction of the target backup file of data page is asked.Illustratively, data convert request can be sent out from user to database server
It rises, when database server receives data convert request, according to the data convert requesting query and can identify matching
Target backup file, obtained from the target backup file and ask matched each Backup Data page with data convert, wherein can
It is reduced to target also elite tree according to matched each Backup Data page.Specifically, also elite tree is consistent with the structure of backup tree, including
Data page corresponding to each node is also consistent, if backup tree is B+ trees, also elite tree is also B+ trees.
S220, according to storage order of the Backup Data page in Coutinuous store space and target also elite tree include it is each
The corresponding Backup Data page of node, reduction obtain target also elite tree.
Wherein, the matched backup rules of logical relation between storage order Backup Data page corresponding with target also elite tree
It is associated.
Optionally, due to the storage order of Backup Data page in Coutinuous store space can reflect each Backup Data page it
Between logical relation therefore can be restored according to the storage order and each Backup Data page and former target backup tree data knot
The consistent target of structure also elite tree.Wherein, can be used for restoring the logical relation between same also each Backup Data page of elite tree can wrap
Include set membership and brotherhood.That is, can be restored according to the storage order of Backup Data page each Backup Data page it
Between logical relation, and then push the progress of data page reduction work, final reduction obtains target also elite tree.Specifically, can be
While restoring the logical relation between each Backup Data page, current backup data page is copied to what target database created
In data page, target also elite tree is restored by updating the location information recorded in newly-built data page, wherein location information can
To include：The number of plies of the newly-built data page in target also elite tree, and/or, there are set membership and/or brother with the data page
The storage address of newly-built data page after other copies of relationship.
Preferably, the matched backup rules of logical relation between Backup Data page corresponding with target also elite tree, including：
By on corresponding with target also elite tree target backup tree, the data pages of the corresponding whole childs of destination node with
And the rule of the data page carry out sequence backup of destination node, destination node are intermediate node and/or root with child
Node；
Correspondingly, in Coutinuous store space, the Backup Data page of whole child corresponding with same destination node
Sequential storage, the Backup Data page of destination node are stored in the storage location of the Backup Data page of corresponding whole childs
The Backup Data page of tail portion, root node is stored in the tail portion in memory space.
Illustratively, the explanation of above-mentioned preferred backup rules can be found in saying to preferred backup rules in embodiment one
Bright, details are not described herein.
Preferably, what the storage order according to Backup Data page in Coutinuous store space and target also elite tree included is each
The corresponding Backup Data page of a node, reduction obtain target also elite tree, including：
According to storage order, a Backup Data page is obtained successively in Coutinuous store space as data page to be restored,
And obtain the number of plies where the data page to be restored；
Data page to be restored is copied in set memory space and is used as a restoring data page；
If it is determined that being cached with storage address in the corresponding sheaf space of the first spatial cache, then looked into set memory space
Look for the matched restoring data page of the storage address, and restored in set memory space according to the backup rules of target also elite tree
The page of restoring data and data page to be restored brotherhood, the sheaf space and the number of plies where the data page to be restored
Match；
The storage address update of data page to be restored is cached in the corresponding sheaf space of the first spatial cache；
If it is determined that there are son's pages for data page to be restored, then according to the complete of the data page to be restored in the second spatial cache
The corresponding storage address of portion son page restores the whole of the data page to be restored and data page to be restored in set memory space
The set membership of son's page；
If it is determined that data page to be restored is not the data page of root node, then by data page to be restored in set memory space
In after corresponding storage address is cached in as the corresponding storage address of son's page in the second spatial cache, return and execute according to depositing
Storage sequence, obtains operation of the Backup Data page as data page to be restored successively in Coutinuous store space；
When it is the data page of root node to determine data page to be restored, the reduction to target also elite tree is completed.
Illustratively, before reduction starts, it can apply for three arrays first, the first array is used to caching every layer and finally restores
Data page, to restore the left and right brotherhood between same layer data page, referred to as B_ARRAY, one-dimension array, array length and target
The number of plies of also elite tree is equal；Second array is used to cache the son's page restored in one INNER pages, referred to as S_ARRAY, number
Group dimension is two dimension, and the length of one-dimension array is that each array element caching corresponds in target also elite tree number of plies -1, the first dimension
The son's page restored in layer, and the length of each array is applied according to son's page number dynamic；Third array is for recording
The son's number of pages restored in INNER node pages, is used cooperatively, referred to as S_NUM_ARRY, one-dimension array with S_ARRAY, number
Group length is the target also elite tree number of plies -1.These three arrays are initially sky.By taking target also elite tree is 3 layers of B+ trees as an example, application
Three arrays structural schematic diagram such as Fig. 2 b, in the first array 1 (i.e. B_ARRAY), L_0 is represented the 0th layer (LEVEL 0)；The
In two arrays 2 (i.e. S_ARRAY), L_1_S_0 represents the 1st layer of the 0th size subpage；In third array 3 (i.e. S_NUM_ARRY),
L_1_sn=n represents the 1st layer and has restored son's number as n.
By taking 3 layers of B+ trees as an example, to according to mentioned in embodiment one preferred backup rules (son page backup sequence be
Sequence from left to right) 3 layers of B+ trees being backed up are restored, and as shown in Figure 2 c, reduction step is specific as follows：
S2201, newly-built array B_ARRAY, S_ARRAY and S_NUM_ARRY, and obtain the number of plies of target also elite tree.
Illustratively, array B_ARRAY i.e. the first array namely the first spatial cache；Array S_ARRAY i.e. second is counted
Group namely the second spatial cache；Array S_NUM_ARRY, that is, third array.Optionally, it can be taken by reading in Backup Data page
The target of band also elite tree information also can obtain mesh by reading the related target also elite tree information carried in data convert request
The number of plies L of mark also elite tree.
S2202, according to storage order, obtain a Backup Data page successively in Coutinuous store space as number to be restored
According to page, and obtain data page place number of plies v to be restored.
Optionally, can while obtaining data page to be restored, read recorded in the data page to be restored target also
Residing number of plies v in elite tree.Illustratively, non-restoring data in Coutinuous store space can be obtained according to the principle first taken is first deposited
First Backup Data page in page is as data page to be restored.
S2203, data page to be restored is copied in new data page, and the storage address that the right brother of this page is arranged is
It is empty.
Optionally, can be in the memory headroom of setting, such as in target database, a data page is created, and obtain new
Itself storage address recorded in the data page built, will be in the data copy in data page to be restored to the newly-built data page
Afterwards, itself storage address of acquisition is recorded again to itself storage address in the new data page, to avoid that will wait for also
When former data page is copied to new data page, the new storage address recorded in the newly-built data page is covered.And it is this is new
The storage address update of the right brother recorded in data page is set as NULL.
S2204, judge that data page to be restored whether there is left brother, if so, executing S2205；If it is not, then executing
S2206。
Optionally, Rule of judgment B_ARRAY [v] can be passed through！Whether whether=NULL at Rob Roy determine data page to be restored
There are left brothers, if so, determining the data page to be restored, there are left brothers；Otherwise, left brother is not present.Illustratively, if
Data page to be restored is the homepage of current layer, then B_ARRAY [v] is default value (NULL)；Otherwise, it is cached in B_ARRAY [v]
The storage address of the last round of page of restoring data.
S2205, the left brother of data page to be restored is updated to B_ARRAY [v], and more by the right brother of B_ARRAY [v]
It is newly data page to be restored.
Illustratively, in the storage address more new record to current data page to be restored that can will be cached in B_ARRAY [v]
At Zuo brother address, and by the new address of data page to be restored, i.e., the address of new data page updates where data page to be restored
It records at the right fraternal address in the matched page of restoring data of storage address cached into B_ARRAY [v], to restore to wait for also
Brotherhood between former data page and restoring data page.
S2206, the new storage address update of data page to be restored is cached in B_ARRAY [v].
That is, the storage address for the new data page that data page to be restored is copied to is cached into B_ARRAY [v],
In case next round uses when judging the data page to be restored obtained with the presence or absence of left brother.
S2207, data page to be restored itself is judged with the presence or absence of son's page, if so, executing S2208；If it is not, then executing
S2210。
Illustratively, whether can be more than 0 by the number of plies v where judging data page to be restored, to determine data to be restored
Page itself is with the presence or absence of son's page, if v>0, it is determined that there are son's pages for data page to be restored；Otherwise, son's page is not present.
S2208, by son's web update of data page to be restored be v-1 layers of corresponding array S_ARRAY [v-1] [x],
Middle x=0,1,2 ....
Wherein, the maximum value of x is v-1 layers of son page sum-corresponding with data page to be restored in target also elite tree
1, i.e., the value of current S_NUM_ARRAY [v-1].Illustratively, when determine data page to be restored there are son page when, by v-
The one group of storage address cached in 1 layer of corresponding array S_ARRAY [v-1] [x], son's page as data page to be restored are deposited
Address is stored up, in more new record to data page to be restored, to update set membership of the data page to be restored in target also elite tree.When
When set membership of the data page to be restored in target also elite tree and brotherhood update finish, then the data page to be restored
Location information is assured that.
S2209, value in v-1 layers of corresponding array S_ARRAY [v-1] [x] is emptied, and by S_NUM_ARRY [v-1]
Value be updated to 0.
The purpose for emptying and updating value is that the caching for son's page of next data page to be restored of same layer is done
Prepare.
S2210, judge whether data page to be restored itself is son's page, if so, executing S2211；If it is not, then executing
S2213。
Illustratively, can be by judging number of plies v where data page to be restored and the value of the number of plies L-1 of target also elite tree
It is no equal, to determine whether data page to be restored itself is son's page.For example, whether Rule of judgment v=L-1 is true, if so,
It is son's page to determine data page to be restored itself not, that is, father's page is not present, namely explanation data page to be restored is ROOT pages；It is no
Then, determine that data page to be restored itself is son's page, that is, there is father's page, namely explanation data page to be restored be INNER pages or
LEAF pages of person.
S2211, the new storage address of data page to be restored is cached into S_ARRAY [v] [m], wherein m=S_NUM_
ARRY[v]。
Wherein, the initial default value of S_NUM_ARRY [v] is 0, and a father is belonged to data page to be restored for recording
The number of restoring data page in son's page of page.
S2212, the value of S_NUM_ARRY [v] is updated to S_NUM_ARRY [v] value adds 1.
S2213, terminate reduction.
The technical solution of the present embodiment, by obtaining each section for asking matched target also elite tree to include with data convert
The corresponding Backup Data page of point, and storage order and target also elite tree packet according to Backup Data page in Coutinuous store space
The corresponding Backup Data page of each node included, reduction obtain target also elite tree, realize and carry out height to certain database objects
Effect, the effect of nondestructively data backup and reduction.
Embodiment three
Fig. 3 is a kind of structural schematic diagram for data backup device that the embodiment of the present invention three provides.With reference to figure 3, data are standby
Part device includes：Backup tree identification module 310, data page backup module 320 and backed-up pages memory module 330, below to each
Module is specifically described.
Backup tree identification module 310, for according to data backup requests, identification to be standby with the matched target of data backup requests
Part tree, target backup tree includes at least one node, and different nodes correspond to different data pages；
Data page backup module 320, for being matched according to the logical relation between data page corresponding with target backup tree
Backup rules, the corresponding data page of each node for including with target backup tree is backed up, Backup Data page is obtained,
Record has location information of the node in target backup tree in data page；
Backed-up pages memory module 330, for each Backup Data page of sequential storage in Coutinuous store space, in storage order
Carry the logical relation between each Backup Data page.
Data backup device provided in this embodiment is set by identification and the matched target backup of data backup requests, is pressed
According to the matched backup rules of logical relation between data page corresponding with target backup tree, will back up tree with the target includes
The corresponding data page of each node backed up, obtain Backup Data page, and sequential storage is each standby in Coutinuous store space
Part data page, be utilized according to the data page of the backup of certain backup rules and sequential storage can preserve data page between logic close
The advantages of being solves in the prior art because simple by the way of physical backup and backup logic, otherwise and cause can not be standby
Part specific the problem of database object or backup and reduction efficiency are low, data damage, realize to certain database objects into
Capable efficient, nondestructively data backup and reduction effect.
Optionally, the matched backup rules of logical relation between data page corresponding with target backup tree, including：
The data page progress sequence of the data page of whole childs corresponding with destination node and destination node is standby
The rule of part, destination node are intermediate node and/or root node with child；
Correspondingly, in Coutinuous store space, the Backup Data page of whole child corresponding with same destination node
Sequential storage, the Backup Data page of destination node are stored in the storage location of the Backup Data page of corresponding whole childs
The Backup Data page of tail portion, root node is stored in the tail portion in memory space.
Optionally, data page backup module 320 is specifically used for：
Set corresponding first data page of root node of target backup tree to current page；
Obtain the location information recorded in current page；
If determining that current page includes the son's page being not backed up according to location information, obtained according to setting sequence current
One in the page son's page being not backed up returns to execute and obtains the location information recorded in current page as new current page
Operation；
If it does not include the son's page being not backed up to determine current page according to location information, current page is backed up, is obtained standby
Part data page, and when it is the first data page to determine current page not returns after setting father's page of current page to new current page
Receipt row obtains the operation of the location information recorded in current page；
When it is the first data page to determine current page, the backup to target backup tree is completed.
The said goods can perform the method that any embodiment of the present invention is provided, and have the corresponding function module of execution method
And advantageous effect.
Example IV
Fig. 4 is a kind of structural schematic diagram for data recovery device that the embodiment of the present invention four provides.With reference to figure 4, data are standby
Part device includes：Backed-up pages acquisition module 410 and also elite tree recovery module 420, are below specifically described each module.
Backed-up pages acquisition module 410 obtains for being asked according to data convert and asks matched target also with data convert
The corresponding Backup Data page of each node that elite tree includes；
Also elite tree recovery module 420, for the storage order and mesh according to Backup Data page in Coutinuous store space
The mark corresponding Backup Data page of each node that also elite tree includes, reduction obtain target also elite tree；
Wherein, the matched backup rules of logical relation between storage order Backup Data page corresponding with target also elite tree
It is associated.
Data recovery device provided in this embodiment includes with the matched target also elite tree of data convert request by obtaining
The corresponding Backup Data page of each node, and storage order and target according to Backup Data page in Coutinuous store space
The corresponding Backup Data page of each node that also elite tree includes, reduction obtain target also elite tree, realize to certain database pair
Effect as carrying out efficient, nondestructively data backup and reduction.
Optionally, the matched backup rules of logical relation between Backup Data page corresponding with target also elite tree, including：
By on corresponding with target also elite tree target backup tree, the data pages of the corresponding whole childs of destination node with
And the rule of the data page carry out sequence backup of destination node, destination node are the intermediate node being connected directly with child
And/or root node；
Correspondingly, in Coutinuous store space, the Backup Data page of whole child corresponding with same destination node
Sequential storage, the Backup Data page of destination node are stored in the storage location of the Backup Data page of corresponding whole childs
The Backup Data page of tail portion, root node is stored in the tail portion in memory space.
Optionally, also elite tree recovery module 420 is specifically used for：
According to storage order, a Backup Data page is obtained successively in Coutinuous store space as data page to be restored,
And obtain the number of plies where data page to be restored；
Data page to be restored is copied in set memory space and is used as a restoring data page；
If it is determined that being cached with storage address in the corresponding sheaf space of the first spatial cache, then looked into set memory space
Look for the matched restoring data page of storage address, and restored in set memory space according to the backup rules of target also elite tree
The brotherhood of restoring data page and data page to be restored, the sheaf space and number of plies phase where the data page to be restored
Matching；
The storage address update of data page to be restored is cached in the corresponding sheaf space of the first spatial cache；
If it is determined that there are son's pages for data page to be restored, then according to the complete of the data page to be restored in the second spatial cache
The corresponding storage address of portion son page restores the whole of the data page to be restored and data page to be restored in set memory space
The set membership of son's page；
If it is determined that data page to be restored is not the data page of root node, then by data page to be restored in set memory space
In after corresponding storage address is cached in as the corresponding storage address of son's page in the second spatial cache, return and execute according to depositing
Storage sequence, obtains operation of the Backup Data page as data page to be restored successively in Coutinuous store space；
When it is the data page of root node to determine data page to be restored, the reduction to target also elite tree is completed.
The said goods can perform the method that any embodiment of the present invention is provided, and have the corresponding function module of execution method
And advantageous effect.
Embodiment five
Fig. 5 is a kind of structural schematic diagram for computer equipment that the embodiment of the present invention five provides, as shown in figure 5, this implementation
A kind of computer equipment that example provides, including：Processor 51 and memory 52.Processor in the computer equipment can be one
A or multiple, in Fig. 5 by taking a processor 51 as an example, processor 51 and memory 52 in the computer equipment can pass through
Bus or other modes connect, in Fig. 5 for being connected by bus.
Be integrated in the processor 51 of the present embodiment Computer equipment above-described embodiment offer data backup device and/
Or data recovery device.In addition, the memory 52 in the computer equipment is used as a kind of computer readable storage medium, can be used for
The one or more programs of storage, described program can be software program, computer executable program and module, and such as present invention is real
Data back up method or the corresponding program instruction/module of data restoration method are applied in example (for example, attached data backup shown in Fig. 3
Module in device, including：Backup tree identification module 310, data page backup module 320 and backed-up pages memory module 330；Again
Such as, the module in attached data recovery device shown in Fig. 4, including：Backed-up pages acquisition module 410 and also elite tree recovery module
420).Processor 51 is stored in software program, instruction and module in memory 52 by operation, to execute each of equipment
Data back up method and/or data restoration method in above method embodiment are realized in kind application of function and data processing.
Memory 52 may include storing program area and storage data field, wherein storing program area can storage program area, extremely
Application program needed for a few function；Storage data field can be stored uses created data etc. according to equipment.In addition, depositing
Reservoir 52 may include high-speed random access memory, can also include nonvolatile memory, and a for example, at least disk is deposited
Memory device, flush memory device or other non-volatile solid state memory parts.In some instances, memory 52 can further comprise
The memory remotely located relative to processor 51, these remote memories can pass through network connection to equipment.Above-mentioned network
Example include but not limited to internet, intranet, LAN, mobile radio communication and combinations thereof.
Processor 51 is stored in the program in memory 52 by operation, to perform various functions at application and data
Reason realizes the data back up method that for example embodiment of the present invention one is provided：
According to data backup requests, identification is set with the matched target backup of data backup requests, and target backup tree includes
At least one node, different nodes correspond to different data pages；According to the logic between data page corresponding with target backup tree
The corresponding data page of each node for including with target backup tree is backed up, is obtained standby by the backup rules of relationship match
Part data page, record has location information of the node in target backup tree in data page；The sequential storage in Coutinuous store space
Each Backup Data page carries the logical relation between each Backup Data page in storage order.
In another example the data restoration method that the embodiment of the present invention two is provided：
It is asked, is obtained corresponding with each node that data convert asks matched target also elite tree to include according to data convert
Backup Data page；According to storage order of the Backup Data page in Coutinuous store space and target also elite tree include it is each
The corresponding Backup Data page of node, reduction obtain target also elite tree；Wherein, storage order backup number corresponding with target also elite tree
It is associated according to the matched backup rules of logical relation between page.
Embodiment six
The embodiment of the present invention six additionally provides a kind of computer readable storage medium, is stored thereon with computer program, should
Realize that the data back up method provided such as the embodiment of the present invention one, this method include when program is executed by data backup device：Root
According to data backup requests, identification is set with the matched target backup of data backup requests, and target backup tree includes at least one section
Point, different nodes correspond to different data pages；It is matched according to the logical relation between data page corresponding with target backup tree
The corresponding data page of each node for including with target backup tree is backed up, obtains Backup Data page, number by backup rules
There is location information of the node in target backup tree according to record in page；Each Backup Data of sequential storage in Coutinuous store space
Page, the logical relation between each Backup Data page is carried in storage order.
It is realized such as data restoration method provided by Embodiment 2 of the present invention, the party when program is executed by data recovery device
Method includes：It is asked, is obtained corresponding with each node that data convert asks matched target also elite tree to include according to data convert
Backup Data page；According to storage order of the Backup Data page in Coutinuous store space and target also elite tree include it is each
The corresponding Backup Data page of node, reduction obtain target also elite tree；Wherein, storage order backup number corresponding with target also elite tree
It is associated according to the matched backup rules of logical relation between page.
Certainly, a kind of computer readable storage medium that the embodiment of the present invention is provided, the computer program stored thereon
It is performed and is not limited to realize method operation as described above, can also realize that the data that any embodiment of the present invention is provided are standby
Relevant operation in part method and/or data restoration method.
By the description above with respect to embodiment, it is apparent to those skilled in the art that, the present invention
It can be realized by software and required common hardware, naturally it is also possible to which by hardware realization, but the former is more in many cases
Good embodiment.Based on this understanding, technical scheme of the present invention substantially in other words contributes to the prior art
Part can be expressed in the form of software products, which can be stored in computer readable storage medium
In, such as the floppy disk of computer, read-only memory (Read-Only Memory, ROM), random access memory (Random
Access Memory, RAM), flash memory (FLASH), hard disk or CD etc., including some instructions are with so that a computer is set
Standby (can be personal computer, server or the network equipment etc.) executes the method described in each embodiment of the present invention.
It is worth noting that, in the embodiment of above-mentioned data backup device and data recovery device, included each list
Member and module are only divided according to function logic, but are not limited to above-mentioned division, as long as can realize corresponding
Function；In addition, the specific name of each functional unit is also only to facilitate mutually differentiation, is not intended to restrict the invention
Protection domain.
Note that above are only presently preferred embodiments of the present invention and institute's application technology principle.It will be appreciated by those skilled in the art that
The present invention is not limited to specific embodiments described here, can carry out for a person skilled in the art it is various it is apparent variation,
It readjusts and substitutes without departing from protection scope of the present invention.Therefore, although being carried out to the present invention by above example
It is described in further detail, but the present invention is not limited only to above example, without departing from the inventive concept, also
May include other more equivalent embodiments, and the scope of the present invention is determined by scope of the appended claims.
Claims (12)
1. a kind of data back up method, which is characterized in that including：
According to data backup requests, identification is set with the matched target backup of the data backup requests, in the target backup tree
Including at least one node, different nodes correspond to different data pages；
It, will be with the target according to the matched backup rules of logical relation between data page corresponding with target backup tree
The corresponding data page of each node that backup tree includes is backed up, and obtains Backup Data page, being recorded in the data page has
Location information of the node in target backup tree；
Each Backup Data page of sequential storage in Coutinuous store space carries each Backup Data page in the storage order
Between logical relation.
2. according to the method described in claim 1, it is characterized in that, between the data page corresponding with target backup tree
The matched backup rules of logical relation, including：
The data page progress sequence of the data page of whole childs corresponding with destination node and the destination node is standby
The rule of part, the destination node are intermediate node and/or root node with child；
Correspondingly, in the Coutinuous store space, the backup number of whole childs corresponding with the same destination node
According to page sequential storage, the Backup Data page of the destination node is stored in the Backup Data page of corresponding whole childs
Storage location tail portion, the Backup Data page of the root node is stored in the tail portion in the memory space.
3. according to the method described in claim 2, it is characterized in that, described according to data page corresponding with target backup tree
Between the matched backup rules of logical relation, by the corresponding data page of each node for including with target backup tree into
Row backup, obtains Backup Data page, including：
Set corresponding first data page of root node of target backup tree to current page；
Obtain the location information recorded in the current page；
If determining that the current page includes the son's page being not backed up according to the positional information, obtained according to setting sequence
The son's page being not backed up described in one in the current page returns to execution and obtains in the current page as new current page
The operation of the location information of record；
If determining that the current page does not include the son's page being not backed up according to the positional information, back up described current
Page obtains Backup Data page, and when it is first data page to determine the current page not, by father's page of the current page
After being set as the new current page, the operation for executing and obtaining the location information recorded in the current page is returned；
When it is first data page to determine the current page, the backup to target backup tree is completed.
4. a kind of data restoration method, which is characterized in that including：
It is asked, is obtained corresponding with each node that the data convert asks matched target also elite tree to include according to data convert
Backup Data page；
According to storage order of the Backup Data page in Coutinuous store space and the target also elite tree include it is each
The corresponding Backup Data page of node, reduction obtain the target also elite tree；
Wherein, the matched backup of logical relation between storage order Backup Data page corresponding with the target also elite tree
Rule is associated.
5. according to the method described in claim 4, it is characterized in that, the Backup Data page corresponding with the target also elite tree
Between the matched backup rules of logical relation, including：
By on corresponding with the target also elite tree target backup tree, the data pages of the corresponding whole childs of destination node with
And the rule of the data page carry out sequence backup of the destination node, the destination node are the intermediate node with child
And/or root node；
Correspondingly, in the Coutinuous store space, the backup number of whole childs corresponding with the same destination node
According to page sequential storage, the Backup Data page of the destination node is stored in the Backup Data page of corresponding whole childs
Storage location tail portion, the Backup Data page of the root node is stored in the tail portion in the memory space.
6. according to the method described in claim 5, it is characterized in that, it is described according to the Backup Data page in Coutinuous store space
In storage order and the target also the elite tree corresponding Backup Data page of each node that includes, reduction obtains the target
Also elite tree, including：
According to the storage order, a Backup Data page is obtained successively in the Coutinuous store space as data to be restored
Page, and obtain the number of plies where the data page to be restored；
The data page to be restored is copied in set memory space and is used as a restoring data page；
If it is determined that being cached with storage address in the corresponding sheaf space of the first spatial cache, then looked into the set memory space
Look for the matched restoring data page of the storage address, and restore the setting according to the backup rules of the target also elite tree
The brotherhood of the page of restoring data and the data page to be restored in memory headroom, the sheaf space are waited for described
The number of plies where restoring data page matches；
The storage address update of the data page to be restored is cached in the corresponding sheaf space of first spatial cache；
If it is determined that there are son's pages for the data page to be restored, then according to the data page to be restored in the second spatial cache
The corresponding storage address of whole sons page, restore the data page to be restored in the set memory space and described wait for
The set membership of whole son's page of restoring data page；
If it is determined that the data page to be restored is not the data page of root node, then by the data page to be restored in the setting
After corresponding storage address is cached in as the corresponding storage address of son's page in second spatial cache in memory headroom, return
Receipt row obtains a Backup Data page as number to be restored successively according to the storage order in the Coutinuous store space
According to the operation of page；
When it is the data page of root node to determine the data page to be restored, the reduction to the target also elite tree is completed.
7. a kind of data backup device, which is characterized in that including：
Backup tree identification module, for according to data backup requests, identification to be backed up with the matched target of the data backup requests
Tree, the target backup tree includes at least one node, and different nodes correspond to different data pages；
Data page backup module, for matched standby according to the logical relation between data page corresponding with target backup tree
Part rule, the corresponding data page of each node for including with target backup tree is backed up, Backup Data page is obtained,
Record has location information of the node in target backup tree in the data page；
Backed-up pages memory module, for each Backup Data page of sequential storage, the storage order in Coutinuous store space
In carry logical relation between each Backup Data page.
8. a kind of data recovery device, which is characterized in that including：
Backed-up pages acquisition module obtains for being asked according to data convert and asks matched target to restore with the data convert
The corresponding Backup Data page of each node that tree includes；
Also elite tree recovery module is used for the storage order in Coutinuous store space and the mesh according to the Backup Data page
The mark corresponding Backup Data page of each node that also elite tree includes, reduction obtain the target also elite tree；
Wherein, the matched backup of logical relation between storage order Backup Data page corresponding with the target also elite tree
Rule is associated.
9. a kind of computer equipment, which is characterized in that the equipment includes：
One or more processors；
Memory, for storing one or more programs；
When one or more of programs are executed by one or more of processors so that one or more of processors are real
The now data back up method as described in any in claim 1-3.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the program is by processor
The data back up method as described in any in claim 1-3 is realized when execution.
11. a kind of computer equipment, which is characterized in that the equipment includes：
One or more processors；
Memory, for storing one or more programs；
When one or more of programs are executed by one or more of processors so that one or more of processors are real
The now data restoration method as described in any in claim 4-6.
12. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the program is by processor
The data restoration method as described in any in claim 4-6 is realized when execution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810186108.2A CN108446187B (en) | 2018-03-07 | 2018-03-07 | Data backup method and data recovery method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810186108.2A CN108446187B (en) | 2018-03-07 | 2018-03-07 | Data backup method and data recovery method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108446187A true CN108446187A (en) | 2018-08-24 |
| CN108446187B CN108446187B (en) | 2021-02-09 |
Family
ID=63193426
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810186108.2A Active CN108446187B (en) | 2018-03-07 | 2018-03-07 | Data backup method and data recovery method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108446187B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110990377A (en) * | 2019-11-21 | 2020-04-10 | 上海达梦数据库有限公司 | Data loading method and device, server and storage medium |
| CN111628996A (en) * | 2020-05-26 | 2020-09-04 | 南通职业大学 | Electronic data communication method and system based on Internet of things |
| CN111857575A (en) * | 2020-06-24 | 2020-10-30 | 国汽(北京)智能网联汽车研究院有限公司 | Method, device and equipment for determining memory space of computing platform and storage medium |
| CN111858145A (en) * | 2019-04-25 | 2020-10-30 | 伊姆西Ip控股有限责任公司 | Method, apparatus and computer program product for data backup and recovery |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050223043A1 (en) * | 2004-03-31 | 2005-10-06 | Randal Paul S | System and method for a consistency check of a database backup |
| CN104881334A (en) * | 2015-02-06 | 2015-09-02 | 北京飞杰信息技术有限公司 | Crash-proof cache data protection method and system |
| CN105339939A (en) * | 2013-06-25 | 2016-02-17 | 国际商业机器公司 | Replication for on-line hot-standby database |
| CN106844089A (en) * | 2015-12-03 | 2017-06-13 | 阿里巴巴集团控股有限公司 | A kind of method and apparatus for recovering tree data storage |
| CN107506258A (en) * | 2016-06-14 | 2017-12-22 | 伊姆西公司 | Method and apparatus for data backup |
-
2018
- 2018-03-07 CN CN201810186108.2A patent/CN108446187B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050223043A1 (en) * | 2004-03-31 | 2005-10-06 | Randal Paul S | System and method for a consistency check of a database backup |
| CN105339939A (en) * | 2013-06-25 | 2016-02-17 | 国际商业机器公司 | Replication for on-line hot-standby database |
| CN104881334A (en) * | 2015-02-06 | 2015-09-02 | 北京飞杰信息技术有限公司 | Crash-proof cache data protection method and system |
| CN106844089A (en) * | 2015-12-03 | 2017-06-13 | 阿里巴巴集团控股有限公司 | A kind of method and apparatus for recovering tree data storage |
| CN107506258A (en) * | 2016-06-14 | 2017-12-22 | 伊姆西公司 | Method and apparatus for data backup |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111858145A (en) * | 2019-04-25 | 2020-10-30 | 伊姆西Ip控股有限责任公司 | Method, apparatus and computer program product for data backup and recovery |
| CN110990377A (en) * | 2019-11-21 | 2020-04-10 | 上海达梦数据库有限公司 | Data loading method and device, server and storage medium |
| CN110990377B (en) * | 2019-11-21 | 2023-08-22 | 上海达梦数据库有限公司 | Data loading method, device, server and storage medium |
| CN111628996A (en) * | 2020-05-26 | 2020-09-04 | 南通职业大学 | Electronic data communication method and system based on Internet of things |
| CN111857575A (en) * | 2020-06-24 | 2020-10-30 | 国汽(北京)智能网联汽车研究院有限公司 | Method, device and equipment for determining memory space of computing platform and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108446187B (en) | 2021-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108446187A (en) | Data back up method and data restoration method | |
| KR101573965B1 (en) | Atomic multiple modification of data in a distributed storage system | |
| US10437721B2 (en) | Efficient garbage collection for a log-structured data store | |
| US10534768B2 (en) | Optimized log storage for asynchronous log updates | |
| KR101932372B1 (en) | In place snapshots | |
| CN101334797B (en) | Distributed file systems and its data block consistency managing method | |
| CN102591982B (en) | Perform the method and system of increment SQL server database backup | |
| US8214334B2 (en) | Systems and methods for distributed system scanning | |
| KR100834162B1 (en) | Method and apparatus for data storage using striping | |
| US7716420B2 (en) | Methods of converting traditional volumes into flexible volumes | |
| US6192378B1 (en) | Method and apparatus for combining undo and redo contexts in a distributed access environment | |
| CN106339254B (en) | Method and device for quickly starting virtual machine and management node | |
| CN101061467B (en) | Storing data replicas remotely | |
| US20080027998A1 (en) | Method and apparatus of continuous data protection for NAS | |
| CN106021016A (en) | Virtual point in time access between snapshots | |
| CN108733761A (en) | A kind of data processing method apparatus and system | |
| US20030196052A1 (en) | Method, system, and program for grouping objects | |
| JPH06290096A (en) | Pass name solving device | |
| KR20150132511A (en) | Log record management | |
| CN110750507B (en) | Persistent client caching method and system under global namespace facing DFS | |
| US20090228530A1 (en) | Separating file data streams to enhance progressive incremental processing | |
| CN108076090A (en) | Data processing method and storage management system | |
| CN112162846B (en) | Transaction processing method, device and computer readable storage medium | |
| US7281014B2 (en) | Method and apparatus for moving data between storage devices | |
| CN105912424A (en) | Cloud architecture based terminal program quick backup and recovery method |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |