Point in time database restore from storage snapshots

Information

  • Patent Grant
  • 9558078
  • Patent Number
    9,558,078
  • Date Filed
    Tuesday, October 28, 2014
    10 years ago
  • Date Issued
    Tuesday, January 31, 2017
    8 years ago
Abstract
Archiving a database and point in time recovery of the database. A method includes taking a first snapshot of a database. The first snapshot of the database includes a first snapshot of the data in the data storage and a first snapshot of the log records in the log storage. The method further includes taking a second snapshot of the database. The second snapshot of the database includes a second snapshot of the data in data storage and a second snapshot of the log records. The method further includes restoring the database to a particular point by applying the first snapshot of the data in the data storage to the database, applying the first snapshot of the log records in the log storage to the database and applying a portion of the second snapshot of the log records in the log storage to the database.
Description
BACKGROUND AND RELEVANT ART

Backups of very large databases have limitations in that they require a large movement of data from the database files to backup media. In a cloud environment, that may mean moving data from cloud storage to a virtual machine and back to cloud storage, crossing expensive boundaries. Storage system snapshots have helped this by providing a metadata-only mechanism to achieve an image of the storage at that point in time. However, this has had the disadvantage that such backups cannot restore the database to an arbitrary point in time between snapshot backups. Rather, the backup is only restored to the point of the snapshot, and any changes to the database after the backup are lost.


Other solutions have relied on streaming backups, which suffer from the data movement problem, or they rely completely on snapshots, which give the ability to restore only to the discrete times when the snapshot is taken.


The subject matter claimed herein is not limited to embodiments that solve any disadvantages or that operate only in environments such as those described above. Rather, this background is only provided to illustrate one exemplary technology area where some embodiments described herein may be practiced.


BRIEF SUMMARY

One embodiment illustrated herein includes a system for archiving a database to allow for point in time recovery of the database. The system includes a database. The database includes data storage for storing data items and log storage for storing log records. The system further includes one or more processors and one or more computer readable media. The one or more computer readable media include computer executable instructions that when executed by at least one of the one or more processors cause at least one of the one or more processors to perform various actions of a method. The method includes taking a first snapshot of the data storage of the database at a first time. The method further includes capturing a first state of the log storage corresponding to the first snapshot of the data storage of the database. The log storage comprises an enumeration of operations on the data storage of the database. The method further includes taking a second snapshot of the data storage of the database at a second subsequent time. The method further includes capturing a second state of the log corresponding to the second snapshot of the database. The second state of the log includes all log records occurring after the time of the first snapshot of the database to the time of the second snapshot of the database. The method further includes restoring the database to a particular point between the first time and the second time by applying the first snapshot of the data in data storage to the database, applying the captured first state of the log corresponding to the first snapshot of the log to the database and applying a portion of the second state of the log to perform a point in time recovery between the first time and the second time.


Another embodiment illustrated herein includes a system for archiving a database to allow for point in time recovery of the database. The system includes a database. The database includes data storage for storing data items and log storage for storing log records. The system further includes one or more processors and one or more computer readable media. The one or more computer readable media include computer executable instructions that when executed by at least one of the one or more processors cause a method to be performed. The method includes taking a first snapshot of a database at a first time. The first snapshot of the database includes a first snapshot of the data in the data storage of the database and a first snapshot of the log records in the log storage. The log comprises an enumeration of operations on the database. The method further includes taking a second snapshot of the database at a second subsequent time. The second snapshot of the database includes a second snapshot of the data in data storage of the database and a second snapshot of the log records in the log storage. The second snapshot of the log records in the log storage is a snapshot of all log records after the time of the first snapshot of the database to the time of the second snapshot of the database. The method further includes restoring the database to a particular point between the first time and the second time by applying the first snapshot of the data in the data storage to the database, applying the first snapshot of the log records in the log storage to the database and applying a portion of the second snapshot of the log records in the log storage to the database to perform a point in time recovery between the first time and the second subsequent time.


Another embodiment illustrated herein includes a system for archiving a database to allow for point in time recovery of the database. The system includes a database. The database includes data storage for storing data items and log storage for storing log records. The system further includes one or more processors and one or more computer readable media. The one or more computer readable media include computer executable instructions that when executed by at least one of the one or more processors cause a method to be performed. The method includes taking a first snapshot of a database at a first time. The first snapshot of the database includes a first snapshot of the data in the data storage of the database and a first snapshot of the log records in the log storage. The log comprises an enumeration of operations on the database. The method further includes taking one or more additional snapshots of the database at one or more times respectively subsequent to the first time. The one or more additional snapshots of the database include additional snapshots of the data storage in the database and one or more additional snapshots of the log storage respectively. For each additional snapshot of the data storage in the database, the corresponding snapshot of the log storage is a snapshot of all log records occurring after the time of the additional snapshot of the database to the time of a most recent previous snapshot of the database. The method further includes restoring the database to a particular point between a last occurring subsequent snapshot of the database and a most recent snapshot of the database occurring prior to the last occurring subsequent snapshot of the database by applying the first snapshot of the data in the data storage to the database, applying the first snapshot of the log records in the log storage to the database and applying and log records from the one or more additional snapshots of the log storage to the database to perform a point in time recovery.


This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.


Additional features and advantages will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the teachings herein. Features and advantages of the invention may be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims. Features of the present invention will become more fully apparent from the following description and appended claims, or may be learned by the practice of the invention as set forth hereinafter.





BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and other advantages and features can be obtained, a more particular description of the subject matter briefly described above will be rendered by reference to specific embodiments which are illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments and are not therefore to be considered to be limiting in scope, embodiments will be described and explained with additional specificity and detail through the use of the accompanying drawings in which:



FIG. 1A illustrates a database and a first snapshot of the database;



FIG. 1B illustrates the database and a second snapshot of the database:



FIG. 1C illustrates the database and a third snapshot of the database;



FIG. 2A illustrates the state of a database at a first time during a restore process;



FIG. 2B illustrates the state of a database at a second time during the restore process;



FIG. 2C illustrates the state of a database at a third time during the restore process;



FIG. 3 illustrates a method of archiving and restoring a database;



FIG. 4 illustrates another method of archiving and restoring a database; and



FIG. 5 illustrates another method of archiving and restoring a database.





DETAILED DESCRIPTION

Some embodiments herein use a snapshot infrastructure to eliminate data movement during a backup stage, but enable the user to restore to an arbitrary point in time between two adjacent snapshots, without requiring streaming transaction log backups. This can be accomplished by laying down the database files from a first snapshot in sequence, and then using only the active transaction log data from a second snapshot to roll the newly restored database forward in time to the point that the user desires. The transaction log for each snapshot is an enumeration of operations performed on the database from the most recent snapshot to the current snapshot which includes the snapshot of the transaction log.


Snapshots of the database can be created periodically using the snapshot infrastructure provided by the storage. The snapshot will require no data movement but just some metadata updates in the storage layer. The snapshots are treated as the backups of the database.


To restore to any point in time desired, two consecutive snapshots (a first snapshot and a second snapshot) enclosing the time can be first identified. Then both the data and log records from the first snapshot can be copied to become the files of the database to be restored. The database can start recovery by applying the log records of the first snapshot to update the data which has not yet been written to the data file. After applying the last log record from the first snapshot, the recovery is paused. After that, only the log portion from the second snapshot is copied to the restoring database's log storage. The snapshot portion of the data from the second snapshot is discarded. Recovery can identify where it stopped in the log previously from the first snapshot and resume to scan the new log records from the second snapshot and start applying them one by one until it reaches the log record that has passed the time a user has identified as the stop time. The remaining log records from the second snapshot can be wiped out by zeroing their portion in the file. Finally, the database can be fully recovered by carrying out an undo phase.


Referring now to FIG. 1A, a database system 100 that can implement embodiments of the invention is illustrated. The database system includes a database 102. The database 102 includes data storage 104 and log storage 106. The data storage 104 includes the data structure and values that make up the database. In this current example, a single row of data records are shown, but it should be appreciated that the data storage 104 may represent one or more tables or other complex database structures.


