CN102012851A - Continuous data protection method and server - Google Patents
Continuous data protection method and server Download PDFInfo
- Publication number
- CN102012851A CN102012851A CN 201010597525 CN201010597525A CN102012851A CN 102012851 A CN102012851 A CN 102012851A CN 201010597525 CN201010597525 CN 201010597525 CN 201010597525 A CN201010597525 A CN 201010597525A CN 102012851 A CN102012851 A CN 102012851A
- Authority
- CN
- China
- Prior art keywords
- data block
- data
- index
- server
- daily record
- 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
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000011084 recovery Methods 0.000 claims description 13
- 238000012545 processing Methods 0.000 claims description 6
- 238000005516 engineering process Methods 0.000 description 12
- 230000008859 change Effects 0.000 description 3
- 238000012217 deletion Methods 0.000 description 3
- 230000037430 deletion Effects 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000015556 catabolic process Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 238000006731 degradation reaction Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 241000665848 Isca Species 0.000 description 1
- 241000700605 Viruses Species 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 230000002045 lasting effect Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a continuous data protection method and a server. The method comprises the following steps of: receiving log data of a client by the server, storing the log data according to data blocks, when the current data block is full, directing the current data block to another data block with available storage space, and continuously writing at another data block; establishing and maintaining a first-level index according to the number of the data block; establishing and maintaining a second-level index according to time points of the log data in each data block; and searching the log data according to the first-level index and the second-level index when the data is restored. By the method, the log data can be reasonably managed and quick searching and data restoration can be realized.
Description
Technical field
The present invention relates to computer realm, relate in particular to a kind of continuous data protection method and server.
Background technology
The requirement of the quick growth of data and the high availability of data, security has stimulated the development of memory technology, oneself becomes a key factor of IT infrastructure memory technology, and storage networking provides an effective hardware foundation for mass storage data and shared data.In the face of mass data; Data Protection and disaster recovery are also more and more important, and original data guard method, as tape backup; have that backup window is big, release time is long, real-time response is poor, influence drawback such as regular traffic, can't satisfy current demand.Use online the duplicating of disk to become popular data protection technology with data redundancy.
Continuous data protection (Continuous Data Protection; CDP) be a kind of under the prerequisite that does not influence the general data operation; any change that lasting seizure or tracking target data are taken place can be realized, and the method for random time point before this can be returned to.Continuous data protection method can be protected from certain volume that begins constantly or the file data mode in after this any time, and each change of data just all can be noted by none with omitting.
Compare with traditional disaster recovery techniques; the continuous data protection technology has tangible advantage: at first; improved target release time (the Recovery Time Object of data information system; be called for short RTO); the time interval of tradition redundancy technique protected data from several days to not waiting in several weeks; when disaster takes place when; the user is faced with the loss of data in several days to several weeks; snapping technique can be reduced to the loss amount of data in the several hrs; the CDP technology then can be reduced to the loss amount of data a few minutes by several seconds, even avoided the loss of data fully.Secondly, can avoid because artificial logic error or the data degradation that virus attack caused, when user data is destroyed, traditional backup and reproduction technology will use wrong data to cover Backup Data in the past, cause forever losing of user data, technology then can return to data destroyed preceding random time point, has avoided the risk of data degradation.At last, release time of CDP technology and to recover granularity thinner, the CDP product that function is stronger even support the recovery of single I/O, this is convenient for users to use to a great extent, and finally might substitute current main backup and recovery technology.
Yang Qing etc. propose a kind of continuous data protection and restoration methods; see Qing Yang; Weijun Xiao and Jin Ren. " TRAP-Array:A Disk Array Architecture Providing Timely Recovery to Any Point-in-time "; In Proceedings of ISCA:The 33rd Annual International Symposium on Computer Architecture; Boston; USA, 2006.But this continuous data protection data mode, exist data when particularly protecting PB level mass data along with increasing of data insertion and release time long problem.
Summary of the invention
The technical problem to be solved in the present invention is, a kind of continuous data protection method and server are provided, can the reasonable management daily record data, realize searching fast recovering with data.
In order to solve the problems of the technologies described above, the present invention proposes a kind of continuous data protection method, comprising:
Server receives the daily record data of client, with it according to data block store, current data block write full after, current data block is pointed to the data block that another has free memory, described another data block relaying continue into; Number set up and safeguard the one-level index according to the piece of described data block,, set up and safeguard secondary index according to the time point of the daily record data in each data block; And when carrying out the data recovery, search daily record data according to described one-level index and described secondary index.
Further, said method also can have following characteristics:
Described server also according to the type of the data that write, writes data type information in data block in data block, described data type information comprises: daily record data type, first index type, second index type;
Described server is also according to described first index of data block store and described second index, current data block write full after, current data block is pointed to the data block that another has free memory, described another data block relaying continue into;
The data type information that encapsulates in described current data block and described another data block is identical.
Further, said method also can have following characteristics:
Described server is when the described daily record data of storage, and/or when described second index of storage, after if current data block is write and is expired, search used earlier and store in the data block of same data type information whether free memory is arranged, if have, then current data block is pointed to the described data block that finds,, then current data block is pointed to a new data block if do not have.
Further, said method also can have following characteristics:
Described server is to use hash algorithm to search in described one-level index earlier when searching daily record data, re-uses the B tree algorithm and searches in described secondary index.
Further, said method also can have following characteristics:
Described server is by writing the address information of next data block, current data block is pointed to another data block in described data block;
Described server is also set up in described data block and is safeguarded the free space bitmap, indicates the idle condition in described data block store space.
In order to solve the problems of the technologies described above, the present invention also proposes a kind of continuous data protection server, comprising:
The stores processor module is used to receive the daily record data of client, with it according to data block store, current data block write full after, current data block is pointed to the data block that another has free memory, described another data block relaying continue into;
Search processing module, be used for number setting up and safeguard the one-level index,, set up and safeguard secondary index according to the time point of the daily record data in each data block according to the piece of described data block; And when carrying out the data recovery, search daily record data according to described one-level index and described secondary index.
Further, above-mentioned server also can have following characteristics:
Described stores processor module also according to the type of the data that write, writes data type information in data block in data block, described data type information comprises: daily record data type, first index type, second index type;
Described stores processor module, also according to described first index of data block store and described second index, current data block write full after, current data block is pointed to the data block that another has free memory, described another data block relaying continue into;
Wherein, the data type information that encapsulates in described current data block and described another data block is identical.
Further, above-mentioned server also can have following characteristics:
Described stores processor module, when the described daily record data of storage, and/or when described second index of storage, after if current data block is write and is expired, search used earlier and store in the data block of same data type information whether free memory is arranged,, then current data block is pointed to the described data block that finds if having, if no, then current data block is pointed to a new data block.
Further, above-mentioned server also can have following characteristics:
The described processing module of searching when searching daily record data, uses hash algorithm to search in described one-level index earlier, re-uses the B tree algorithm and searches in described secondary index.
Further, above-mentioned server also can have following characteristics:
Described stores processor module is by writing the address information of next data block, current data block is pointed to another data block in described data block;
Described stores processor module is also set up in described data block and is safeguarded the free space bitmap, indicates the idle condition in described data block store space.
A kind of continuous data protection method provided by the invention and server can the reasonable management daily record datas, realize searching fast and data are recovered, and the advantage that expense is low, the system performance influence is little, reliability is higher.
Description of drawings
Fig. 1 is a kind of continuous data protection method flow diagram of the embodiment of the invention;
Fig. 2 is an embodiment of the invention two-stage index structural representation;
Fig. 3 is the structural representation of embodiment of the invention daily record data piece;
Fig. 4 is the structural representation of the embodiment of the invention first index data piece;
Fig. 5 is the structural representation of the embodiment of the invention second index data piece;
Fig. 6 is a kind of continuous data protection server side of embodiment of the invention block diagram.
Embodiment
Describe embodiment of the present invention in detail below in conjunction with accompanying drawing.
Referring to Fig. 1, the figure shows a kind of continuous data protection method of the embodiment of the invention, comprise step:
Step S101: server receives the daily record data of client, with it according to data block store, current data block write full after, current data block is pointed to the data block that another has free memory, described another data block relaying continue into;
Step S102: the one-level index is set up and safeguarded to described server number according to the piece of described data block, according to the time point of the daily record data in each data block, sets up and safeguard secondary index;
Step S103: described server is searched daily record data according to described one-level index and described secondary index when carrying out the data recovery.
It is the unit storing daily record data that the embodiment of the invention proposes with the data block, and, guarantee the data storage continuity by setting up the incidence relation between the data block, this way has been broken away from the restriction on the memory location dexterously, can realize the expansion of disk space easily, be easy to the management maintenance of data.In addition,, can realize searching fast, improve the efficient that data are recovered by setting up two-stage index.
When execution in step S101, considering that data deletion will cause also exists free space in the data block, in order to optimize disk space, effectively utilize these free spaces, preferably, described server can be after current data block be write completely, search used earlier and store in the data block of same data type information whether free memory is arranged,, then current data block is pointed to the described data block that finds if having, if no, then current data block is pointed to a new data block.For example, can be numbered data block, according to using in order from small to large, after current data block 10 was write completely, used data block 1 to 9 before searching was not earlier write full if find one of them data block, then preferentially data being write this does not write in the full data block, if data block 1 to 9 has all been write full, then use a new data block 11, begin to write.
When execution in step S103, the two-stage index structure of foundation as shown in Figure 2.In order to realize searching fast, preferably, described server can use hash algorithm to search in described one-level index earlier, re-uses the B tree algorithm and searches in described secondary index.
In order to increase the extensibility of index, preferably, described server is also according to described first index of data block store and described second index, after current data block is write and expired, current data block is pointed to the data block that another has free memory, described another data block relaying continue into.In order to distinguish with daily record data, described server needs the type according to the data that write in data block, write data type information in data block, and described data type information comprises: daily record data type, first index type, second index type.At storing daily record data, when perhaps storing index, current data block write full after, when current data block is pointed to another data block that free memory is arranged, require the data type information that encapsulates in described current data block and described another data block identical.Like this, first index, promptly the first class catalogue index can point to next first class catalogue index, thereby realizes the expansion to the first class catalogue index.In like manner, second index, promptly the second-level directory index can point to next second-level directory index, thereby realizes the expansion to the second-level directory index.
The data of storing in described first index are the second index corresponding address, because after the size of protected disk determined, the list item in the one-level index had just been determined.And second index is the index to data in the data block, can be with the data change, therefore, in order to optimize disk space, effectively utilize these free spaces, preferably, described server can be when writing second index, after current data block is write completely, search used earlier and store in the data block of same data type information whether free memory is arranged,, then current data block is pointed to the described data block that finds if having, if no, again current data block is pointed to a new data block.Thereby make full use of because the free space that the corresponding deletion of second index that the data deletion operation causes causes.
Described server can be by writing the address information of next data block, current data block is pointed to another data block in described data block.Described server can also be set up in described data block and safeguard the free space bitmap, indicates the idle condition in described data block store space.
The log store form, the first index stores form and the second index stores form that adopt the said method realization are successively referring to Fig. 3,4,5.
When execution in step S103, described server is also set up virtual disk, when carrying out the data recovery, search daily record data, if can find the daily record data of corresponding time point, then it is saved in the described virtual disk, if can not find the daily record data of corresponding time point, then search the nearest daily record data of the described corresponding time point of distance, it is saved in the described virtual disk.
Virtual disk is essentially Linux block device and drives, and under/dev catalogue, server can be created virtual disk by using ioctl.The control virtual disk mainly carries out equipment control by ioctl, comprises carry and the order of unloading virtual disk.
Before execution in step S101, also comprise the step of client upload daily record data.In order further the daily record data refinement to be managed; make things convenient for data to recover; can be; client executing continuous data protection task; write daily record data according to the atomic data piece; and described daily record data and descriptor thereof be sent to described server, described descriptor comprises task identification ID, atomic data piece number and the daily record time point.When execution in step S101, described server can write daily record data according to the atomic data piece in described data block, and the descriptor that writes daily record data; And in described data block, set up and safeguard in order to indicating the space bit map of described data block free space state, and in described data block the address information of next data block of storage.What wherein, the size of described atomic data piece can be among 2K, 4K, 8K, 16K or the 32K is a kind of; When described server was pressed the piece storage, the size of described data block can be set to, for example the 1024K size.Certainly, the size of data block, and the size of atomic data piece can be provided with as required, do not limit here.
In order further to guarantee reliability of data storage, preferably, described server can adopt a certain amount of Redundancy Design for metadata, in the hope of under the situation of lost part metadata, still can read user's data.In order to guarantee this point, can adopt the mode of piece number and time to preserve redundant metadata.Simultaneously, the so crucial metadata of superblock is backed up.Even information dropout in the external data base, also manually the mode of appointment is recovered.For the write operation of all metadata, adopt the mode of order, data are write direct, and metadata writes in the mode of affairs, with the atomicity that guarantees that data write.
In order to realize said method, the embodiment of the invention also provides a kind of continuous data protection server, as shown in Figure 6, comprising:
The stores processor module is used to receive the daily record data of client, with it according to data block store, current data block write full after, current data block is pointed to the data block that another has free memory, described another data block relaying continue into.
Search processing module, be used for number setting up and safeguard the one-level index,, set up and safeguard secondary index according to the time point of the daily record data in each data block according to the piece of described data block; And when carrying out the data recovery, search daily record data according to described one-level index and described secondary index.
Preferably, described stores processor module also according to the type of the data that write, writes data type information in data block in data block, and described data type information comprises: daily record data type, first index type, second index type.Described stores processor module, also according to described first index of data block store and described second index, current data block write full after, current data block is pointed to the data block that another has free memory, described another data block relaying continue into.Wherein, the data type information that encapsulates in described current data block and described another data block is identical.
Preferably, described stores processor module, when the described daily record data of storage, and/or when described second index of storage, if current data block write full after, search used earlier and store in the data block of same data type information whether free memory is arranged, if have, then current data block is pointed to the described data block that finds,, then current data block is pointed to a new data block if do not have.
Preferably, the described processing module of searching when searching daily record data, uses hash algorithm to search in described one-level index earlier, re-uses the B tree algorithm and searches in described secondary index.
Preferably, described stores processor module is by writing the address information of next data block, current data block is pointed to another data block in described data block.Described stores processor module is also set up in described data block and is safeguarded the free space bitmap, indicates the idle condition in described data block store space.
Be the preferred embodiments of the present invention only below, be not limited to the present invention, for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. a continuous data protection method is characterized in that, comprising:
Server receives the daily record data of client, with it according to data block store, current data block write full after, current data block is pointed to the data block that another has free memory, described another data block relaying continue into; Number set up and safeguard the one-level index according to the piece of described data block,, set up and safeguard secondary index according to the time point of the daily record data in each data block; And when carrying out the data recovery, search daily record data according to described one-level index and described secondary index.
2. the method for claim 1 is characterized in that:
Described server also according to the type of the data that write, writes data type information in data block in data block, described data type information comprises: daily record data type, first index type, second index type;
Described server is also according to described first index of data block store and described second index, current data block write full after, current data block is pointed to the data block that another has free memory, described another data block relaying continue into;
The data type information that encapsulates in described current data block and described another data block is identical.
3. method as claimed in claim 2 is characterized in that:
Described server is when the described daily record data of storage, and/or when described second index of storage, after if current data block is write and is expired, search used earlier and store in the data block of same data type information whether free memory is arranged, if have, then current data block is pointed to the described data block that finds,, then current data block is pointed to a new data block if do not have.
4. the method for claim 1 is characterized in that:
Described server is to use hash algorithm to search in described one-level index earlier when searching daily record data, re-uses the B tree algorithm and searches in described secondary index.
5. as any one described method among the claim 1-3, it is characterized in that:
Described server is by writing the address information of next data block, current data block is pointed to another data block in described data block;
Described server is also set up in described data block and is safeguarded the free space bitmap, indicates the idle condition in described data block store space.
6. a continuous data protection server is characterized in that, comprising:
The stores processor module is used to receive the daily record data of client, with it according to data block store, current data block write full after, current data block is pointed to the data block that another has free memory, described another data block relaying continue into;
Search processing module, be used for number setting up and safeguard the one-level index,, set up and safeguard secondary index according to the time point of the daily record data in each data block according to the piece of described data block; And when carrying out the data recovery, search daily record data according to described one-level index and described secondary index.
7. server as claimed in claim 6 is characterized in that:
Described stores processor module also according to the type of the data that write, writes data type information in data block in data block, described data type information comprises: daily record data type, first index type, second index type;
Described stores processor module, also according to described first index of data block store and described second index, current data block write full after, current data block is pointed to the data block that another has free memory, described another data block relaying continue into;
Wherein, the data type information that encapsulates in described current data block and described another data block is identical.
8. server as claimed in claim 7 is characterized in that:
Described stores processor module, when the described daily record data of storage, and/or when described second index of storage, after if current data block is write and is expired, search used earlier and store in the data block of same data type information whether free memory is arranged,, then current data block is pointed to the described data block that finds if having, if no, then current data block is pointed to a new data block.
9. server as claimed in claim 6 is characterized in that:
The described processing module of searching when searching daily record data, uses hash algorithm to search in described one-level index earlier, re-uses the B tree algorithm and searches in described secondary index.
10. as any one described server among the claim 6-8, it is characterized in that:
Described stores processor module is by writing the address information of next data block, current data block is pointed to another data block in described data block;
Described stores processor module is also set up in described data block and is safeguarded the free space bitmap, indicates the idle condition in described data block store space.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010597525A CN102012851B (en) | 2010-12-20 | 2010-12-20 | Continuous data protection method and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010597525A CN102012851B (en) | 2010-12-20 | 2010-12-20 | Continuous data protection method and server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102012851A true CN102012851A (en) | 2011-04-13 |
| CN102012851B CN102012851B (en) | 2012-09-26 |
Family
ID=43843027
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010597525A Active CN102012851B (en) | 2010-12-20 | 2010-12-20 | Continuous data protection method and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102012851B (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102314503A (en) * | 2011-09-01 | 2012-01-11 | 浪潮(北京)电子信息产业有限公司 | Indexing method |
| CN102521269A (en) * | 2011-11-22 | 2012-06-27 | 清华大学 | Index-based computer continuous data protection method |
| CN102789427A (en) * | 2012-07-17 | 2012-11-21 | 威盛电子股份有限公司 | Data storage device and operation method thereof |
| CN103019951A (en) * | 2011-09-20 | 2013-04-03 | 阿里巴巴集团控股有限公司 | Recording method and device of ordered data and access method and device of ordered data |
| CN103049450A (en) * | 2011-10-14 | 2013-04-17 | 腾讯科技（深圳）有限公司 | Index establishing device and method |
| CN103186537A (en) * | 2011-12-27 | 2013-07-03 | 腾讯科技（北京）有限公司 | Data reading-writing method and device based on index sorting |
| CN103678414A (en) * | 2012-09-25 | 2014-03-26 | 腾讯科技（深圳）有限公司 | Method and device for storing and inquiring data |
| CN104050268A (en) * | 2014-06-23 | 2014-09-17 | 西北工业大学 | Continuous data protection and recovery method with log space adjustable online |
| CN104536908A (en) * | 2014-11-05 | 2015-04-22 | 北京中安比特科技有限公司 | Single-machine-oriented mass small record efficient storage and management method |
| CN104615504A (en) * | 2015-02-06 | 2015-05-13 | 浪潮(北京)电子信息产业有限公司 | Method and device for achieving data protection |
| CN105095026A (en) * | 2015-08-31 | 2015-11-25 | 小米科技有限责任公司 | Superblock repair method and apparatus for EXT file system and intelligent device |
| CN105550062A (en) * | 2015-12-03 | 2016-05-04 | 上海爱数信息技术股份有限公司 | Continuous data protection and time point browse recovery based data backflow method |
| CN106844089A (en) * | 2015-12-03 | 2017-06-13 | 阿里巴巴集团控股有限公司 | A kind of method and apparatus for recovering tree data storage |
| CN107340971A (en) * | 2016-04-28 | 2017-11-10 | 上海优刻得信息科技有限公司 | A kind of data storage is with recovering framework and method |
| CN108572958A (en) * | 2017-03-07 | 2018-09-25 | 腾讯科技（深圳）有限公司 | Data processing method and device |
| CN109918341A (en) * | 2019-02-26 | 2019-06-21 | 厦门美图之家科技有限公司 | Log processing method and device |
| CN109947703A (en) * | 2017-11-09 | 2019-06-28 | 北京京东尚科信息技术有限公司 | File system, file memory method, storage device and computer-readable medium |
| CN110134340A (en) * | 2019-05-23 | 2019-08-16 | 苏州浪潮智能科技有限公司 | A kind of method, apparatus of metadata updates, equipment and storage medium |
| CN112445431A (en) * | 2020-11-16 | 2021-03-05 | 深圳市元征科技股份有限公司 | Data storage method, device, equipment and medium |
| WO2021147935A1 (en) * | 2020-01-23 | 2021-07-29 | 阿里巴巴集团控股有限公司 | Log playback method and apparatus |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100555289C (en) * | 2007-12-20 | 2009-10-28 | 中国科学院计算技术研究所 | A kind of continuous data protection system and its implementation |
-
2010
- 2010-12-20 CN CN201010597525A patent/CN102012851B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100555289C (en) * | 2007-12-20 | 2009-10-28 | 中国科学院计算技术研究所 | A kind of continuous data protection system and its implementation |
Non-Patent Citations (2)
| Title |
|---|
| 《24th IEEE Conference on MSST》 20071231 Maohua Lu etc. Efficient Logging and Replication Techniques for Comprehensive Data Protection 第1-14页 1-10 , 2 * |
| 《Proceedings of the International Conference on DSN'02》 20021231 Tzi-cker Chiueh etc. Track-Based Disk Logging 第1-10页 1-10 , 2 * |
Cited By (30)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102314503A (en) * | 2011-09-01 | 2012-01-11 | 浪潮(北京)电子信息产业有限公司 | Indexing method |
| CN103019951A (en) * | 2011-09-20 | 2013-04-03 | 阿里巴巴集团控股有限公司 | Recording method and device of ordered data and access method and device of ordered data |
| CN103019951B (en) * | 2011-09-20 | 2016-12-07 | 阿里巴巴集团控股有限公司 | The recording method and device of ordered data, the access method of ordered data and device |
| CN103049450A (en) * | 2011-10-14 | 2013-04-17 | 腾讯科技（深圳）有限公司 | Index establishing device and method |
| CN103049450B (en) * | 2011-10-14 | 2018-01-23 | 深圳市世纪光速信息技术有限公司 | One kind index establishes apparatus and method |
| CN102521269A (en) * | 2011-11-22 | 2012-06-27 | 清华大学 | Index-based computer continuous data protection method |
| CN103186537A (en) * | 2011-12-27 | 2013-07-03 | 腾讯科技（北京）有限公司 | Data reading-writing method and device based on index sorting |
| CN102789427B (en) * | 2012-07-17 | 2015-11-25 | 威盛电子股份有限公司 | Data memory device and its method of operating |
| CN102789427A (en) * | 2012-07-17 | 2012-11-21 | 威盛电子股份有限公司 | Data storage device and operation method thereof |
| US9053013B2 (en) | 2012-07-17 | 2015-06-09 | Via Technologies, Inc. | Data storage device and operating method thereof |
| CN103678414A (en) * | 2012-09-25 | 2014-03-26 | 腾讯科技（深圳）有限公司 | Method and device for storing and inquiring data |
| CN104050268A (en) * | 2014-06-23 | 2014-09-17 | 西北工业大学 | Continuous data protection and recovery method with log space adjustable online |
| CN104536908B (en) * | 2014-11-05 | 2017-12-29 | 中安威士（北京）科技有限公司 | A kind of magnanimity small records efficient storage management method towards unit |
| CN104536908A (en) * | 2014-11-05 | 2015-04-22 | 北京中安比特科技有限公司 | Single-machine-oriented mass small record efficient storage and management method |
| CN104615504A (en) * | 2015-02-06 | 2015-05-13 | 浪潮(北京)电子信息产业有限公司 | Method and device for achieving data protection |
| CN105095026A (en) * | 2015-08-31 | 2015-11-25 | 小米科技有限责任公司 | Superblock repair method and apparatus for EXT file system and intelligent device |
| CN105550062B (en) * | 2015-12-03 | 2018-10-12 | 上海爱数信息技术股份有限公司 | The data reflow method restored based on continuous data protection and time point browsing |
| CN105550062A (en) * | 2015-12-03 | 2016-05-04 | 上海爱数信息技术股份有限公司 | Continuous data protection and time point browse recovery based data backflow method |
| CN106844089A (en) * | 2015-12-03 | 2017-06-13 | 阿里巴巴集团控股有限公司 | A kind of method and apparatus for recovering tree data storage |
| CN106844089B (en) * | 2015-12-03 | 2021-01-01 | 阿里巴巴集团控股有限公司 | Method and equipment for recovering tree data storage |
| CN107340971A (en) * | 2016-04-28 | 2017-11-10 | 上海优刻得信息科技有限公司 | A kind of data storage is with recovering framework and method |
| CN107340971B (en) * | 2016-04-28 | 2019-05-07 | 优刻得科技股份有限公司 | A kind of storage of data with restore framework and method |
| CN108572958A (en) * | 2017-03-07 | 2018-09-25 | 腾讯科技（深圳）有限公司 | Data processing method and device |
| CN109947703A (en) * | 2017-11-09 | 2019-06-28 | 北京京东尚科信息技术有限公司 | File system, file memory method, storage device and computer-readable medium |
| CN109918341A (en) * | 2019-02-26 | 2019-06-21 | 厦门美图之家科技有限公司 | Log processing method and device |
| CN109918341B (en) * | 2019-02-26 | 2021-11-30 | 厦门美图之家科技有限公司 | Log processing method and device |
| CN110134340A (en) * | 2019-05-23 | 2019-08-16 | 苏州浪潮智能科技有限公司 | A kind of method, apparatus of metadata updates, equipment and storage medium |
| CN110134340B (en) * | 2019-05-23 | 2020-03-06 | 苏州浪潮智能科技有限公司 | Method, device, equipment and storage medium for updating metadata |
| WO2021147935A1 (en) * | 2020-01-23 | 2021-07-29 | 阿里巴巴集团控股有限公司 | Log playback method and apparatus |
| CN112445431A (en) * | 2020-11-16 | 2021-03-05 | 深圳市元征科技股份有限公司 | Data storage method, device, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102012851B (en) | 2012-09-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102012851B (en) | Continuous data protection method and server | |
| CN100547555C (en) | A kind of data backup system based on fingerprint | |
| US9785518B2 (en) | Multi-threaded transaction log for primary and restore/intelligence | |
| US10061658B2 (en) | System and method of data intelligent storage | |
| US7421617B2 (en) | Systems and methods for optimizing restoration of stored data | |
| US10102079B2 (en) | Triggering discovery points based on change | |
| US11138156B2 (en) | Continuous data management system and operating method thereof | |
| US9389800B1 (en) | Synthesizing virtual machine disk backups | |
| CN102955720B (en) | A kind of method improving ext file system stability | |
| Tan et al. | CABdedupe: A causality-based deduplication performance booster for cloud backup services | |
| US8504515B2 (en) | Stubbing systems and methods in a data replication environment | |
| US20110167221A1 (en) | System and method for efficiently creating off-site data volume back-ups | |
| CN102779080B (en) | Method for generating snapshot, method and device for data recovery by using snapshot | |
| CN102750201A (en) | Computer system and backup method therefor | |
| US11392460B2 (en) | Adaptable multi-layer storage with controlled restoration of protected data | |
| US11194669B2 (en) | Adaptable multi-layered storage for generating search indexes | |
| WO2016095372A1 (en) | Method and apparatus for realizing image backup of transaction logs | |
| CN103516549B (en) | A kind of file system metadata log mechanism based on shared object storage | |
| CN102314503A (en) | Indexing method | |
| WO2012083754A1 (en) | Method and device for processing dirty data | |
| US11080142B2 (en) | Preservation of electronic messages between snapshots | |
| CN103617097A (en) | File recovery method and file recovery device | |
| CN103547992A (en) | System and method for maintaining consistent points in file systems using a prime dependency list | |
| US20200409796A1 (en) | Data management system with limited control of external compute and storage resources | |
| CN107533495A (en) | Technology for data backup and resume |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20201120 Address after: 215100 No. 1 Guanpu Road, Guoxiang Street, Wuzhong Economic Development Zone, Suzhou City, Jiangsu Province Patentee after: SUZHOU LANGCHAO INTELLIGENT TECHNOLOGY Co.,Ltd. Address before: 100085 Beijing, Haidian District on the road to information on the ground floor, building 2-1, No. 1, C Patentee before: Inspur (Beijing) Electronic Information Industry Co.,Ltd. |
|
| TR01 | Transfer of patent right |