Efficient data backup

Information

  • Patent Grant
  • 8468136
  • Patent Number
    8,468,136
  • Date Filed
    Friday, June 8, 2007
    17 years ago
  • Date Issued
    Tuesday, June 18, 2013
    11 years ago
Abstract
Systems and methods are provided for storing and restoring digital data. In some implementations, a method is provided. The method includes identifying an item for segmented backup according to one or more specified criteria, and performing a first backup of the item including separating the item into a plurality of first parts prior to backing up the data and including separately storing each part. Other embodiments of this aspect include corresponding systems, apparatus, computer program products, and computer readable media.
Description
TECHNICAL FIELD

The disclosed implementations relate generally to storing and restoring digital data.


BACKGROUND

Modern graphical user interfaces allow a large number of graphical objects or items to be displayed on a display screen at the same time. Operating systems, e.g., Apple Mac OS®, provide user interfaces in which a number of graphical user interface windows can be displayed, overlapped, resized, moved, configured, and reformatted according to the needs of a user or a particular application. Taskbars, menus, virtual buttons, and other user interface elements provide mechanisms for accessing and activating windows even when they are hidden behind other windows.


With the sophisticated tools available, users are encouraged not only to create and save a multitude of items in their computers, but to revise or otherwise improve on them over time. For example, a user can work with a certain file and thereafter save the file's current version on a storage device. The next day, however, the user could have had second thoughts about the revisions, or could have come up with new ideas, and therefore opens the file again.


The revision process is usually straightforward if the user wants to add more material to the file or make changes to what is there. But it is typically more difficult for a user who has changed his/her mind about changes that were previously made and wants the file returned to a previous version. Application programs for word processing typically let the user “undo” previous edits of a text, at least up to a predefined number of past revisions. The undo feature also usually is configured so that the previously made revisions must be undone in reverse chronological order; that is, the user must first undo the most recently made edit, then the second-most recent one, and so on. If the user saves and closes the document and thereafter opens the document again, it might not be possible to automatically undo any previous edits.


SUMMARY

Systems and methods are provided for storing and restoring digital data. In general, in one aspect, a method is provided. The method includes identifying an item for segmented backup according to one or more specified criteria, and performing a first backup of the item including separating the item into a plurality of first parts prior to backing up the data and including separately storing each part. Other embodiments of this aspect include corresponding systems, apparatus, computer program products, and computer readable media.


Implementations of the aspect can include one or more of the following features. The aspect can further include identifying changes to the item and performing a second backup of the item including identifying changed data in the item relative to the first backup, and storing the changed data as one or more second parts of the item. Identifying the item for segmented backup can include determining whether a size of the item exceeds a specified threshold or determining whether the item has been changed within a specified time.


Performing the first backup of the item can further include generating an index where the index includes information for assembling the plurality of first parts. Performing the second backup of the item can further include generating an updated index, where the updated index includes information for assembling the plurality of first parts and the second parts of the item. Performing the second backup of the item can further include generating links associating file system representations of the unchanged parts of the item in the second back up with corresponding parts in the first backup of the item. The item can be a mail database.


In general, in one aspect, a method is provided. The method includes identifying an item to be included in a backup, determining whether the item is a moved item, including identifying one or more identifiers for the item, comparing the one or more identifiers with items in a previous backup, and when the item is a moved file, backing up the item including linking the item to the corresponding item in the previous backup. Other embodiments of this aspect include corresponding systems, apparatus, computer program products, and computer readable media.


Implementations of the aspect can include one or more of the following features. Identifying one or more identifiers can include identifying a physical storage location of the item. Identifying one or more identifiers can include identifying a creation data of the item. Comparing the one or more identifiers can include traversing second items in one or more previous backups and identifying any matching identifiers to the item. The item can be determined to be a moved item when a second item in the previous backup is identified as having a same physical storage location and creation date as the item.


Particular embodiments of the subject matter described in this specification can be implemented to realize one or more of the following advantages. Backups can be performed efficiently including storing only a portion of an item representing changed data in the backup data. Backups can also be performed efficiently including determining whether an item is new or moved such that moved items are represented in the backup as a reference to an earlier backup.


The details of the various aspects of the subject matter described in this specification are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of the invention will become apparent from the description, the drawings, and the claims.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram showing an example system.



FIG. 2 is a block diagram showing an example of a backup component and interactions with the backup component.



FIGS. 3A-B are block diagrams showing examples of item portions in a backup that link to a previous backup.



FIG. 4 is a flow chart showing an example of a process for performing backup operations for large items.



FIG. 5 is a flow chart showing an example of a process for including a moved item in a backup operation.





DETAILED DESCRIPTION


FIG. 1 is a block diagram of a system 100. The system 100 can be used, for example, for electronic backup and restoration of encrypted data in a user interface view. As used herein, a view refers to an item, element or other content, capable of being presented in a user interface that can be subjected to a backup operation by a backup component 117 included in the system 100. For example, a user interface view can contain any number of icons, files, folders, application state information and/or machine state information, etc. In some implementations, the backup operation includes generating a link to an item or a portion of an item in a previous backup.


The system 100 includes a personal computer 102, communicatively coupled to a remote server 107 using a network interface 116, and a network 108 (e.g., local area network, wireless network, Internet, intranet, etc.). The computer 102 generally includes a processor 103, memory 105, one or more input devices 114 (e.g., keyboard, mouse, etc.), and one or more output devices 115 (e.g., a display device). A user interacts with the system 100 using the input and output devices 114, 115. The system 100 also includes various hardware elements. The system 100 can include hardware, software, and combinations of the two.


The computer 102 also includes a local storage device 106 and a graphics module 113 (e.g., a graphics card) for storing information and generating graphical objects, respectively. The local storage device 106 can be a computer-readable medium. The computer-readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more of them.


While electronic backups of data are described herein with respect to a personal computer 102, it should be apparent that the disclosed implementations can be incorporated in, or integrated with, any electronic device, including without limitation, portable and desktop computers, servers, electronics, media players, game devices, mobile phones, email devices, personal digital assistants (PDAs), embedded devices, televisions, other consumer electronic devices, etc.


Systems and methods are provided for electronic backup and restoration of data. The systems and methods can be stand-alone or otherwise integrated into a more comprehensive application. In the materials presented below, an integrated system and method for electronic backup and restoration of data is disclosed.