Further, while the database 102 is illustrated in a way that would appear to be a single entity at a single location, the database 102 is often distributed across storage devices and often times across different machines in different locations. That is, the database 102 may be a distributed database with different portions of the database residing in different locations. Often, such databases are implemented in a cloud environment where the different portions of the database are hosted by different virtual machines in the cloud environment.


A database will often include several different versions of a data item to allow the database to be rolled back as a result of transaction failures or for other reasons that may cause a versioned database to be useful. For example, as illustrated in FIG. 1B, which shows the database 102 at a subsequent time to that of FIG. 1A, the data storage 104 includes a data item G at location D7 in the data storage 104. The data storage 104 also includes a data item G′, that is a new version of data item G, at location D8 of the data storage 104. The log storage 106 memorializes this change. For example, at location L1 of the log storage 106, the operation change G to G′ is memorialized. Thus, the log storage 106 stores a list of operations performed on the data storage 104.


The log storage 106, in the illustrated example, is a circular ring buffer with n records (i.e. from location L1 to location Ln). Note that the size may be dynamic if there is a need to grow the size of the log storage 106 to ensure that records are not lost before they are snapshotted as will be explained in more detail below. Due to the ring buffer nature of the log storage, operations will be memorialized in log storage 106. Once an operation has been snapshotted, the location of that record will be marked as overwritable such that new records can be written into that location. Thus, for example, log records may be made into locations L1, L2, and L3 of the log storage. These may be snapshotted as part of a snapshot operation for the database 102, as will be illustrated below. Once they are snapshotted, they can be marked as available for new log records. As changes are made to the database 102 (and in particular the data storage 104) new records will be made to the log storage 106. Once a record is made at log storage location Ln, so long as L1 has been marked as overwritable, the next log record will be made at L1 overwriting the record that previously existed there.


If however, L1 is not marked as overwritable, the log storage 106 can be expanded to accommodate the additional log records. However, it is preferable that the log storage 106 be of a somewhat limited size and not expand. This can be achieved by adjusting the frequency or time of snapshots as will be illustrated below.


The database 102 also includes a mapping structure 107. The mapping structure 107 contains a set of pointers to storage locations. The mapping structure 107, at any given time, represents the state of the data in the database at that time. In particular, the mapping structure 107 will point to the storage location, and thus the data, that is current in the database 102.


The database 102 can be backed up by creating snapshots of the database. The snapshots of the database 102 do not store the actual data from the data storage 104, but rather store pointers to records in the data storage 104. Thus, for example, a data portion of a snapshot will be a snapshot at a particular time of the mapping structure 107 at that time. The snapshots can also store log operations from the log storage 106. Once log operations from the log storage 106 have been snapshotted, then the storage locations for those snapshotted operations can be marked as free or overwritable.



FIGS. 1A, 1B and 1C illustrate a set of three snapshots 108-1, 108-2 and 108-3. The three snapshots represent a sequence of adjacent (in time) snapshots (with snapshot 108-1 being first in time, snapshot 108-2 being second in time, and snapshot 108-3 being third in time), meaning that there are no additional snapshots intervening between any of the three snapshots. As illustrated, the snapshots do not include data from the data storage 104, but rather include pointers to storage locations in the data storage 104. Thus, for example, snapshot 108-1 includes a data portion 110-1 with pointers to locations D1, D2, D3, D4, D5, D6 and D7. Snapshot 108-1 also includes a log portion 112-1. However, the log portion 112-1 is not shown with any records as, either there are none, or while they may exist in actual embodiments, and that existence is significant, the particular values in those recorded values are not needed for the present illustration.


The snapshot 108-2 in FIG. 1B is taken after changes are made to the data storage 104 and records are added to the log storage 106. In particular, data item G at data storage location D7 is changed to a new version G′ stored at storage location D8. Also, data item B at storage location D2 is changed to a new version B′ at data storage location D9. The snapshot 108-2 includes a new mapping with mapping to locations D8 and D9 instead of the mappings to locations D7 and D2 respectively. Thus, the snapshot 108-2 includes a data portion 110-2 with the new mapping, and a log portion 112-1 with the new log records.


The log storage 106 is updated at locations L1 and L2 respectively to memorialize the operations that caused these changes. While simply shown as a change from G→G′ or from B→B′, it should be appreciated that the log can memorialize details, such as what operation is performed. For example, the actual log record may indicate writing G′ to a particular database table location. The log records at locations L1 and L2 are snapshotted as part of the snapshot 108-2. Once the log records have been snapshotted, the log storage locations L1 and L2 can be marked as free or overwritable.


The snapshot 108-3 in FIG. 1C is taken after additional changes are made to the data storage 104 and additional records are added to the log storage 106. In this example, data item C is updated to a new version C′, and data item E is updated to a new version E′. This is reflected in the snapshot 108-3 with the pointers to data storage locations D10 and D11 in the data portion 110-3 of the snapshot 108-3. The log portion 112-3 of the snapshot 108-3 includes the log records from location L3 and L4 of the log storage 106. As the locations L3 and L4 of the log storage 106 of the database 102 have been snapshotted, those locations (i.e. L3 and L4) can be marked as free or overwritable. At this point, using the snapshots 108-1 through 108-3, the database can be recovered to any point in time after the time of the first snapshot 108-1 to the time of the third snapshot 108-3.


An example of database recovery is illustrated in FIGS. 2A, 2B and 2C. In the example illustrated, the database 102 is recovered at a point between the second snapshot 108-2 and the third snapshot 108-3. In particular, the database is to be restored to the point in time after data item C is updated to C′.



FIG. 2A illustrates the database 102, including the data storage 104 and the log storage 106 at an initial time. To restore the database to the desired point in time, the second snapshot 108-2 and third snapshot 108-3 are identified. The second snapshot 108-2, including the snapshot of the log included in the log portion 112-2 is applied to the database 102. As illustrated in FIG. 2B, this causes the records from the data portion 110-2 of the snapshot 108-2 to be applied to the mapping structure 107 and the records from the log portion 112-2 of the snapshot 108-2 to be applied to the log storage 106.


Then a portion of the log portion 112-3 from the third snapshot 108-3 is applied to the log storage 106 of the database 102 as illustrated in FIG. 2C. In particular, all records in the log portion 112-3 up to and including the operation that updates C to C′ are applied to the log storage 106. As such, the database is thereby restored to the point in time when data item C was updated to version C′.


While the casual observer will note that in the Figures, the log records in log storage in FIG. 2C are in the same storage locations (i.e. L1, L2, and L3) as those in FIG. 1, this is purely coincidental. The log records could be restored to any appropriate location in the ring buffer of the log storage 106 that are available for restoring the log records. Alternatively, the log storage 106 can be treated as if all entries are invalid, and the log records can be restored as if the log storage 106 had all storage locations available for writing.


In the example illustrated in FIGS. 2A through 2C, at FIG. 2B, the log records from the second snapshot 108-2 are applied to the log storage 106. However, it should be appreciated that in some situations, those records would not need to be restored. For example, if all changes to the data in the database were made durable (i.e. all transactions are committed or rolled back) prior to the second snapshot 108-2, there may be no need for the log records memorializing the changes from G to G′ and from B to B′ as they would not be needed to roll back any outstanding transactions. In this case, all that would be needed to restore the database 102 is the data portion 110-2 of the second snapshot 108-2 and the log portion 112-3 of the third snapshot 108-3.


Note that in an alternative embodiment, a database may be restored by using a single data portion obtained from one snapshot and several different log portions obtained from corresponding snapshots. For example, one could restore the database to the point in time where data item C is updated to C′ by first applying the data portion 110-1 of the first snapshot 108-1 to the database 102, applying the log portion 112-1 of the first snapshot 108-1 to the log storage 106 of the database 102, applying the log portion 112-2 of the second snapshot 108-2 to the log storage 106 of the database, and finally by applying a portion of the log portion 112-3 to the log storage 106 of the database 102.


