CN102012851B - Continuous data protection method and server - Google Patents
Continuous data protection method and server Download PDFInfo
- Publication number
- CN102012851B CN102012851B CN201010597525A CN201010597525A CN102012851B CN 102012851 B CN102012851 B CN 102012851B CN 201010597525 A CN201010597525 A CN 201010597525A CN 201010597525 A CN201010597525 A CN 201010597525A CN 102012851 B CN102012851 B CN 102012851B
- Authority
- CN
- China
- Prior art keywords
- data block
- data
- index
- current
- another
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000011084 recovery Methods 0.000 claims description 13
- 238000012545 processing Methods 0.000 claims description 6
- 238000005516 engineering process Methods 0.000 description 11
- 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 is that mass storage data and shared data provide an effective hardware foundation.In the face of mass data; Data Protection and disaster recovery are also more and more important, and original data guard method, like 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 (Recovery Time Object is called for short RTO) of data information system; The time interval of tradition redundancy technique protected data from several days to not waiting in several weeks; When disaster took place, face the loss of data in several days to several weeks, and 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; Technological then can data be returned to the random time point before being destroyed, 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 matters that the present invention will solve 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, said another data block relaying continue into; Number set up and safeguard the one-level index according to the piece of said 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 said one-level index and said secondary index.
Further, said method also can have following characteristics:
Said server also according to the type of data that in data block, writes, writes data type information in data block, said data type information comprises: daily record data type, first index type, second index type;
Said server is also according to said first index of data block store and said second index, current data block write full after, current data block is pointed to the data block that another has free memory, said another data block relaying continue into;
The data type information that encapsulates in said current data block and said another data block is identical.
Further, said method also can have following characteristics:
Said server is when the said daily record data of storage; And/or when said 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 said 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:
Said server is to use hash algorithm in said one-level index, to search earlier when searching daily record data, re-uses the B tree algorithm and in said secondary index, searches.
Further, said method also can have following characteristics:
Said server is through writing the address information of next data block, current data block is pointed to another data block in said data block;
Said server is also set up in said data block and is safeguarded the free space bitmap, indicates the idle condition in said 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, said 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 said data block; And when carrying out the data recovery, search daily record data according to said one-level index and said secondary index.
Further, above-mentioned server also can have following characteristics:
Said stores processor module also according to the type of data that in data block, writes, writes data type information in data block, said data type information comprises: daily record data type, first index type, second index type;
Said stores processor module, also according to said first index of data block store and said second index, current data block write full after, current data block is pointed to the data block that another has free memory, said another data block relaying continue into;
Wherein, the data type information that encapsulates in said current data block and said another data block is identical.
Further, above-mentioned server also can have following characteristics:
Said stores processor module, in storage during said daily record data, and/or when said 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 said 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 said processing module of searching when searching daily record data, uses hash algorithm in said one-level index, to search earlier, re-uses the B tree algorithm and in said secondary index, searches.
Further, above-mentioned server also can have following characteristics:
Said stores processor module is through writing the address information of next data block, current data block is pointed to another data block in said data block;
Said stores processor module is also set up in said data block and is safeguarded the free space bitmap, indicates the idle condition in said 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
To combine accompanying drawing to specify embodiment of the present invention below.
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, said another data block relaying continue into;
Step S102: the one-level index is set up and safeguarded to said server number according to the piece of said data block, according to the time point of the daily record data in each data block, sets up and safeguard secondary index;
Step S103: said server is searched daily record data according to said one-level index and said 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 through 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 through setting up two-stage index.
When execution in step S101, consider that data deletion will cause and also have free space in the data block, in order to optimize disk space; Effectively utilize these free spaces, preferably, said 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 said data block that finds if having; If no, then current data block is pointed to a new data block.For example, can number, according to using in order from small to large data block; 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 is as shown in Figure 2.In order to realize searching fast, preferably, said server can use hash algorithm in said one-level index, to search earlier, re-uses the B tree algorithm and in said secondary index, searches.
In order to increase the extensibility of index; Preferably, said server is also according to said first index of data block store and said second index, after current data block is write and expired; Current data block is pointed to the data block that another has free memory, said another data block relaying continue into.In order to distinguish with daily record data, said server needs in data block, to write data type information according to the type of data that in data block, writes, and said 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 was pointed to another data block that free memory is arranged, the data type information that requires to encapsulate in said current data block and said another data block was 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 said first index are the second index corresponding address, because after the size of protected disk confirmed, the list item in the one-level index had just been confirmed.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; Said server can be when writing second index, 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 said data block that finds,, again current data block is pointed to a new data block if do not have.Thereby make full use of because the free space that the corresponding deletion of second index that the data deletion operation causes causes.
Said server can be through writing the address information of next data block, current data block is pointed to another data block in said data block.Said server can also be set up in said data block and safeguard the free space bitmap, indicates the idle condition in said 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, said 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 said virtual disk, if can not find the daily record data of corresponding time point; Then search the nearest daily record data of the said corresponding time point of distance, it is saved in the said virtual disk.
Virtual disk is essentially Linux block device and drives, and under/dev catalogue, server can be created virtual disk through using ioctl.The control virtual disk mainly carries out equipment control through 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 that client executing continuous data protection task writes daily record data according to the atomic data piece; And said daily record data and descriptor thereof be sent to said server, said descriptor comprises task identification ID, atomic data piece number and the daily record time point.When execution in step S101, said server can write daily record data according to the atomic data piece in said data block, and the descriptor that writes daily record data; And in said data block, set up and safeguard in order to indicating the space bit map of said data block free space state, and in said data block the address information of next data block of storage.What wherein, the size of said atomic data piece can be among 2K, 4K, 8K, 16K or the 32K is a kind of; When said server was pressed the piece storage, the size of said 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, said 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 piece number and the mode of 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 with 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, and is 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, said 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 said data block; And when carrying out the data recovery, search daily record data according to said one-level index and said secondary index.
Preferably, said stores processor module also according to the type of data that in data block, writes, writes data type information in data block, and said data type information comprises: daily record data type, first index type, second index type.Said stores processor module, also according to said first index of data block store and said second index, current data block write full after, current data block is pointed to the data block that another has free memory, said another data block relaying continue into.Wherein, the data type information that encapsulates in said current data block and said another data block is identical.
Preferably, said stores processor module is when the said daily record data of storage; And/or when said 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 said data block that finds,, then current data block is pointed to a new data block if do not have.
Preferably, the said processing module of searching when searching daily record data, uses hash algorithm in said one-level index, to search earlier, re-uses the B tree algorithm and in said secondary index, searches.
Preferably, said stores processor module is through writing the address information of next data block, current data block is pointed to another data block in said data block.Said stores processor module is also set up in said data block and is safeguarded the free space bitmap, indicates the idle condition in said data block store space.
More than be merely the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various changes and variation.All within spirit of the present invention and principle, 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; According to data block store, wherein data block is meant storage space with it, after current data block is write and expired; Current data block is pointed to the data block that another has free memory; Said another data block relaying continue into, and through in said current data block, writing the address information of next data block, current data block is pointed to another data block; Number set up and safeguard the one-level index according to the piece of said current data block and another data block,, set up and safeguard secondary index according to the time point of the daily record data in current data block and another data block; And when carrying out the data recovery, search daily record data according to said one-level index and said secondary index.
2. the method for claim 1 is characterized in that:
Said server also according to the type of data that in data block, writes, writes data type information in data block, said data type information comprises: daily record data type, first index type, second index type;
Said server is also according to said first index of data block store and said second index, current data block write full after, current data block is pointed to the data block that another has free memory, said another data block relaying continue into;
The data type information that encapsulates in said current data block and said another data block is identical.
3. method as claimed in claim 2 is characterized in that:
Said server is when the said daily record data of storage; And/or when said 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 said 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:
Said server is to use hash algorithm in said one-level index, to search earlier when searching daily record data, re-uses the B tree algorithm and in said secondary index, searches.
5. like any one described method among the claim 1-3, it is characterized in that:
Said server is also set up in said current data block and another data block and is safeguarded the free space bitmap, indicates the idle condition in said 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; Wherein data block is meant storage space; Current data block write full after, current data block is pointed to the data block that another has free memory, said another data block relaying continue into; And through in said current data block, writing the address information of next data block, current data block is pointed to another data block;
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 current data block and another data block according to the piece of said current data block and another data block; And when carrying out the data recovery, search daily record data according to said one-level index and said secondary index.
7. server as claimed in claim 6 is characterized in that:
Said stores processor module also according to the type of data that in data block, writes, writes data type information in data block, said data type information comprises: daily record data type, first index type, second index type;
Said stores processor module, also according to said first index of data block store and said second index, current data block write full after, current data block is pointed to the data block that another has free memory, said another data block relaying continue into;
Wherein, the data type information that encapsulates in said current data block and said another data block is identical.
8. server as claimed in claim 7 is characterized in that:
Said stores processor module, in storage during said daily record data, and/or when said 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 said 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 said processing module of searching when searching daily record data, uses hash algorithm in said one-level index, to search earlier, re-uses the B tree algorithm and in said secondary index, searches.
10. like any one described server among the claim 6-8, it is characterized in that:
Said stores processor module is also set up in said current data block and another data block and is safeguarded the free space bitmap, indicates the idle condition in said 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 CN102012851A (en) | 2011-04-13 |
| CN102012851B true 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) |
Families Citing this family (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102314503A (en) * | 2011-09-01 | 2012-01-11 | 浪潮(北京)电子信息产业有限公司 | Indexing method |
| CN103019951B (en) * | 2011-09-20 | 2016-12-07 | 阿里巴巴集团控股有限公司 | The recording method and device of ordered data, the access method of ordered data and device |
| CN103049450B (en) * | 2011-10-14 | 2018-01-23 | 深圳市世纪光速信息技术有限公司 | One kind index establishes apparatus and method |
| CN102521269B (en) * | 2011-11-22 | 2013-06-19 | 清华大学 | Index-based computer continuous data protection method |
| CN103186537B (en) * | 2011-12-27 | 2018-01-12 | 腾讯科技（北京）有限公司 | A kind of data read-write method and device based on index order |
| CN102789427B (en) | 2012-07-17 | 2015-11-25 | 威盛电子股份有限公司 | Data memory device and its method of operating |
| 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 |
| CN104615504B (en) * | 2015-02-06 | 2017-11-10 | 浪潮(北京)电子信息产业有限公司 | A kind of method and device for realizing 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 |
| CN106844089B (en) * | 2015-12-03 | 2021-01-01 | 阿里巴巴集团控股有限公司 | Method and equipment for recovering tree data storage |
| CN107340971B (en) * | 2016-04-28 | 2019-05-07 | 优刻得科技股份有限公司 | A kind of storage of data with restore framework and method |
| CN108572958B (en) * | 2017-03-07 | 2022-07-29 | 腾讯科技（深圳）有限公司 | Data processing method and device |
| CN109947703A (en) * | 2017-11-09 | 2019-06-28 | 北京京东尚科信息技术有限公司 | File system, file memory method, storage device and computer-readable medium |
| CN109918341B (en) * | 2019-02-26 | 2021-11-30 | 厦门美图之家科技有限公司 | Log processing method and device |
| CN110134340B (en) * | 2019-05-23 | 2020-03-06 | 苏州浪潮智能科技有限公司 | Method, device, equipment and storage medium for updating metadata |
| CN111324665B (en) * | 2020-01-23 | 2023-06-27 | 阿里巴巴集团控股有限公司 | Log playback method and device |
| CN112445431A (en) * | 2020-11-16 | 2021-03-05 | 深圳市元征科技股份有限公司 | Data storage method, device, equipment and medium |
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 |
|---|
| Maohua Lu etc..Efficient Logging and Replication Techniques for Comprehensive Data Protection.《24th IEEE Conference on MSST》.2007,第1-14页. * |
| Tzi-cker Chiueh etc..Track-Based Disk Logging.《Proceedings of the International Conference on DSN’02》.2002,第1-10页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102012851A (en) | 2011-04-13 |
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 | |
| US11138156B2 (en) | Continuous data management system and operating method thereof | |
| US7421617B2 (en) | Systems and methods for optimizing restoration of stored data | |
| Tan et al. | CABdedupe: A causality-based deduplication performance booster for cloud backup services | |
| CN102955720B (en) | A kind of method improving ext file system stability | |
| US8612707B2 (en) | Continuous data protection over intermittent connections, such as continuous data backup for laptops or wireless devices | |
| US20160224430A1 (en) | Triggering discovery points based on change | |
| US20070208918A1 (en) | Method and apparatus for providing virtual machine backup | |
| US20110246416A1 (en) | Stubbing systems and methods in a data replication environment | |
| US20080162594A1 (en) | Data storage system and process | |
| US11157451B2 (en) | Adaptable multi-layered storage for deduplicating electronic messages | |
| CN102779080B (en) | Method for generating snapshot, method and device for data recovery by using snapshot | |
| US11194669B2 (en) | Adaptable multi-layered storage for generating search indexes | |
| US11392460B2 (en) | Adaptable multi-layer storage with controlled restoration of protected data | |
| CN101742263A (en) | Method for storing surveillance video data | |
| CN102314503A (en) | Indexing method | |
| US11080142B2 (en) | Preservation of electronic messages between snapshots | |
| US11681586B2 (en) | Data management system with limited control of external compute and storage resources | |
| CN102567472B (en) | Built-in database based high-efficient data deleting and restoring method | |
| CN116048874A (en) | Data backup method and system based on cloud environment | |
| CN102096613A (en) | Method and device for generating snapshot | |
| US8195612B1 (en) | Method and apparatus for providing a catalog to optimize stream-based data restoration |
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 |