One of ordinary skill in the art will recognize that the engines, methods, processes and the like that are described can themselves be an individual process or application, part of an operating system, a plug-in, an application or the like. In one implementation, the system and methods can be implemented as one or more plug-ins that are installed and run on the personal computer 102. The plug-ins are configured to interact with an operating system (e.g., MAC OS® X, WINDOWS XP, LINUX, etc.) and to perform the various functions, as described below.


A system and method for link management can also be implemented as one or more software applications running on the computer 102. Such a system and method can be characterized as a framework or model that can be implemented on various platforms and/or networks (e.g., client/server networks, wireless networks, stand-alone computers, portable electronic devices, mobile phones, etc.), and/or embedded or bundled with one or more software applications (e.g., email, media player, browser, etc.).


The computer 102 includes a backup component 117 that allows for the storage of versions of the computer's files or other items (e.g., restoring a view including past state of a file, application, application data, parameters, settings, and the like), for example within the local storage 106 or in an external storage repository. For example, the backup component 117 can capture at least one earlier version of a user interface view and allow a user to initiate a restoration based on the earlier version. As used herein, a view refers to an item, or other content, capable of being presented in a user interface, that can be subjected to a backup operation by the backup component 117. For example, a user interface view can contain any number of elements such as icons, files, folders, application state information, and/or machine state information, etc. In one implementation, the backup component 117 also allows a user to select any of the stored versions and use the selected version to initiate a restoration of that version in the computer.


Though discussion is made with reference to modifying a user interface view, those of ordinary skill will recognize that such a view can be based on various data structures, files, processes, and other aspects of information management. It follows that modification to file structures, data and the like is also contemplated in order to achieve the modification to the user interface view. In other words, while the restoration of the user interface view from one state to another is the most apparent change from the user's perspective, this is accomplished through the corresponding changes in the underlying system content.



FIG. 2 is a block diagram of an exemplary architecture 200 for enabling the backup and restoration of data. The data can include, for example, application files, application data, settings, parameters or the like, such as those associated with a set of applications 228. The backup component 117 provides backup and restoration capability for the system 100. Many different items or elements can be the subject of a backup operation in the system 100. For example, folders, files, items, information portions, directories, images, system parameters, playlists, address books, e-mails, e-mail folders, application states, and the like all can be candidates for inclusion in an archive as backup data. Other types of data can be included as backup data.


In some implementations, the backup component 117 uses a storage device 232. The storage device 232 can be an internal or external resource, or a combination of the two. Any number of local and/or external storage devices can be used by the backup component 117 for storing backup data. In some implementations, the backup component 117 can view storage devices designated for use in storing backup data as a single memory bank.


In one implementation, the backup component 117 stores the backup data in a format corresponding to a file system structure. Backup data can be stored incrementally during a backup operation where backup data is periodically written to a particular storage device.


In one implementation, one copy of original data (e.g., folders, files, items, information portions, directories, images, system parameters, playlists, address books, e-mails, e-mail folders, application states, preferences, and the like) is stored in the system as backup data (e.g., an original version of the data). When one or more subsequent sets of backup data, or versions, of the data are generated through subsequent backup operations, the backup data can contain only the differences between a current data version and the prior backup data, thereby saving storage space. In some implementations, the storage devices 204 and 232 can be used to store the original backup data as well as links pointing to the original backup data. The links can be hard links which reference, or point to, physical data, or as another example can be symbolic links that reference another file on the storage device (e.g., by name or location).


In another implementation, the backup component 117 runs as a background task on an operating system 230, where the task is generally not visible to the user. The backup component 117 can be can be configured to run across multiple user accounts.


The backup component 117 includes an activity monitoring engine 212. In one implementation, the activity monitoring engine 212 monitors for changes within data (e.g., files or application states) targeted for inclusion in backup operations. A change can also include the addition of new files or other data structures and the modification or deletion of existing ones.


In one implementation, the activity monitoring engine 212 is capable of discerning between a substantive change (e.g. the text within a document has been modified) and a non-substantive change (e.g. the play count within an iTunes playlist has been updated, or several changes cancel each other out) through the activity monitoring engine's interaction with the applications 228. The activity monitoring engine 212 can, for example, create a list of modified elements (e.g., files) to be used when a backup operation is eventually triggered. In one implementation, the activity monitoring engine 212 can monitor the system for periods of inactivity. The activity monitoring engine 212 can then trigger a backup operation during a period of time in which the backup operation will not cause a system slowdown for an active user.


A preference management engine 214 specifies some operating parameters of the backup component 117. In one implementation, the preference management engine 214 contains user-specified and/or system default application parameters for the backup component 117. These can include settings for the details of capturing and storing the views. For example, the preference management engine 214 can determine the frequency of backup operations, the storage location for the backup data, the types of elements (e.g., files or other items) that are eligible for inclusion in backup operations, and the events which trigger a backup operation (periodic or event-driven, etc.).


In one implementation, the preference management engine 214 can detect that a new storage device is being added to the system and prompt the user whether it should be included as a backup repository. Files and other items can be scheduled for a backup operation due to location (e.g. everything on the C: drive and within D:/photos), a correlation with specific applications (e.g. all pictures, music, e-mail, address book and system settings), or a combination of strategies. Different types of items can be scheduled to be stored on different devices or on different segments of a storage device during a backup operation. In one implementation, the backup component 117 stores the versions in a format corresponding to a file system structure.


A backup management engine 216 coordinates the collection, storage, and retrieval of view versions performed by the backup component 117. For example, the backup management engine 216 can trigger the activity monitoring engine 212 to monitor for activities that satisfy one or more criteria specified in the preference management engine 214 for initiating a backup operation.


A change identifying engine 218 locates specific element (e.g., files or other items) to determine if data associated with the elements has changed. The change identifying engine 218 can be capable of discerning a substantive change from a non-substantive change. For example, the change identifying engine 218 can identify a loss of data associated with a user's current view. In one implementation, the change identifying engine 218 traverses a target set of files or other items, comparing a previous version to the current version to determine whether or not a modification has occurred.