The examples illustrated above illustrate snapshots which include both the data portion and log portion. It should be appreciated that these can be obtained in a number of different ways. Further, some embodiments may be implemented where the data portion and the log portion of a snapshot are stored separately. Further, these portions may be obtained through different sets of operations. However even in these cases, the log portion of a snapshot (or a log snapshot corresponding to a data snapshot) generally only includes a memorialization of operations after the most recent previous snapshot of the data to the snapshot to which the log portion belongs. Thus, in most embodiments, the log portion will not include log records occurring before the most recent previous snapshot or log records occurring after the current snapshot. Thus, for example, the log portion 112-2 will typically only include log records occurring after the snapshot 108-1 up to and including the time of the snapshot 108-2. However, in other embodiments, the log portion will include log records occurring before the most recent previous snapshot and/or log records occurring after the current snapshot


The following discussion now refers to a number of methods and method acts that may be performed. Although the method acts may be discussed in a certain order or illustrated in a flow chart as occurring in a particular order, no particular ordering is required unless specifically stated, or required because an act is dependent on another act being completed prior to the act being performed.


Referring now to FIG. 3, a method 300 is illustrated. The method 300 includes acts for archiving and restoring a database. The method 300 includes taking a first snapshot of the data storage of the database at a first time (act 302). The method 300 further includes capturing a first state of the log storage corresponding to the first snapshot of the data storage of the database (act 304). The log storage comprises an enumeration of operations on the data storage of the database. For example, FIG. 1A illustrates a snapshot 108-2 taken at a first time. The snapshot 108-2 includes a data portion 110-2 and a log portion 112-2.


The method 300 further includes taking a second snapshot of the data storage of the database at a second subsequent time (act 306). The method 300 further includes capturing a second state of the log corresponding to the second snapshot of the database (act 308). The second state of the log includes all log records occurring after the time of the first snapshot of the database to the time of the second snapshot. For example, FIG. 1B illustrates taking a second snapshot 108-3 with a data portion 110-3 and a log portion 112-3. The log portion includes a memorialization of the log records at location L3 and L4. These records were created after the first snapshot 108-2.


The method 300 further includes restoring the database to a particular point between the first time and the second time by applying the first snapshot of the data in data storage to the database, applying the captured first state of the log corresponding to the first snapshot of the log to the database and applying a portion of the second state of the log to perform a point in time recovery between the first time and the second time (act 310). Thus, as illustrated in FIGS. 2A-2C, the data portion 110-2 and the log portion 112-2 can be applied to the database 102 (as illustrated in FIG. 2B), and then a portion of the log portion 112-3 can be applied as illustrated in FIG. 2C to achieve a point in time recovery.


The method 300 may be practiced where taking a second snapshot of the data storage of the database and capturing the second state of the log corresponding to the second snapshot of the databased is performed in a unified snapshot of the database operation. Thus, for example, the snapshot 108-3 may be taken as a single snapshot or set of snapshot operations to capture both the data portion 110-2 and the log portion 112-2.


Some embodiments may be practiced in a system that includes a data mapping structure (such as the data mapping structure 107). In these embodiments, taking snapshots of the data storage may include capturing pointers in the data mapping structure pointing to locations in the data storage. The snapshots illustrated in FIGS. 1A-1C illustrate such snapshots.


The method 300 may be practiced where capturing a state of the log storage comprises capturing one or more representations of data operations performed on data items in the data storage. Thus for example, the log portion may indicate what operations were performed on particular data items.


Some embodiments may be practiced in a system that is a distributed database implemented in a cloud environment, such that different portions of the database are implemented on different virtual machines in the cloud environment.


Some embodiments may be practiced in a system that where the database is a versioned database storing different versions of data items. Thus, in one example, as illustrated in FIG. 1C, the database contains both old versions and news versions of data items G, B C and E.


Some embodiments may be practiced in a system where the log storage comprises a ring buffer. In such embodiments, the method 300 may further includes causing storage locations in the log storage to be made available, for new records, once existing records in those locations have been captured when capturing a state of the log storage corresponding to a snapshot.


Referring now to FIG. 4, another method for archiving and restoring a database is illustrated. The method may be practiced in a database environment. The method 400 includes taking a first snapshot of a database at a first time (act 402). The first snapshot of the database includes a first snapshot of the data in the data storage of the database and a first snapshot of the log records in the log storage. The log storage comprises an enumeration of operations on the database;


The method 400 further includes taking a second snapshot of the database at a second subsequent time (act 404). The second snapshot of the database includes a second snapshot of the data in data storage of the database and a second snapshot of the log records in the log storage. The second snapshot of the log records in the log storage is a snapshot of all log records after the time of the first snapshot of the database to the time of the second snapshot of the database.


The method 400 further includes restoring the database to a particular point between the first time and the second time by applying the first snapshot of the data in the data storage to the database, applying the first snapshot of the log records in the log storage to the database and applying a portion of the second snapshot of the log records in the log storage to the database to perform a point in time recovery between the first time and the second subsequent time. An example is illustrated in FIGS. 2A-2C discussed above.


The method may be practiced in a system comprising a data mapping structure. In some such embodiments, taking snapshots of the database comprises capturing pointers in the data mapping structure pointing to locations in the data storage.


The method may be practiced in a system where the log records in the log storage comprise one or more representations of data operations performed on data items in the data storage.


The method may be practiced in a system where the database is a distributed database implemented in a cloud environment, such that different portions of the database are implemented on different virtual machines in the cloud environment.


The method may be practiced in a system where the database is a versioned database storing different versions of data items.


The method may be practiced in a system where the log storage comprises a ring buffer. In some such embodiments, the method 400 may further includes causing storage locations in the log storage to be made available, for new records, once existing records in those locations have been captured during a snapshot.


Referring now to FIG. 5, a method of archiving and restoring a database is illustrated. The method 500 includes taking a first snapshot of a database at a first time (act 502). The first snapshot of the database includes a first snapshot of the data in the data storage of the database and a first snapshot of the log records in the log storage. The log storage comprises an enumeration of operations on the database;


The method 500 further includes taking one or more additional snapshots of the database at one or more times respectively subsequent to the first time (act 504). The one or more additional snapshots of the database include one or more additional snapshots of the data storage in the database and one or more additional snapshots of the log storage respectively. For each additional snapshot of the data storage in the database, the corresponding snapshot of the log storage is a snapshot of all log records occurring after the time of the additional snapshot of the database to the most recent time of a previous snapshot of the database.