A backup capture engine 220 locates views (e.g., elements, files or other items) that are to be included in a backup operation. The backup capture engine 220 can invoke the activity monitoring engine 212 and/or the change identifying engine 218, for example, to generate a capture list identifying data to be included in a next backup operation. The backup capture engine 220 can then store copies of listed data in one or more targeted storage repositories. The backup capture engine 220 can track multiple versions of elements or items included in the backup repository.


The backup component 117 includes a backup restoration engine 222 to restore previous views (e.g. versions of files, data, or other items). In one implementation, the backup restoration engine 222 provides a user interface (e.g., a graphical user interface) where a user can select the item(s) to be restored.


A device management engine 224 handles the addition and removal of individual storage devices to be used for archiving backup data. In one implementation, the preference management engine 214 obtains user settings regarding the identification of individual storage devices for use in archiving. These settings can include, but are not limited to, particular segments of individual devices to use, a threshold capacity which can be filled with backup data, and particular devices for storing backup data corresponding to individual applications. The device management engine 224 records the storage device settings obtained by the preference management engine 214, which are used to monitor storage device activity. In one implementation, the device management engine 224 can alert the user when a new device has been added to the system. In one implementation, the device management engine 224 can alert the user when an archive-enabled device has been removed from the system. In yet another implementation, the device management engine 224 can alert the user when an archive-enabled device is nearing its threshold storage capacity setting.


An archive management engine 226 tracks where backup data is being stored. In one implementation, the archive management engine 226 obtains settings from the preference management engine 224. The settings can include, but are not limited to, methods to be used to remove older or otherwise unnecessary backup data. The settings can establish one or more criteria for deleting backup data from particular backup operations, for instance in the event of storage capacity being reached or on a regular basis. In one implementation, the archive management engine 226 alerts the user when backup data are unavailable, e.g., because a device has gone offline. In another implementation, the archive management engine 226 bars a user from viewing backup data corresponding to another user's backup data due to system permissions settings.


In this example, an external storage device 232 can be used by the backup component 117 for archiving. Any number of storage devices can be used by the backup component 117. For example, a second external storage device can be used as an overflow repository in the event that the device 232 reaches capacity. In another implementation, different storage devices contain the backup version and incremental updates of data belonging to different applications or to different users on the system 100. As another example, two or more storage devices can be responsible for storing backup data from separate applications in the system 100.


In one implementation, the storage device can be network based. For example, the system can store backup data on a remote server (e.g., using a media access control (MAC) address to a storage location). Alternatively, the user can store backup data on a local storage network such as a storage area network (SAN). In one implementation, the remote network storage is a primary storage location for backup data of an archives In an alternative implementation, the remote network storage is an alternative storage location for backup data. For example, if the user's primary storage location is not available (e.g., a local storage device such as a Firewire drive), then the backup data can be stored on the remote network storage.


The backup data can be compressed and/or encrypted. An example of a compression technique is the ZIP file format for data compression and archiving. An example of an encryption technique is the RSA algorithm for public key encryption. Other compression techniques or encryption techniques could be used. In one implementation, the backup data stored from each backup operation has a structure that mimics a typical file system structure, such that the archived versions from each distinct backup operation can be perused using a standard file system viewing utility.


In one implementation, if multiple users make use of the backup component 117 on a single system (e.g., system 100), each user can select to keep separate backup data archives. Access to an individual user's archives can be password protected or otherwise held in a secure manner. In one implementation, the backup data within the user's archive contains the same read/write permissions as the original data item. In one implementation, the archive management engine 226 inherits the data items' original permissions and indexes the archived contents accordingly. For example, using these permissions settings, the archive management engine 226 can deny a user access to a copy of a data item when the user would not have authorization to view the original data item. In another implementation, the user can establish permissions or encryption techniques specifically for the backup data archive as a whole. User permissions and encryption settings can be user-selectable from within the preference management engine 214. The preference management engine 214 would then transfer the settings to the archive management engine 226 for storage.



FIGS. 3B and 3A are block diagrams showing examples of item portions in a backup 310 that link to item portions in a previous backup 300, respectively. In some implementations, the backup component 117 can perform a backup of a large item, such as a mail database 302. The large item can change frequently. For example, the mail database 302 can repeatedly receive new mail messages that change the contents of the mail database item 302.


The attributes of the mail database 302 and/or conditions of the changes made to the mail database 302 can trigger a segmented backup of the mail database 302 when the backup component 117 performs a backup operation on the mail database 302. For example, if the mail database 302 meets a particular size criterion, such as being at least 500 megabytes in size, then the backup component 117 can perform a segmented backup of the mail database 302. Alternatively or in addition, if the changes to the mail database 302 meet a frequency criterion, such as a particular number of changes occurring within a specified time period, then the backup component 117 can perform a segmented backup of the mail database 302.


Performing the segmented backup includes separating the mail database 302 into multiple portions. For example, the backup component 117 can separate the mail database 302 into a mail header portion 304, a mail data portion 306, and a mail footer portion 308. In some implementations, the portions are separated based on the conditions of updates made to the mail database 302. For example, the mail footer portion 308 can include a portion of the mail database 302 that changes infrequently. Alternatively or in addition, the portions can be separated based on functional areas of the mail database 302. For example, the mail header portion 304 can include a list of mail messages in the mail database 302 and the mail data portion 306 can contain the mail messages included in the mail database 302.


The segmented backup of the mail database 302 also includes a first portion index 309. The first portion index 309 can be generated by the backup component 117 when separating the mail database 302 into portions. The first portion index 309 includes instructions for assembling the portions into the mail database 302. For example, when restoring the mail database 302, the backup component can use the first index portion 309 to reconstitute the mail database as a single data structure in the file system.


In some implementations, backup component 117 generates a subsequent backup of the mail database 302, for example, backup 310. For example, a user can request a backup, an event can trigger a backup (e.g., the modification, addition, or removal of an item), or backup operations can periodically be performed (e.g., according to a specified schedule). When performing the subsequent backup, the backup component 117 identifies changes between the state of the current mail database and the first mail database 302 in the first backup 300. For example, the mail data can include additional mail messages and the list of mail messages in the mail header can have changed accordingly.


The backup component 117 stores changed portions including an additional mail index portion 316 and an additional mail data portion 320 in the second mail database backup 312. Since the portions of the item from the first backup 300 are unchanged for the second backup operation, they can be stored in the second backup 310 as references to the corresponding portions in the first backup 300. The backup component 117 generates links for the unchanged portions including a link 314 to the mail header portion 304, a link 318 to the mail data portion 306, and a link 322 to the mail footer portion 308. The backup component 117 also generates a second portion index 323. The second portion index 323 includes information for assembling the portions 304, 306, 308, 316, and 320 into the mail database 312.


In some implementations, the backup component 117 can perform backups over a network. The backup component 117 can retrieve the first portion index 309 over the network. The backup component 117 can (e.g., using a rolling checksum) determine which portions, if any, have changed since the last backup or another prior backup to which an item links. The backup component 117 sends the changed portions over the network to the storage device.



FIG. 4 is a flow chart showing an example process 400 for performing backup operations for large items. For convenience, the process 400 will be described with respect to a system (e.g., system 100) that performs the process 400. The system identifies (402) an item for a first backup operation. The item can be e.g., a file, folder, state, or other data associated with the system.


The system determines (404) whether the item is a large item. The determination is based on one or more criteria. For example, the backup component (e.g., backup component 117) can designate the item (e.g., mail database 302) for segmented backup based on the size of the item and/or the frequency with which the content in the item changes.


If the system does not designate the item for segmented backup, then the system creates (406) a backup of the item. Otherwise, if the system designates the item for segmented backup, then the system separates (408) the item into multiple portions. For example, a backup component can separate a mail database (e.g., mail database 302) into the portions (e.g., the portions 304, 306, and 308 shown in FIG. 3A). A first index portion (e.g., first index portion 309) is generated relating the separated portions to the whole item.


The system performs (410) a first backup of the separated item portions. For example, as shown in FIG. 3A, for the mail database 302 the backup component stores the portions 304, 306, and 308 along with the first index portion 309 to form the first backup 300. The backup data corresponding to the first backup is stored on a particular backup device designated for an archive of backup data.


The system receives (412) a request to perform a second backup operation. For example, the backup component can receive a user input or can automatically request a second backup according to particular criteria (e.g., a backup event or specified backup schedule).


The system identifies (414) changes to the item relative to the first backup. For example, the backup component can compare the item data (e.g., the second mail database 312) to the item data in the first backup (e.g. the first mail database in first backup 300) to determine changes between the two. In some implementations, where the first mail database backup includes links to a previous backup, the backup component can compare the second mail database to an earlier backup (or backup portion) to which the first mail database links.


The system generates (416) additional portions corresponding to the identified changes to the item data. For example, the backup component can generate the additional portions 316 and 320, corresponding to the additions made to the mail header portion 304 and the mail data portion 306, respectively as shown in FIGS. 3A-3B. Additionally, first index portion 309 is updated to identify the relationship of all portions to the item (e.g., as second index portion 323).


The system performs (418) a backup of the generated portions and creates links to the unchanged portions in the first backup. For example, the backup component stores the newly generated portions 316 and 320 in the second mail database 312 and creates links 314, 318, and 322 to the portions 304, 306, and 308 in the first backup 300. The second backup includes the second mail database and the second index portion. Consequently, the entire item, which can be very large, is not stored as a whole. Instead only portions corresponding to the new data are stored in the second backup.



FIG. 5 is a flow chart showing an example process 500 for including a moved item in a backup operation. For convenience, the process 500 will be described with respect to a system (e.g., system 100) that performs the process 500. The system identifies (502) an item for inclusion in a backup operation. For example, the backup component 117 can receive an input from a user requesting a backup of an item, the backup can be triggered periodically according to a specified schedule, or the backup can be triggered by an event.


The system identifies (504) one or more identifiers associated with the item, such as a storage location and/or an item creation date and time. For example, the backup device 117 can identify a physical location on the local storage 106 at which the item is stored. The physical location on the storage device 106 can be represented, for example, by sector and block identifiers on a hard disk or by a unique identifier used by the storage device 106 (e.g., an i-node value). In addition, the backup component 117 can identify the date and time that the item was placed at the identified location (e.g., a creation date for the item).


The system compares (506) the one or more item identifiers to item identifiers in backup data from one or more previous backups. For example, the backup component 117 can search for the identified physical location and/or the identified creation date and time in backup data from earlier backup operations.


If the system identifies (508) a matching identifier or set of identifiers, then the system stores (510) a reference to the corresponding item identified in a previous backup. For example, the backup operation can store the item as a link to the previous version. If the system does not identify (508) a match, then the system creates (512) a backup of the item (e.g., the data of the item, for example a file, is stored as backup data).


For example, the backup component 117 can find, in a previous backup, an item having the same physical location identifier and creation date, but stored at a different location in the file system. The matching identifiers indicate that the item was moved to a new location, rather than being a new item. The backup component 117 generates a link during the backup operation to the matching item in the previous backup.


In the above description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding. It will be apparent, however, to one skilled in the art that implementations can be practiced without these specific details. In other instances, structures and devices are shown in block diagram form in order to avoid obscuring the disclosure.


In particular, one skilled in the art will recognize that other architectures and graphics environments can be used, and that the examples can be implemented using graphics tools and products other than those described above. In particular, the client/server approach is merely one example of an architecture for providing the functionality described herein; one skilled in the art will recognize that other, non-client/server approaches can also be used. Some portions of the detailed description are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.


It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.


An apparatus for performing the operations herein can be specially constructed for the required purposes, or it can comprise a general-purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program can be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.


The algorithms and modules presented herein are not inherently related to any particular computer or other apparatus. Various general-purpose systems can be used with programs in accordance with the teachings herein, or it could prove convenient to construct more specialized apparatuses to perform the method steps. The required structure for a variety of these systems will appear from the description. In addition, the present examples are not described with reference to any particular programming language. It will be appreciated that a variety of programming languages can be used to implement the teachings as described herein. Furthermore, as will be apparent to one of ordinary skill in the relevant art, the modules, features, attributes, methodologies, and other aspects can be implemented as software, hardware, firmware or any combination of the three. Of course, wherever a component is implemented as software, the component can be implemented as a standalone program, as part of a larger program, as a plurality of separate programs, as a statically or dynamically linked library, as a kernel loadable module, as a device driver, and/or in every and any other way known now or in the future to those of skill in the art of computer programming. Additionally, the present description is in no way limited to implementation in any specific operating system or environment.