The method 500 further includes restoring the database to a particular point between a last occurring subsequent snapshot of the database and a most recent snapshot of the database occurring prior to the last occurring subsequent snapshot of the database by applying the first snapshot of the data in the data storage to the database, applying the first snapshot of the log records in the log storage to the database and applying and log records from the one or more additional snapshots of the log storage to the database to perform a point in time recovery. Thus for example, with reference to the figures, the snapshot 108-1, including the data portion 110-1 and the log portion 112-1 could be applied to the database (such as by applying the data portion 110-1 to the mapping structure 107 and the log portion 112-1 to the log storage 106. The log portion 112-2 of the second snapshot 108-2 could also be applied to the log storage 106. Then, a portion of the log portion 112-3 of the third snapshot 108-3 could be applied to the log storage 106 to perform the point in time recovery.


The method may be practiced in a system comprising a data mapping structure. In some such embodiments, taking snapshots of the database includes capturing pointers in the data mapping structure pointing to locations in the data storage.


The method may be practiced in a system where the log records in the log storage comprise one or more representations of data operations performed on data items in the data storage.


The method may be practiced in a system where the database is a distributed database implemented in a cloud environment, such that different portions of the database are implemented on different virtual machines in the cloud environment.


The method may be practiced in a system where the database is a versioned database storing different versions of data items.


The method may be practiced in a system where the log storage comprises a ring buffer. In some such embodiments, the method 500 may further include causing storage locations in the log storage to be made available, for new records, once existing records in those locations have been captured during a snapshot.


Further, the methods may be practiced by a computer system including one or more processors and computer readable media such as computer memory. In particular, the computer memory may store computer executable instructions that when executed by one or more processors cause various functions to be performed, such as the acts recited in the embodiments.


Embodiments of the present invention may comprise or utilize a special purpose or general-purpose computer including computer hardware, as discussed in greater detail below. Embodiments within the scope of the present invention also include physical and other computer-readable media for carrying or storing computer-executable instructions and/or data structures. Such computer-readable media can be any available media that can be accessed by a general purpose or special purpose computer system. Computer-readable media that store computer-executable instructions are physical storage media. Computer-readable media that carry computer-executable instructions are transmission media. Thus, by way of example, and not limitation, embodiments of the invention can comprise at least two distinctly different kinds of computer-readable media: physical computer readable storage media and transmission computer readable media.


Physical computer readable storage media includes RAM, ROM, EEPROM, CD-ROM or other optical disk storage (such as CDs, DVDs, etc), magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer.


A “network” is defined as one or more data links that enable the transport of electronic data between computer systems and/or modules and/or other electronic devices. When information is transferred or provided over a network or another communications connection (either hardwired, wireless, or a combination of hardwired or wireless) to a computer, the computer properly views the connection as a transmission medium. Transmissions media can include a network and/or data links which can be used to carry or desired program code means in the form of computer-executable instructions or data structures and which can be accessed by a general purpose or special purpose computer. Combinations of the above are also included within the scope of computer-readable media.


Further, upon reaching various computer system components, program code means in the form of computer-executable instructions or data structures can be transferred automatically from transmission computer readable media to physical computer readable storage media (or vice versa). For example, computer-executable instructions or data structures received over a network or data link can be buffered in RAM within a network interface module (e.g., a “NIC”), and then eventually transferred to computer system RAM and/or to less volatile computer readable physical storage media at a computer system. Thus, computer readable physical storage media can be included in computer system components that also (or even primarily) utilize transmission media.


Computer-executable instructions comprise, for example, instructions and data which cause a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, or even source code. Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the described features or acts described above. Rather, the described features and acts are disclosed as example forms of implementing the claims.


Those skilled in the art will appreciate that the invention may be practiced in network computing environments with many types of computer system configurations, including, personal computers, desktop computers, laptop computers, message processors, hand-held devices, multi-processor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, mobile telephones, PDAs, pagers, routers, switches, and the like. The invention may also be practiced in distributed system environments where local and remote computer systems, which are linked (either by hardwired data links, wireless data links, or by a combination of hardwired and wireless data links) through a network, both perform tasks. In a distributed system environment, program modules may be located in both local and remote memory storage devices.


Alternatively, or in addition, the functionally described herein can be performed, at least in part, by one or more hardware logic components. For example, and without limitation, illustrative types of hardware logic components that can be used include Field-programmable Gate Arrays (FPGAs), Program-specific Integrated Circuits (ASICs), Program-specific Standard Products (ASSPs), System-on-a-chip systems (SOCs), Complex Programmable Logic Devices (CPLDs), etc.


The present invention may be embodied in other specific forms without departing from its spirit or characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

Claims
  • 1. A system comprising: a database, wherein the database comprises: data storage for storing data items;log storage for storing log records that comprise a list of operations performed on the data storage at discrete points in time; anda mapping structure representing state of the data in the database at any given point in time, the mapping structure comprising a set of pointers to storage locations for data as currently stored at the given point in time;one or more physical computer storage media comprising computer executable instructions;one or more processors, which when executing the computer executable instructions, cause the system to archive the database by providing point in time recovery of the database by restoring the database to a selected point in time between adjacent snapshots, by performing the following: taking a plurality of snapshots each comprising: a data portion comprising pointers to storage locations for data items existing in the database at each respective point in time;a log portion comprising a state of the log storage containing records that represent an enumeration of operations performed on the data storage at each respective point in time;andrestoring the database to a particular point in time between a first point in time and a second point in time that is adjacent to the first point in time, by performing the following: for a first snapshot corresponding to the first point in time, performing the following: applying the data portion comprising pointers to storage locations for data items existing in the database at the first point in time; andapplying the log portion comprising a state of the log storage containing records that represent an enumeration of operations performed on the data storage at the first point in time; andfor a second snapshot corresponding to the adjacent second point in time, applying a portion which comprises some but not all of the log portion of the second snapshot, wherein the applied portion comprises only those log records that represent an enumeration of operations performed on stored data up to the particular point in time between the first point in time and the second point in time.
  • 2. The system of claim 1, wherein first and second snapshots are performed in a unified snapshot of the database.
  • 3. The system of claim 1, wherein the data portion of each snapshot comprises capturing the set of pointers in the data mapping structure at each point in time corresponding to each snapshot.
  • 4. The system of claim 1, wherein size of the log storage of the database is limited to avoid unrestrained expansion by adjusting frequency of the plurality of snapshots taken.
  • 5. The system of claim 1, wherein the database is a distributed database implemented in a cloud environment, such that different portions of the database are implemented on different virtual machines in the cloud environment.
  • 6. The system of claim 1, wherein the database is a versioned database storing different versions of data items.
  • 7. The system of claim 1, wherein the log storage comprises a ring buffer, and wherein storage locations in the log storage are made available, for new records, once existing records in those locations have been captured.
  • 8. A system comprising: a database, wherein the database comprises: data storage for storing data items;log storage for storing log records that comprise a list of operations performed on the data storage at discrete points in time; anda mapping structure representing state of the data in the database at any given point in time, the mapping structure comprising a set of pointers to storage locations for data as currently stored at the given point in time;one or more physical computer storage media comprising computer executable instructions;one or more processors, which when executing the computer executable instructions, cause the system to archive the database by providing point in time recovery of the database by restoring the database to a selected point in time between two snapshots, by performing the following: taking a first snapshot of the database at a first time, and wherein the first snapshot comprises: a data portion containing the set of pointers in the mapping structure at the first time corresponding to the first snapshot of the data in the data storage of the databases; anda log portion containing the list of any operations performed on data up to the first time corresponding to the first snapshot of the log records in the log storage;taking one or more additional snapshots of the database at one or more times subsequent to the first time, wherein the one or more additional snapshots each comprise: a data portion containing the set of pointers in the mapping structure corresponding to each subsequent time for a taken subsequent snapshot of the data storage; anda log portion containing the list of any operations performed on data up to the subsequent time corresponding to each subsequent snapshot, wherein for each additional snapshot the corresponding list of the log portion is a list of all log records occurring after the time of the additional snapshot of the database from a most recent previous snapshot of the database; andrestoring the database to a particular point between two snapshots of the database by performing the following: applying the data and log portions of the first snapshot; andthen applying some but not all of the log portions from two or more of the additional snapshots, wherein the applied log portions comprise only those records that represent an enumeration of operations performed on stored data up to the particular point in time.
  • 9. The system of claim 8, wherein the data portion of each snapshot comprises capturing the set of pointers in the data mapping structure at each point in time corresponding to each snapshot.
  • 10. The system of claim 8, wherein size of the log storage of the database is limited to avoid unrestrained expansion by adjusting frequency of the plurality of snapshots taken.
  • 11. The system of claim 8, wherein the database is a distributed database implemented in a cloud environment, such that different portions of the database are implemented on different virtual machines in the cloud environment.
  • 12. The system of claim 8, wherein the database is a versioned database storing different versions of data items.
  • 13. The system of claim 8, wherein the log storage comprises a ring buffer, and wherein storage locations in the log storage are made available, for new records, once existing records in those locations have been captured.
  • 14. A computer-implemented method for archiving a database by providing point in time recovery of the database, the computer-implemented method being performed by one or more processors executing computer executable instructions for the computer-implemented method, and the computer-implemented method comprising: taking a plurality of snapshots each comprising: a data portion comprising pointers to storage locations for data items existing in the database at each respective point in time;a log portion comprising a state of the log storage containing records that represent an enumeration of operations performed on the data storage at each respective point in time; andrestoring the database to a particular point in time between a first point in time and a second point in time that is adjacent to the first point in time, by performing the following: for a first snapshot corresponding to the first point in time, performing the following: applying the data portion comprising pointers to storage locations for data items existing in the database at the first point in time; andapplying the log portion comprising a state of the log storage containing records that represent an enumeration of operations performed on the data storage at the first point in time; andfor a second snapshot corresponding to the adjacent second point in time, applying a portion which comprises some but not all of the log portion of the second snapshot, wherein the applied portion comprises only those log records that represent an enumeration of operations performed on stored data up to the particular point in time between the first point in time and the second point in time.
  • 15. The computer-implemented method of claim 14, wherein after applying the log portion of the first snapshot, the computer-implemented method further comprises: pausing the recovery;discarding the data portion of the second snapshot; andthen resuming recovery by applying said portion which comprises some but not all of the log portion of the second snapshot.
  • 16. The computer-implemented method of claim 15, wherein the computer implemented method further comprises: zeroing out the log portion of the second snapshot that is not applied once the records up to the give point in time have been applied; andthen carrying out an undo operation.
  • 17. The computer-implemented method of claim 14, wherein size of the log storage of the database is limited to avoid unrestrained expansion by adjusting frequency of the plurality of snapshots taken.
  • 18. The computer-implemented method of claim 14, wherein first and second snapshots are performed in a unified snapshot of the database.
  • 19. The computer-implemented method of claim 14, wherein the data portion of each snapshot comprises capturing the set of pointers in the data mapping structure at each point in time corresponding to each snapshot.
  • 20. The computer-implemented method of claim 14, wherein size of the log storage of the database is limited to avoid unrestrained expansion by adjusting frequency of the plurality of snapshots taken.
  • 21. The computer-implemented method of claim 14, wherein the database is a distributed database implemented in a cloud environment, such that different portions of the database are implemented on different virtual machines in the cloud environment.
  • 22. The computer-implemented method of claim 14, wherein the database is a versioned database storing different versions of data items.
  • 23. The computer-implemented method of claim 14, wherein the log storage comprises a ring buffer, and wherein storage locations in the log storage are made available, for new records, once existing records in those locations have been captured.
US Referenced Citations (352)
Number Name Date Kind
5175849 Schneider Dec 1992 A
5193162 Bordsen et al. Mar 1993 A
5193181 Barlow et al. Mar 1993 A
5261102 Hoffman Nov 1993 A
5313612 Satoh et al. May 1994 A
5317731 Dias et al. May 1994 A
5446871 Sholmer et al. Aug 1995 A
5455946 Mohan et al. Oct 1995 A
5493649 Slivka et al. Feb 1996 A
5517643 Davy May 1996 A
5537533 Staheli et al. Jul 1996 A
5568629 Gentry et al. Oct 1996 A
5621882 Kakuta Apr 1997 A
5664148 Mulla et al. Sep 1997 A
5664189 Wilcox et al. Sep 1997 A
5678042 Pisello et al. Oct 1997 A
5720026 Sakakura et al. Feb 1998 A
5758359 Saxon May 1998 A
5805785 Dias et al. Sep 1998 A
5813017 Morris Sep 1998 A
5857208 Ofek Jan 1999 A
5870758 Bamford et al. Feb 1999 A
5875479 Blount et al. Feb 1999 A
5884328 Mosher Mar 1999 A
5905988 Schwartz et al. May 1999 A
5930824 Anglin et al. Jul 1999 A
5978813 Foltz et al. Nov 1999 A
5987506 Carter et al. Nov 1999 A
6018746 Hill et al. Jan 2000 A
6047294 Deshayes et al. Apr 2000 A
6061769 Kapulka et al. May 2000 A
6061770 Franklin May 2000 A
6065018 Beier et al. May 2000 A
6072952 Janakiraman Jun 2000 A
6076148 Kedem Jun 2000 A
6105030 Syed et al. Aug 2000 A
6175932 Foote et al. Jan 2001 B1
6223269 Blumenau Apr 2001 B1
6247141 Homberg Jun 2001 B1
6260120 Blumenau et al. Jul 2001 B1
6269431 Dunham Jul 2001 B1
6311288 Heeren et al. Oct 2001 B1
6324654 Wahl et al. Nov 2001 B1
6327579 Crawford Dec 2001 B1
6362870 Mui et al. Mar 2002 B2
6373988 Thorell et al. Apr 2002 B1
6434681 Armangau Aug 2002 B1
6438749 Chamberlain Aug 2002 B1
6449625 Wang Sep 2002 B1
6453325 Cabrera et al. Sep 2002 B1
6487677 Jantz et al. Nov 2002 B1
6490691 Kimura et al. Dec 2002 B1
6553388 Perks Apr 2003 B1
6606651 Linde Aug 2003 B1
6618822 Loaiza et al. Sep 2003 B1
6618851 Zundel et al. Sep 2003 B1
6647399 Zaremba Nov 2003 B2
6665815 Goldstein et al. Dec 2003 B1
6691140 Bogrett Feb 2004 B1
6714980 Markson et al. Mar 2004 B1
6728848 Tamura et al. Apr 2004 B2
6732125 Autrey et al. May 2004 B1
6742139 Forsman et al. May 2004 B1
6771843 Huber et al. Aug 2004 B1
6785786 Gold et al. Aug 2004 B1
6792517 Brunnett et al. Sep 2004 B1
6792518 Armangau et al. Sep 2004 B2
6795895 Merkey et al. Sep 2004 B2
6833073 Agarwal Dec 2004 B2
6898608 Hopeman et al. May 2005 B2
6912631 Kekre et al. Jun 2005 B1
6915315 Autrey et al. Jul 2005 B2
6931531 Takahashi Aug 2005 B1
6938134 Madany Aug 2005 B2
6940855 Okamura Sep 2005 B2
6950871 Honma et al. Sep 2005 B1
6978282 Dings et al. Dec 2005 B1
6981177 Beattie Dec 2005 B2
7007043 Farmer et al. Feb 2006 B2
7010553 Chen et al. Mar 2006 B2
7043503 Haskin et al. May 2006 B2
7051050 Chen et al. May 2006 B2
7058849 Erstad Jun 2006 B2
7065671 Nishimura Jun 2006 B2
7082446 Bottomley Jul 2006 B1
7093086 Van Rietschote Aug 2006 B1
7096382 Novick Aug 2006 B2
7099900 Bromley et al. Aug 2006 B1
7107486 Okada et al. Sep 2006 B2
7133884 Murley et al. Nov 2006 B1
7143307 Witte et al. Nov 2006 B1
7155586 Wagner et al. Dec 2006 B1
7165156 Cameron et al. Jan 2007 B1
7171511 Yagawa Jan 2007 B2
7181476 Lee et al. Feb 2007 B2
7185081 Liao Feb 2007 B1
RE39549 Syed et al. Apr 2007 E
7206911 Wolfgang et al. Apr 2007 B2
7216135 Sawdon et al. May 2007 B2
7237021 Penney et al. Jun 2007 B2
7246275 Therrien et al. Jul 2007 B2
7251716 Nagae et al. Jul 2007 B2
7251749 Fong et al. Jul 2007 B1
7254682 Arbon Aug 2007 B1
7257595 Verma et al. Aug 2007 B2
7263590 Todd et al. Aug 2007 B1
7272666 Rowan et al. Sep 2007 B2
7277905 Randal et al. Oct 2007 B2
7287133 Rowan et al. Oct 2007 B2
7290102 Lubbers et al. Oct 2007 B2
7296115 Kano Nov 2007 B2
7296382 Sack Nov 2007 B2
7356679 Le et al. Apr 2008 B1
7373364 Chapman May 2008 B1
7373366 Chatterjee et al. May 2008 B1
7395278 Zwilling et al. Jul 2008 B2
7406487 Gupta Jul 2008 B1
7406488 Stager et al. Jul 2008 B2
7418547 Lam Aug 2008 B2
7426618 Vu et al. Sep 2008 B2
7437603 Ebata et al. Oct 2008 B2
7440965 Pruthi et al. Oct 2008 B1
7447939 Faulkner et al. Nov 2008 B1
7461293 Ohno et al. Dec 2008 B2
7536529 Chatterjee et al. May 2009 B1
7552358 Asgar-Deen et al. Jun 2009 B1
7574622 Soran et al. Aug 2009 B2
7577689 Masinter et al. Aug 2009 B1
7577692 Corbett et al. Aug 2009 B1
7610314 Souder et al. Oct 2009 B2
7613945 Soran et al. Nov 2009 B2
7620785 Coulter et al. Nov 2009 B1
7676502 Atluri et al. Mar 2010 B2
7698401 Atluri et al. Apr 2010 B2
7720817 Stager et al. May 2010 B2
7734909 Roush et al. Jun 2010 B1
7743178 Warren et al. Jun 2010 B2
7752166 Quinlan et al. Jul 2010 B2
7814057 Kathuria et al. Oct 2010 B2
7814367 Squibb et al. Oct 2010 B1
7822715 Petruzzo Oct 2010 B2
7827350 Jiang et al. Nov 2010 B1
7839865 Doherty et al. Nov 2010 B2
7849257 Kim Dec 2010 B1
7853571 Ranade et al. Dec 2010 B2
7860832 Midgley et al. Dec 2010 B2
7979656 Atluri et al. Jul 2011 B2
7979741 Amano et al. Jul 2011 B2
8019925 Vogan et al. Sep 2011 B1
8028194 Atluri et al. Sep 2011 B2
8055745 Atluri et al. Nov 2011 B2
8069227 Atluri et al. Nov 2011 B2
8095511 Zwilling Jan 2012 B2
8209680 Le et al. Jun 2012 B1
8224786 Atluri et al. Jul 2012 B2
8364648 Sim-Tang Jan 2013 B1
8521695 Zwilling et al. Aug 2013 B2
8527470 Atluri et al. Sep 2013 B2
8527721 Atluri et al. Sep 2013 B2
8601225 Atluri et al. Dec 2013 B2
8683144 Atluri et al. Mar 2014 B2
8732136 Atluri et al. May 2014 B2
8838528 Atluri et al. Sep 2014 B2
8868858 Atluri et al. Oct 2014 B2
8949395 Atluri et al. Feb 2015 B2
9098455 Atluri et al. Aug 2015 B2
9209989 Atluri et al. Dec 2015 B2
20010011265 Cuan et al. Aug 2001 A1
20010029477 Freeman et al. Oct 2001 A1
20010044807 Kleiman et al. Nov 2001 A1
20010056525 Selkirk et al. Dec 2001 A1
20020007363 Vaitzblit Jan 2002 A1
20020008795 Koyama et al. Jan 2002 A1
20020087950 Brodeur et al. Jul 2002 A1
20020095479 Schmidt Jul 2002 A1
20020124013 Loy et al. Sep 2002 A1
20020136162 Yoshimura et al. Sep 2002 A1
20020147941 Gentile Oct 2002 A1
20020178146 Akella et al. Nov 2002 A1
20020198699 Greene et al. Dec 2002 A1
20030023676 Slater Jan 2003 A1
20030028736 Berkowitz et al. Feb 2003 A1
20030046260 Satyanarayanan et al. Mar 2003 A1
20030056139 Murray et al. Mar 2003 A1
20030061456 Ofek et al. Mar 2003 A1
20030061537 Cha et al. Mar 2003 A1
20030070042 Byrd et al. Apr 2003 A1
20030070043 Merkey Apr 2003 A1
20030093444 Huxoll May 2003 A1
20030093579 Zimmer et al. May 2003 A1
20030097611 Delaney et al. May 2003 A1
20030117306 Okuda et al. Jun 2003 A1
20030126238 Kohno et al. Jul 2003 A1
20030135703 Martin et al. Jul 2003 A1
20030149752 Baldwin et al. Aug 2003 A1
20030158861 Sawdon et al. Aug 2003 A1
20030158873 Sawdon et al. Aug 2003 A1
20030167380 Green et al. Sep 2003 A1
20030172158 Pillai et al. Sep 2003 A1
20030204534 Hopeman et al. Oct 2003 A1
20030208511 Earl et al. Nov 2003 A1
20030212789 Hamel Nov 2003 A1
20030220935 Vivian et al. Nov 2003 A1
20040006723 Erstad Jan 2004 A1
20040030954 Loaiza et al. Feb 2004 A1
20040031030 Kidder et al. Feb 2004 A1
20040034669 Smith et al. Feb 2004 A1
20040054643 Vemuri et al. Mar 2004 A1
20040064639 Sicola et al. Apr 2004 A1
20040068627 Sechrest et al. Apr 2004 A1
20040083345 Kim et al. Apr 2004 A1
20040088301 Mahalingam et al. May 2004 A1
20040093474 Lin et al. May 2004 A1
20040098547 Ofek et al. May 2004 A1
20040107226 Autrey et al. Jun 2004 A1
20040117437 Frank Jun 2004 A1
20040117438 Considine et al. Jun 2004 A1
20040139128 Becker et al. Jul 2004 A1
20040167943 Margolus Aug 2004 A1
20040172574 Wing et al. Sep 2004 A1
20040190459 Ueda et al. Sep 2004 A1
20040199515 Penny et al. Oct 2004 A1
20040199549 Oksanen Oct 2004 A1
20040205312 Zlotnick et al. Oct 2004 A1
20040205390 Kanevsky et al. Oct 2004 A1
20040210608 Lee et al. Oct 2004 A1
20040220961 Lee et al. Nov 2004 A1
20040221125 Ananthanarayanan et al. Nov 2004 A1
20040250021 Honda et al. Dec 2004 A1
20040260673 Hitz et al. Dec 2004 A1
20040260678 Verbowski et al. Dec 2004 A1
20040267828 Zwilling et al. Dec 2004 A1
20040267835 Zwilling et al. Dec 2004 A1
20040267836 Armangau et al. Dec 2004 A1
20040268068 Curran et al. Dec 2004 A1
20050005066 Nakayama et al. Jan 2005 A1
20050010835 Childs et al. Jan 2005 A1
20050015415 Grarimella et al. Jan 2005 A1
20050015416 Yamagami Jan 2005 A1
20050021869 Aultman et al. Jan 2005 A1
20050022213 Yamagami Jan 2005 A1
20050027749 Ohno et al. Feb 2005 A1
20050032479 Miller et al. Feb 2005 A1
20050033930 Haruma et al. Feb 2005 A1
20050038968 Iwamura Feb 2005 A1
20050044162 Liang et al. Feb 2005 A1
20050050110 Sawdon et al. Mar 2005 A1
20050050386 Reinhardt et al. Mar 2005 A1
20050055603 Soran et al. Mar 2005 A1
20050066095 Mullick et al. Mar 2005 A1
20050071379 Kekre et al. Mar 2005 A1
20050071390 Midgley et al. Mar 2005 A1
20050076261 Rowan et al. Apr 2005 A1
20050081089 Hayardeny et al. Apr 2005 A1
20050086650 Yates et al. Apr 2005 A1
20050102547 Keeton et al. May 2005 A1
20050125513 Lam et al. Jun 2005 A1
20050125573 Klein et al. Jun 2005 A1
20050131966 Lou Jun 2005 A1
20050131969 Nishigaki Jun 2005 A1
20050131990 Jewell Jun 2005 A1
20050132351 Randall et al. Jun 2005 A1
20050138081 Alshab et al. Jun 2005 A1
20050138090 Augenstein et al. Jun 2005 A1
20050138204 Iyer et al. Jun 2005 A1
20050182797 Adkins et al. Aug 2005 A1
20050182953 Stager et al. Aug 2005 A1
20050188256 Stager et al. Aug 2005 A1
20050193031 Midgley et al. Sep 2005 A1
20050195660 Kavuri et al. Sep 2005 A1
20050198303 Knauerhase et al. Sep 2005 A1
20050198452 Watanabe Sep 2005 A1
20050210218 Hoogterp Sep 2005 A1
20050216527 Erlingsson Sep 2005 A1
20050216788 Mani-Meitav et al. Sep 2005 A1
20050223043 Randal et al. Oct 2005 A1
20050223181 Jeppsen et al. Oct 2005 A1
20050226059 Kavuri et al. Oct 2005 A1
20050235016 Amano Oct 2005 A1
20050240792 Sicola et al. Oct 2005 A1
20050246311 Whelan et al. Nov 2005 A1
20050251540 Sim-Tang Nov 2005 A1
20050257085 Haustein et al. Nov 2005 A1
20050262097 Sim-Tang et al. Nov 2005 A1
20050262377 Sim-Tang Nov 2005 A1
20050267916 Tone et al. Dec 2005 A1
20050267920 Helliker et al. Dec 2005 A1
20060010227 Atluri et al. Jan 2006 A1
20060020572 Ishii et al. Jan 2006 A1
20060031468 Atluri et al. Feb 2006 A1
20060041602 Lomet et al. Feb 2006 A1
20060047714 Anderson et al. Mar 2006 A1
20060047895 Rowan et al. Mar 2006 A1
20060047997 Anderson et al. Mar 2006 A1
20060047999 Passerini et al. Mar 2006 A1
20060053139 Marzinski et al. Mar 2006 A1
20060053333 Uhlmann et al. Mar 2006 A1
20060059209 Lashley Mar 2006 A1
20060064541 Kano Mar 2006 A1
20060080362 Wagner et al. Apr 2006 A1
20060107006 Green et al. May 2006 A1
20060114497 Anderson et al. Jun 2006 A1
20060133428 Guthrie et al. Jun 2006 A1
20060149793 Kushwah et al. Jul 2006 A1
20060149798 Yamagami Jul 2006 A1
20060155674 Traut et al. Jul 2006 A1
20060155912 Singh et al. Jul 2006 A1
20060206536 Sawdon et al. Sep 2006 A1
20060212481 Stacey et al. Sep 2006 A1
20060218434 Solhjell Sep 2006 A1
20070022117 Keohane et al. Jan 2007 A1
20070033356 Erlikhman Feb 2007 A1
20070038887 Witte et al. Feb 2007 A1
20070038998 Fries Feb 2007 A1
20070055833 Vu et al. Mar 2007 A1
20070101421 Wesinger, Jr. et al. May 2007 A1
20070129953 Cunningham et al. Jun 2007 A1
20070168404 Nakamura et al. Jul 2007 A1
20070174669 Ebata et al. Jul 2007 A1
20070185922 Kapoor et al. Aug 2007 A1
20070244938 Michael Oct 2007 A1
20070282921 Atluri et al. Dec 2007 A1
20070299959 Penny et al. Dec 2007 A1
20080010411 Yang et al. Jan 2008 A1
20080046710 Maddocks et al. Feb 2008 A1
20080134163 Golde et al. Jun 2008 A1
20080147756 Stager et al. Jun 2008 A1
20080147821 Dietrich et al. Jun 2008 A1
20080162590 Kundu Jul 2008 A1
20080201390 Anguelov Aug 2008 A1
20080208933 Lyon Aug 2008 A1
20080250198 Purchase et al. Oct 2008 A1
20090019308 Amano Jan 2009 A1
20090070627 Lohn et al. Mar 2009 A1
20090150906 Schmidt et al. Jun 2009 A1
20090177718 Patterson et al. Jul 2009 A1
20090228645 Kitamura Sep 2009 A1
20090300412 Soran et al. Dec 2009 A1
20100205231 Cousins Aug 2010 A1
20100269146 Britt Oct 2010 A1
20110078119 Soran et al. Mar 2011 A1
20110161295 Ngo Jun 2011 A1
20110258385 Soran et al. Oct 2011 A1
20120101997 Zwilling et al. Apr 2012 A1
20120102001 Longshaw Apr 2012 A1
20120124006 Zizys et al. May 2012 A1
20120173673 Dietrich et al. Jul 2012 A1
20130085994 Michael et al. Apr 2013 A1
20140108348 Ahrens Apr 2014 A1
20140279907 Koza et al. Sep 2014 A1
20140279930 Gupta et al. Sep 2014 A1
20140279931 Gupta et al. Sep 2014 A1
Foreign Referenced Citations (2)
Number Date Country
2004021677 Mar 2004 WO
WO2013138969 Sep 2013 WO
Non-Patent Literature Citations (110)
Entry
Continuous Archiving and Point-in-Time Recovery (PITR), Published on: Aug. 30, 2011, Available at: http://www.postgresql.org/docs/9.1/static/continuous-archiving.html.
SAP HANA Disaster Recovery Support, Retrieved on: Sep. 29, 2014, Available at: http://help.sap.com/saphelp—hanaplatform/helpdata/en/b7/4e16a9e09541749a745f41246a065e/frameset.htm.
Point-In-Time recovery, Retrieved on: Sep. 29, 2014, Available at: http://www.percona.com/doc/percona-xtrabackup/1.6/innobackupex/pit—recovery—ibk.html.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2015/057275”, Mailed Date: Mar. 2, 2016, 17 Pages.
“International Search Report for PCT/US04/24048” mailed date: May 31, 2005.
Al-Kateb, “CME: A Temporal Relational Model for Efficient Coalescing,” 2005, IEEE Xplore, p. 83-90.
Bhattacharya et al., Coordinating Backup/Recovery and Data Consistency Between Database and File Systems, ACM SIGMOD'2002, Jun. 4-6, 2002, pp. 500-511.
Ceri et al., “Independent Updates and Incremental Agreement in Replicated Databases,” Distributed and Parallel Databases, vol. 2, No. 3, 1995 (pp. 225-246).
Chervenak et al., “Protecting File Systems: A Survey of Backup Techniques,” GA Tech University, pp. 17-32.
Chuang-Hue Moh, “A Snapshot Utility for a Distributed Object-Oriented Database System,” MIT Laboratory for Computer Science, Aug. 14, 2002, pp. 1-19.
Data Protection—Perform Zero Downtime Backups [Online Jan. 29, 2009]. Retrieved from the Internet URL: http://stage.hp.resource.com/sbso/bus—protect/data—protect/zero—downtime.
Doherty, “Database Systems Management and Oracle8,” Proceeding SIGMOD '98 Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data—SIGMOD '98, Seattle, WA, vol. 27, Issue 2, Jun. 1998, pp. 510-511.
Elnozahy et al., “A Survey of Rollback-Recovery Protocols in Message-Passing Systems,” ACM Computing Surveys, Sep. 2002, 34(3), 375-408.
Gao et al., “Visibility Culling for Time-Varying Volume Rendering Using Temporal Occlusion Coherence,” 2004, IEEE Xplore, pp. 147-154.
Gladney, “Data Replicas in Distributed Information Services,” ACM Transactions on Database Systems, Mar. 1989, pp. 75-97, vol. 14, No. 1.
HP Open View Storage Data Protector 5.1 Software [online] Retrieved on Jan. 29, 2009 from Internet URL: http://www.hp.com/products1/storage/pdfs/media/OVDPds2.pdf.
Lahiri et al., “Fast-Start: Quick Fault Recovery in Oracle,” Proceedings of the 2001 ACM SIGMOD, International Conference on Management of Data, vol. 30, Issue 2, Jun. 2001 (pp. 593-598).
Lindsay, et al., “A Snapshot Differential Refresh Algorithm,” Proceedings of the 1986 ACM SIGMOD International Conference on Management of Data, 1986, pp. 53-60, vol. 15, Issue 2.
Mohan et al., “ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging,” ACM Transactions on Database Systems, 1992, 17(1), 94-162.
Neel, D., “Symantec Says It'll Put Data on Road to Recovery—New LiveState Une Promises Complete System Restoration,” Computer Reseller News, Oct. 4, 2004, 12.
Storagecraft Technology Corporation: Protecting Windows Servers and PCs with Fast and Reliable Online Backup and Bare Metal Recovery Solutions.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/057275”, Mailed Date: May 12, 2016, 13 Pages.
U.S. Appl. No. 10/833,541, mailed Feb. 1, 2005, Final Office Action.
U.S. Appl. No. 10/883,541, mailed Aug. 10, 2005, Final Office Action.
U.S. Appl. No. 10/883,541, mailed Jan. 24, 2006, Office Action.
U.S. Appl. No. 10/883,541, mailed Jun. 5, 2006, Final Office Action.
U.S. Appl. No. 10/883,541, mailed Jun. 14, 2007, Office Action.
U.S. Appl. No. 11/099,021, mailed Aug. 7, 2007, Office Action.
U.S. Appl. No. 10/833,541, mailed Nov. 30, 2007, Final Office Action.
U.S. Appl. No. 11/099,021, mailed Jan. 24, 2008, Final Office Action.
U.S. Appl. No. 11/438,036, mailed Feb. 15, 2008, Office Action.
U.S. Appl. No. 10/859,368, mailed Feb. 19, 2008, Office Action.
U.S. Appl. No. 11/438,401, mailed May 21, 2008, Office Action.
U.S. Appl. No. 11/099,021, mailed Sep. 22, 2008, Office Action.
U.S. Appl. No. 10/859,368, mailed Oct. 14, 2008, Office Action.
U.S. Appl. No. 11/438,036, mailed Oct. 16, 2008, Office Action.
U.S. Appl. No. 11/438,401, mailed Nov. 26, 2008, Office Action.
U.S. Appl. No. 11/229,289, mailed Feb. 2, 2009, Office Action.
U.S. Appl. No. 11/099,021, mailed Mar. 20, 2009, Final Office Action.
U.S. Appl. No. 11/438,036, mailed Mar. 24, 2009, Office Action.
U.S. Appl. No. 11/229,289, mailed Jul. 27, 2009, Office Action.
U.S. Appl. No. 11/438,401, mailed Aug. 5, 2009, Final Office Action.
U.S. Appl. No. 11/099,021, mailed Oct. 2, 2009, Office Action.
U.S. Appl. No. 11/229,289, mailed Oct. 15, 2009, Office Action.
U.S. Appl. No. 11/438,036, mailed Oct. 19, 2009, Office Action.
U.S. Appl. No. 11/438,401, mailed Oct. 22, 2009, Notice of Allowance.
U.S. Appl. No. 10/859,368, mailed Dec. 2, 2009, Notice of Allowance.
U.S. Appl. No. 11/099,021, mailed May 21, 2010, Final Office Action.
U.S. Appl. No. 11/229,289, mailed Jun. 11, 2010, Office Action.
U.S. Appl. No. 11/099,021, mailed Jul. 22, 2010, Notice of Allowance.
U.S. Appl. No. 11/438,036, mailed Aug. 19, 2010, Office Action.
U.S. Appl. No. 12/344,320, mailed Sep. 7, 2010, Office Action.
U.S. Appl. No. 11/229,289, mailed Oct. 18, 2010, Office Action.
U.S. Appl. No. 12/344,320, mailed Jan. 13, 2011, Office Action.
U.S. Appl. No. 11/229,289, mailed Feb. 3, 2011, Office Action.
U.S. Appl. No. 12/344,315, mailed Mar. 14, 2011, Office Action.
U.S. Appl. No. 12/186,636, mailed Mar. 24, 2011, Notice of Allowance.
U.S. Appl. No. 12/344,335, mailed Apr. 4, 2011, Office Action.
U.S. Appl. No. 12/344,345, mailed Apr. 12, 2011, Office Action.
U.S. Appl. No. 12/344,311, mailed Jun. 23, 2011, Office Action.
U.S. Appl. No. 11/229,289, mailed Jun. 24, 2011, Notice of Allowance.
U.S. Appl. No. 12/344,315, mailed Jul. 18, 2011, Notice of Allowance.
U.S. Appl. No. 12/344,323, mailed Sep. 15, 2011, Office Action.
U.S. Appl. No. 10/833,541, mailed Sep. 16, 2011, Notice of Allowance.
U.S. Appl. No. 12/344,319, mailed Sep. 21, 2011, Office Action.
U.S. Appl. No. 12/344,345, mailed Sep. 27, 2011, Final Office Action.
U.S. Appl. No. 12/344,364, mailed Oct. 7, 2011, Office Action.
U.S. Appl. No. 11/438,036, mailed Oct. 13, 2011, Office Action.
U.S. Appl. No. 12/344,335, mailed Oct. 28, 2011, Final Office Action.
U.S. Appl. No. 12/508,633, mailed Sep. 21, 2011, Office Action.
U.S. Appl. No. 12/344,311, mailed Dec. 7, 2011, Office Action.
U.S. Appl. No. 12/508,633, mailed Jan. 12, 2012, Final Office Action.
U.S. Appl. No. 11/438,036, mailed Jan. 30, 2012, Office Action.
U.S. Appl. No. 12/344,319, mailed Feb. 10, 2012, Office Action.
U.S. Appl. No. 12/344,323, mailed Feb. 10, 2012, Office Action.
U.S. Appl. No. 12/691,745, mailed Feb. 15, 2012, Office Action.
U.S. Appl. No. 12/344,364, mailed Feb. 24, 2012, Final Office Action.
U.S. Appl. No. 12/344,311, mailed Mar. 5, 2012, Notice of Allowance.
U.S. Appl. No. 12/344,345, mailed Mar. 27, 2012, Office Action.
U.S. Appl. No. 12/691,745, mailed May 23, 2012, Final Office Action.
U.S. Appl. No. 13/339,077, mailed Jun. 21, 2012, Office Action.
U.S. Appl. No. 12/344,335, mailed Jul. 12, 2012, Office Action.
U.S. Appl. No. 12/344,345, mailed Sep. 7, 2012, Final Office Action.
U.S. Appl. No. 13/339,077, mailed Nov. 30, 2012, Office Action.
U.S. Appl. No. 12/344,335, mailed Jan. 22, 2013, Final Office Action.
U.S. Appl. No. 12/344,319, mailed Apr. 25, 2013, Office Action.
U.S. Appl. No. 13/339,077, mailed Apr. 26, 2013, Notice of Allowance.
U.S. Appl. No. 12/344,364, mailed May 1, 2013, Notice of Allowance.
U.S. Appl. No. 12/344,345, mailed May 2, 2013, Notice of Allowance.
U.S. Appl. No. 12/344,323, mailed Jun. 5, 2013, Office Action.
U.S. Appl. No. 12/691,745, mailed Jun. 17, 2013, Office Action.
U.S. Appl. No. 11/438,036, mailed Jul. 24, 2013, Office Action.
U.S. Appl. No. 12/344,319, mailed Jul. 31, 2013, Notice of Allowance.
U.S. Appl. No. 12/508,633, mailed Sep. 26, 2013, Office Action.
U.S. Appl. No. 12/344,323, mailed Oct. 11, 2013, Notice of Allowance.
U.S. Appl. No. 12/691,745, mailed Oct. 22, 2013, Final Office Action.
U.S. Appl. No. 11/438,036, mailed Jan. 16, 2014, Office Action.
U.S. Appl. No. 12/508,633, mailed Jan. 21, 2014, Final Office Action.
U.S. Appl. No. 12/691,745, mailed Jan. 27, 2014, Notice of Allowance.
U.S. Appl. No. 12/344,335, mailed Feb. 13, 2014, Office Action.
U.S. Appl. No. 12/508,633, mailed Mar. 18, 2014, Final Office Action.
U.S. Appl. No. 12/344,320, mailed Apr. 23, 2014, Office Action.
U.S. Appl. No. 12/344,335, mailed May 14, 2014, Notice of Allowance.
U.S. Appl. No. 12/508,633, mailed Jul. 9, 2014, Final Office Action.
U.S. Appl. No. 11/438,036, mailed Jul. 28, 2014, Notice of Allowance.
U.S. Appl. No. 12/508,633, mailed Sep. 26, 2014, Notice of Allowance.
U.S. Appl. No. 12/344,320, mailed Oct. 29, 2014, Office Action.
U.S. Appl. No. 14/496,293, mailed Mar. 31, 2015, Notice of Allowance.
U.S. Appl. No. 12/344,320, mailed Aug. 6, 2015, Notice of Allowance.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/057275”, Mailed Date: Aug. 9, 2016, 13 Pages.
Related Publications (1)
Number Date Country
20160117228 A1 Apr 2016 US