The subject matter described in this specification can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer readable medium for execution by, or to control the operation of, data processing apparatus. The instructions can be organized into modules (or engines) in different numbers and combinations from the exemplary modules described. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. A propagated signal is an artificially generated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.


While this specification contains many specifics, these should not be construed as limitations on the scope of what can be claimed, but rather as descriptions of features specific to particular implementations of the subject matter. Certain features that are described in this specification in the context of separate embodiments may also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.


Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.


The subject matter of this specification has been described in terms of particular embodiments, but other embodiments can be implemented and are within the scope of the following claims. For example, the actions recited in the claims can be performed in a different order and still achieve desirable results. As one example, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous. Other variations are within the scope of the following claims.

Claims
  • 1. A method comprising: identifying an item for segmented backup according to one or more specified criteria, the criteria including a size of the item or a change frequency of the item;performing a first backup of the item using one or more computing devices, including: separating the item into a plurality of first parts prior to backing up the item, andseparately storing each part,where separating the item into a plurality of first parts includes identifying first parts of the item to be separated according to a segmentation criteria, the segmentation criteria associated with a data structure of the item where the segmentation criteria is unrelated to an available number of storage devices, where separating the item into a plurality of first parts includes identifying the first parts according to functional areas of the data structure of the item; andperforming a second backup of the item, including: identifying changed data in the item relative to the first backup;separating the changed data into a plurality of second parts; andstoring the changed item data of the plurality of second parts without storing the unchanged data of the item.
  • 2. The method of claim 1, where identifying the item for segmented backup comprises: determining whether a size of the item exceeds a specified threshold; ordetermining whether the item has been changed within a specified time.
  • 3. The method of claim 1, where performing the first backup of the item further comprises: generating an index where the index includes information for assembling the plurality of first parts.
  • 4. The method of claim 2, where performing the second backup of the item further comprises: generating an updated index, where the updated index includes information for assembling the plurality of first parts and the second parts of the item.
  • 5. The method of claim 1, where performing the second backup of the item further comprises: generating links associating file system representations of the unchanged parts of the item in the second back up with corresponding first parts in the first backup of the item.
  • 6. The method of claim 1, where the item is a mail database.
  • 7. The method of claim 1, where the first parts are stored on a single storage device.
  • 8. The method of claim 1, where separating the item into a plurality of first parts includes identifying first parts according to how frequently portions of the data in the item change.
  • 9. The method of claim 1, where the second parts are stored in addition to the first parts.
  • 10. A computer program product, encoded on a non-transitory computer-readable medium, operable to cause data processing apparatus to perform operations comprising: identifying an item for segmented backup according to one or more specified criteria, the criteria including a size of the item or a change frequency of the item;performing a first backup of the item including: separating the item into a plurality of first parts prior to backing up the item, andseparately storing each part,where separating the item into a plurality of first parts includes identifying first parts of the item to be separated according to a segmentation criteria, the segmentation criteria associated with a data structure of the item where the segmentation criteria is unrelated to an available number of storage devices, where separating the item into a plurality of first parts includes identifying the first parts according to functional areas of the data structure of the item; andperforming a second backup of the item, including: identifying changed data in the item relative to the first backup;separating the changed data into a plurality of second parts; andstoring the changed item data of the plurality of second parts without storing the unchanged data of the item.
  • 11. The computer program product of claim 10, where separating the item into a plurality of first parts includes identifying first parts according to how frequently portions of the data change.
  • 12. The computer program product of claim 10, where identifying the item for segmented backup comprises: determining whether a size of the item exceeds a specified threshold; ordetermining whether the item has been changed within a specified time.
  • 13. The computer program product of claim 10, where performing the first backup of the item further comprises: generating an index where the index includes information for assembling the plurality of first parts.
  • 14. The computer program product of claim 12, where performing the second backup of the item further comprises: generating an updated index, where the updated index includes information for assembling the plurality of first parts and the second parts of the item.
  • 15. The computer program product of claim 10, where performing the second backup of the item further comprises: generating links associating file system representations of the unchanged parts of the item in the second back up with corresponding first parts in the first backup of the item.
  • 16. The computer program product of claim 10, where the item is a mail database.
  • 17. The computer program product of claim 10, where the first parts are stored on a single storage device.
  • 18. The computer program product of claim 10, where the second parts are stored in addition to the first parts.
  • 19. A system comprising: one or more processors; anda non-transitory computer-readable medium including one or more sequences of instructions which, when executed by the one or more processors, causes:identifying an item for segmented backup according to one or more specified criteria, the criteria including a size of the item or a change frequency of the item;performing a first backup of the item using one or more computing devices, including: separating the item into a plurality of first parts prior to backing up the item, andseparately storing each part,where separating the item into a plurality of first parts includes identifying first parts of the item to be separated according to a segmentation criteria, the segmentation criteria associated with a data structure of the item where the segmentation criteria is unrelated to an available number of storage devices, where separating the item into a plurality of first parts includes identifying the first parts according to functional areas of the data structure of the item; andperforming a second backup of the item, including: identifying changed data in the item relative to the first backup;separating the changed data into a plurality of second parts; andstoring the changed item data of the plurality of second parts without storing the unchanged data of the item.
  • 20. The system of claim 19, where the instructions that cause identifying the item for segmented backup comprise instructions that cause: determining whether a size of the item exceeds a specified threshold; or determining whether the item has been changed within a specified time.
  • 21. The system of claim 19, where the instructions that cause performing the first backup of the item further comprise instructions that cause: generating an index where the index includes information for assembling the plurality of first parts.
  • 22. The system of claim 20, where the instructions that cause performing the second backup of the item further comprise instructions that cause: generating an updated index, where the updated index includes information for assembling the plurality of first parts and the second parts of the item.
  • 23. The system of claim 19, where the instructions that cause performing the second backup of the item further comprise instructions that cause: generating links associating file system representations of the unchanged parts of the item in the second back up with corresponding first parts in the first backup of the item.
  • 24. The system of claim 19, where the item is a mail database.
  • 25. The system of claim 19, where the first parts are stored on a single storage device.
  • 26. The system of claim 19, where the instructions that cause separating the item into a plurality of first parts include instructions that cause identifying first parts according to how frequently portions of the data in the item change.
  • 27. The system of claim 19, where the second parts are stored in addition to the first parts.
US Referenced Citations (238)
Number Name Date Kind
5150473 Zulch Sep 1992 A
5163148 Walls Nov 1992 A
5276867 Kenley et al. Jan 1994 A
5349658 O'Rourke et al. Sep 1994 A
5369570 Parad Nov 1994 A
5664186 Bennett et al. Sep 1997 A
5680562 Conrad et al. Oct 1997 A
5736974 Selker Apr 1998 A
5745669 Hugard et al. Apr 1998 A
5754178 Johnston et al. May 1998 A
5758359 Saxon May 1998 A
5790120 Lozares et al. Aug 1998 A
5818936 Mashayekhi Oct 1998 A
5819032 De Vries et al. Oct 1998 A
5819292 Hitz et al. Oct 1998 A
5831617 Bhukhanwala Nov 1998 A
5832526 Schuyler Nov 1998 A
5961605 Deng et al. Oct 1999 A
5987566 Vishlitzky et al. Nov 1999 A
6006227 Freeman et al. Dec 1999 A
6023506 Ote et al. Feb 2000 A
6097313 Takahashi et al. Aug 2000 A
6112318 Jouppi et al. Aug 2000 A
6167532 Wisecup Dec 2000 A
6188405 Czerwinski et al. Feb 2001 B1
6269381 St. Pierre et al. Jul 2001 B1
6366988 Skiba et al. Apr 2002 B1
6396500 Qureshi et al. May 2002 B1
6397308 Ofek et al. May 2002 B1
6424626 Kidambi et al. Jul 2002 B1
6460055 Midgley et al. Oct 2002 B1
6604118 Kleiman et al. Aug 2003 B2
6625704 Winokur Sep 2003 B2
6629129 Bookspan et al. Sep 2003 B1
6636937 Peter Oct 2003 B2
6638313 Freeman et al. Oct 2003 B1
6711572 Zakharov et al. Mar 2004 B2
6714201 Grinstein et al. Mar 2004 B1
6714952 Dunham et al. Mar 2004 B2
6725427 Freeman et al. Apr 2004 B2
6728735 Fong Apr 2004 B1
6768999 Prager et al. Jul 2004 B2
6785751 Connor Aug 2004 B1
6785786 Gold et al. Aug 2004 B1
6857001 Hitz et al. Feb 2005 B2
6892211 Hitz et al. May 2005 B2
6901493 Maffezzoni May 2005 B1
6918124 Novik et al. Jul 2005 B1
6948039 Biessener et al. Sep 2005 B2
6959368 St. Pierre et al. Oct 2005 B1
7072916 Lewis et al. Jul 2006 B1
7099900 Bromley et al. Aug 2006 B1
7103740 Colgrove et al. Sep 2006 B1
7111136 Yamagami Sep 2006 B2
7133902 Saha et al. Nov 2006 B2
7155486 Aoshima et al. Dec 2006 B2
7174352 Kleiman et al. Feb 2007 B2
7185028 Lechner Feb 2007 B2
7200617 Kibuse Apr 2007 B2
7222194 Kano et al. May 2007 B2
7318134 Oliveira et al. Jan 2008 B1
7386801 Horvitz et al. Jun 2008 B1
7418619 Uhlmann et al. Aug 2008 B1
7434177 Ording et al. Oct 2008 B1
7440125 Maekawa et al. Oct 2008 B2
7483693 Lueng et al. Jan 2009 B2
7505762 Onyon et al. Mar 2009 B2
7518611 Boyd et al. Apr 2009 B2
7558930 Kitamura et al. Jul 2009 B2
7590668 Kathuria et al. Sep 2009 B2
7624133 Ojalvo Nov 2009 B1
7630021 Matsuzaka et al. Dec 2009 B2
7660817 Smith et al. Feb 2010 B2
7669141 Pegg Feb 2010 B1
7676689 Shioyama et al. Mar 2010 B1
7711771 Kirnos May 2010 B2
7734594 Wang Jun 2010 B2
7809687 Cisler et al. Oct 2010 B2
7809688 Cisler et al. Oct 2010 B2
7853566 Cisler et al. Dec 2010 B2
7853567 Cisler et al. Dec 2010 B2
7856424 Cisler et al. Dec 2010 B2
7860839 Cisler et al. Dec 2010 B2
7934064 Per et al. Apr 2011 B1
8010900 Hart et al. Aug 2011 B2
8099392 Paterson et al. Jan 2012 B2
8166415 Cisler et al. Apr 2012 B2
8229897 Cannon et al. Jul 2012 B2
20010047368 Oshinsky et al. Nov 2001 A1
20020023198 Kokubun et al. Feb 2002 A1
20020046220 Freeman et al. Apr 2002 A1
20020054158 Asami May 2002 A1
20020063737 Feig et al. May 2002 A1
20020080180 Mander et al. Jun 2002 A1
20020156921 Dutta et al. Oct 2002 A1
20020160760 Aoyama Oct 2002 A1
20020174283 Lin Nov 2002 A1
20030016248 Hayes Ubillos Jan 2003 A1
20030018878 Dorward et al. Jan 2003 A1
20030050940 Robinson Mar 2003 A1
20030063128 Salmimaa et al. Apr 2003 A1
20030065687 Momiji et al. Apr 2003 A1
20030097640 Abrams et al. May 2003 A1
20030122874 Dieberger et al. Jul 2003 A1
20030126247 Strasser et al. Jul 2003 A1
20030131007 Schirmer et al. Jul 2003 A1
20030135650 Kano et al. Jul 2003 A1
20030137540 Klevenz et al. Jul 2003 A1
20030167380 Green Sep 2003 A1
20030172937 Faries et al. Sep 2003 A1
20030195903 Manley et al. Oct 2003 A1
20030220949 Witt et al. Nov 2003 A1
20040066414 Czerwinski et al. Apr 2004 A1
20040073560 Edwards Apr 2004 A1
20040078641 Fleischmann Apr 2004 A1
20040088331 Therrien et al. May 2004 A1
20040117459 Fry Jun 2004 A1
20040125137 Stata et al. Jul 2004 A1
20040133575 Farmer et al. Jul 2004 A1
20040139396 Gelernter et al. Jul 2004 A1
20040143652 Grannan et al. Jul 2004 A1
20040163009 Goldstein et al. Aug 2004 A1
20040167942 Oshinsky et al. Aug 2004 A1
20040175000 Caronni Sep 2004 A1
20040193953 Callahan et al. Sep 2004 A1
20040199826 Bertram et al. Oct 2004 A1
20040210608 Lee et al. Oct 2004 A1
20040220980 Forster Nov 2004 A1
20040228493 Ma Nov 2004 A1
20040235523 Schrire et al. Nov 2004 A1
20040236769 Smith et al. Nov 2004 A1
20040236916 Berkowitz et al. Nov 2004 A1
20040267700 Dumais et al. Dec 2004 A1
20050010955 Elia et al. Jan 2005 A1
20050071390 Midgley et al. Mar 2005 A1
20050091596 Anthony et al. Apr 2005 A1
20050102695 Musser May 2005 A1
20050108253 Metsatahti et al. May 2005 A1
20050138081 Alshab et al. Jun 2005 A1
20050144135 Juarez et al. Jun 2005 A1
20050149577 Okada et al. Jul 2005 A1
20050165867 Barton et al. Jul 2005 A1
20050187992 Prahlad et al. Aug 2005 A1
20050204186 Rothman et al. Sep 2005 A1
20050216527 Erlingsson Sep 2005 A1
20050246398 Barzilai et al. Nov 2005 A1
20050262168 Helliker et al. Nov 2005 A1
20050262377 Sim-Tang Nov 2005 A1
20060026218 Urmston Feb 2006 A1
20060041603 Paterson et al. Feb 2006 A1
20060041823 Wolfgang et al. Feb 2006 A1
20060053332 Uhlmann et al. Mar 2006 A1
20060064444 van Ingen et al. Mar 2006 A1
20060064634 Dettinger et al. Mar 2006 A1
20060080521 Barr et al. Apr 2006 A1
20060085792 Traut Apr 2006 A1
20060085817 Kim et al. Apr 2006 A1
20060101384 Sim-Tang et al. May 2006 A1
20060106893 Daniels et al. May 2006 A1
20060117309 Singhal et al. Jun 2006 A1
20060137010 Kramer et al. Jun 2006 A1
20060143250 Peterson et al. Jun 2006 A1
20060156246 Williams et al. Jul 2006 A1
20060161861 Holecek et al. Jul 2006 A1
20060218363 Palapudi Sep 2006 A1
20060248294 Nedved et al. Nov 2006 A1
20060253470 Friedman et al. Nov 2006 A1
20070027935 Haselton et al. Feb 2007 A1
20070030528 Quaeler et al. Feb 2007 A1
20070038884 Campbell et al. Feb 2007 A1
20070043790 Kryger Feb 2007 A1
20070070066 Bakhash Mar 2007 A1
20070078910 Bopardikar Apr 2007 A1
20070088702 Fridella et al. Apr 2007 A1
20070094312 Sim-Tang Apr 2007 A1
20070106978 Felts May 2007 A1
20070136381 Cannon et al. Jun 2007 A1
20070136389 Bergant et al. Jun 2007 A1
20070156772 Lechner Jul 2007 A1
20070168497 Locker et al. Jul 2007 A1
20070185879 Roublev et al. Aug 2007 A1
20070185922 Kapoor et al. Aug 2007 A1
20070192386 Fries et al. Aug 2007 A1
20070266007 Arrouye et al. Nov 2007 A1
20070271263 Merrild Nov 2007 A1
20070271303 Menendez et al. Nov 2007 A1
20070288536 Sen et al. Dec 2007 A1
20080016576 Ueda et al. Jan 2008 A1
20080022393 Waltermann et al. Jan 2008 A1
20080028007 Ishii et al. Jan 2008 A1
20080033922 Cisler et al. Feb 2008 A1
20080033969 Koo et al. Feb 2008 A1
20080034004 Cisler et al. Feb 2008 A1
20080034011 Cisler et al. Feb 2008 A1
20080034013 Cisler et al. Feb 2008 A1
20080034016 Cisler et al. Feb 2008 A1
20080034017 Giampaolo et al. Feb 2008 A1
20080034018 Cisler et al. Feb 2008 A1
20080034019 Cisler et al. Feb 2008 A1
20080034039 Cisler et al. Feb 2008 A1
20080059894 Cisler et al. Mar 2008 A1
20080065663 Farlee et al. Mar 2008 A1
20080070496 Jackson Mar 2008 A1
20080077808 Teicher et al. Mar 2008 A1
20080082578 Hogue et al. Apr 2008 A1
20080091655 Gokhale et al. Apr 2008 A1
20080126441 Giampaolo et al. May 2008 A1
20080126442 Cisler et al. May 2008 A1
20080141029 Culver Jun 2008 A1
20080168184 Freedman et al. Jul 2008 A1
20080168245 De Atley et al. Jul 2008 A1
20080168391 Robbin et al. Jul 2008 A1
20080177961 McSharry et al. Jul 2008 A1
20080208630 Fors et al. Aug 2008 A1
20080214163 Onyon et al. Sep 2008 A1
20080216011 Gould Sep 2008 A1
20080229037 Bunte et al. Sep 2008 A1
20080250342 Clark et al. Oct 2008 A1
20080285754 Kezmann Nov 2008 A1
20080307000 Paterson et al. Dec 2008 A1
20080307017 Lyons et al. Dec 2008 A1
20080307019 Weiss et al. Dec 2008 A1
20080307020 Ko et al. Dec 2008 A1
20080307175 Hart et al. Dec 2008 A1
20080307333 McInerney et al. Dec 2008 A1
20080307347 Cisler et al. Dec 2008 A1
20080310633 Brown et al. Dec 2008 A1
20090254591 Weiss et al. Oct 2009 A1
20090307333 Welingkar et al. Dec 2009 A1
20100017855 Johnson et al. Jan 2010 A1
20100217929 Kirshenbaum et al. Aug 2010 A1
20110016089 Freedman et al. Jan 2011 A1
20110083088 Cisler et al. Apr 2011 A1
20110083098 Cisler et al. Apr 2011 A1
20110087976 Cisler et al. Apr 2011 A1
20110302502 Hart et al. Dec 2011 A1
20120124507 Paterson et al. May 2012 A1
20120198383 Cisler et al. Aug 2012 A1
Foreign Referenced Citations (7)
Number Date Country
0629950 Dec 1994 EP
1152352 Nov 2001 EP
1582982 Oct 2005 EP
0106356 Jan 2001 WO
02101540 Dec 2002 WO
2005045756 May 2005 WO
2008019237 Feb 2008 WO
Non-Patent Literature Citations (33)
Entry
“Apple Previews Mac OS X Leopard,” Aug. 7, 2006 [online] [retrieved on Nov. 26, 2007] Retrieved from the Internet:<URL:http://www.apple.com/pr/library/2006/aug/07leopard.html>, pp. 1-2.
“Aulaclic: Unit 6. The Recycle Bin,” Nov. 2005 [online] [retrieved on Nov. 26, 2007] Retrieved from the Internet:<URL:http://www.teacherclick.com/winxp/t—6—1.htm>, pp. 1-2.
Bonwick, Jeff, “ZFS the Last Word in File Systems,” [online] [retrieved on Jan. 22, 2008] Retrieved from the Internet:<URL:http://opensolaris.org/os/community/zfs/docs/zfs.pdf>, 34 pages.
Bonwick et al., “The Zettabyte File System,” [online] [retrieved on Jan. 22, 2008] Retrieved from the Internet:<URL:http://partneradvantage.sun.com/protected/solaris10/adoptionkit/tech/zfs/zfs—overview.pdf>, 13 pages.
Griffiths, R., “Leopard first looks: Time Machine,” Aug. 8, 2006 [online] [retrieved on Nov. 23, 2007] Retrieved from the Internet:<URL:http://www.macworld.com/2006/08/firstlooks/leotimemac/index.php?pf=1> pp. 1-2.
International Search Report and Written Opinion, PCT/US2007/074729, Jul. 12, 2007, 11 pages.
International Search Report and Written Opinion, PCT/US2007/074881, Jul. 12, 2007, 11 pages.
Sun Microsystems, Inc., “ZFS On-Disk Specification,” Draft: Dec. 9, 2005, [online] [retrieved on Jan. 22, 2008] Retrieved from the Internet:<URL:http://opensolaris.org/os/community/zfs/docs/ondiskformat0822.pdf,>, 55 pages.
Tittel, Ed. “An EAZ Way to Restore Crippled and Inoperable Systems.” ChannelWeb. Apr. 25, 2005. http://www.crn.com/white-box/161502165.
“What's New in Word 2002.” Wellesly College Information Services Computing Documentation, Jan. 2002, http://www.wellesley.edu/Computing/Office02/Word02/word02.html. Accessed 812/2008.
International Search Report and Written Opinion, PCT/US2007/074653, Aug. 14, 2008, 14 pages.
International Search Report and Written Opinion, PCT/US2008/065146, Oct. 31, 2008, 21 pages.
Bott, Ed, “Windows XP Backup Made Easy,” Jul. 14, 2003, Microsoft.
Engst, Adam, “Retrospect 6.0: Powerful Backup Program Adds Panther Compatibility and Enterprise Features”, Jun. 1, 2004, MacWorld.
Harder, Bobbie, “Microsoft Windows XP System Restore,” Apr. 2001, MSDN.
“MSDN Academic Alliance Developer Center, Curriculum Repository Glossary,” [online]. Retrieved from the Internet <URL: http://www.academicresourcecenter.net/curriculum/glossary.aspx>, retrieved on Apr. 22, 2009, 4 pages.
“StorageSync: Backup, Restore, & Synchronization Software User's Guide”, SimpleTech, 2003.
International Search Report and Written Opinion, PCT/US2008/066212, Mar. 9, 2009, 26 pages.
International Search Report and Written Opinion, PCT/US2007/074863 Apr. 21, 2009, 20 pages.
Communication pursuant to Article 94(3) EPC for Application No. EP 07 799 899.5, dated May 14, 2009, 2 pages.
“How to Interpret Windows Installer Logs,” [Online] [Retrieved on Dec. 12, 2009] Retrieved from the Internet URL: http://blogs.technet.com/richard—macdonald/archive/2007/04/02/How-to-Interpret-Windows-Installer-Logs.aspx; published Apr. 4, 2007; 6 pages.
Posey, Brien M., “Working with the Windows Server 2003 Volume Shadow Copy Service”. Published Jun. 24, 2004. http://www.windowsnetworking.com/articles—tutorials/Windows-Server-2003-Volume-Shadow-Copy-Service.html.; 11 pages.
Communication pursuant to Article 94(3) EPC for Application No. EP 07 799 899.5, dated Oct. 7, 2009, 4 pages. (0040EP1).
Microsoft-TechNet, “Using Encrypting File System,” Nov. 3, 2005, Microsoft, 40 pages.
In-link files, The Open Group Base, Specifications Issue 6 [online]. IEEE Std 1003.1, 2004 Edition. [retrieved on Apr. 6, 2011]. Retrieved from the Internet:URL:http://pubs.opengroup.org/onlinepubs/009695399/utilities/In.html, 5 pages.
Godfrey, Michael et al., “Using Original Analysis to Detect Merging and Splitting of Source Code Entities,” IEEE Transactions on Software Engineering, vol. 31, No. 2. Feb. 2005. pp. 166-181.
Extended European Search Report, European Application No. 11184579.8, Nov. 17, 2011, 6 pages.
Office Action dated Feb. 29, 2012 from related Chinese Application No. 200880024710.0, 11 pages.
Microsoft Technet: “Restore a previous version of a file,” Jan. 21, 2005, [Online] [Retrieved on Oct. 20, 2011] Retrieved from the Internet URL: http://technet.microsoft.com/en-us/library/cc778220(d=printer,v=WS.10).aspx , pp. 1-2.
Extended International Search Report and Written Opinion, EP 11171738.5, Aug. 29, 2011, 5 pages.
Examination Report from European Application No. 07 813 605.8 dated Oct. 27, 2011, 5 pages.
Examination Report from European Application No. 07 813 540.7 dated Oct. 27, 2011, 5 pages.
Communication pursuant to Article 94(3) EPC for Application No. EP 07 813 540.7, dated Jun. 23, 2009, 2 pages.
Related Publications (1)
Number Date Country
20080307018 A1 Dec 2008 US