A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosures, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.
This application is related to the following pending applications:
The invention disclosed herein relates generally to object archiving and retrieval in computer systems.
Electronic mail (e-mail) has increasingly become a common and accepted manner of exchanging messages for individuals both at home and in the workplace. Indeed, some e-mail users send and receive hundreds or even thousands of messages each day. Managing this large volume of message traffic, however, has become a problem for both individual users and network administrators.
When messages are sent and received by a mail application, they are stored for review in folders which are typically part of a file commonly referred to as an e-mail information store (“IS”) that is designated to hold e-mail stored on the user's local computer or on a network storage device. Other types of applications such as directory services applications also have information stores which contain data specific to particular applications.
Over time, the IS typically grows in size as the user continues to receive and send more e-mail. This constantly increasing growth is problematic. Unless steps are periodically taken to reduce its size, the IS will eventually grow so large that it will use considerable amounts of disk space and also require excessive system resources to access its information. To keep the size of the IS under control and optimize system performance, administrators and users of e-mail systems have had to either delete or archive old or unwanted messages to release disk space. Both of these methods have serious drawbacks.
One problem associated with archiving old messages is that the archived messages are normally stored on the user's workstation in file formats such as .PST files which are difficult to manage. All references to individual messages archived to .PST files no longer appear in the inbox and these individual messages are no longer readily accessible by browsing the e-mail client GUI. In order to review individual archived messages, users must know which archive contains their message and must open the individual archive containing the message before being able to access the message contents. This process is often time-consuming with users frequently resorting to trial-and-error methods of opening archives to locate desired messages.
Deleting old or unwanted messages is an even less desirable solution than archiving such messages. While archive files are difficult to manage and to retrieve messages from, deleting old or unwanted messages makes management and retrieval even more difficult and frequently impossible. If the user has performed a system backup prior to deleting such messages, retrieval is sometimes still possible, but the user must then restore the entire the entire system from the backup to retrieve the messages. In the worst case, the messages are simply lost forever when they are deleted.
Further, even in a networked environment with a central e-mail sever such as, for example, a Microsoft Exchange Server, which contains a central IS, the normal backup process will also not directly help cut down the size of the IS. Backing up the IS will still leave all of the messages in the IS unless the individual users delete or archive messages at their workstations.
There is thus a need for a system which permits users to easily manage archiving and retrieving e-mail messages.
In addition, similar problems relating to archiving of old or unwanted objects exist in other directory services applications such as Microsoft's Active Directory, the University of Michigan's LDAP Servers, Lotus Notes, Microsoft's Sharepoint Portal, and other similar applications. In each of these applications, there exists a database similar to the Exchange IS which is constantly growing over time. System administrators must decide how much data in these databases is actually needed, how much should be archived, etc. One problem with archiving an entire directory services application database is that on restore, the entire database generally needs to be shut down even if only a small portion of the database needs to be restored. More single file restores are done than full system restores which results in inefficient use of system resources among other problems. There is thus also a need for a system which permits users to easily manage archiving and retrieving directory services and other similar application objects.
The present invention addresses the problems discussed above with the management of archiving and retrieving application specific archiving and retrieval.
In accordance with some aspects of the present invention, computerized methods are provided for archiving data, the methods comprising identifying, in a first information store, a first data item satisfying a retention criterion; copying the first data item from the first information store to a second information store; creating, in the first information store, a second data item containing a subset of the data of the first data item selected based on the data type of the first data item; and replacing the first data item, in the first information store, with the second data item. In some embodiments, the first data item may comprise an electronic mail message, an attachment to an electronic mail message, a directory services entry, or other data objects.
The retention criteria is a property or characteristic of the first data item used by the invention to select the first data item for archiving and other purposes. In some embodiments, the retention criterion comprises a first creation date and identifying the first data item comprises comparing a first creation date of the first data item to the creation date specified as the retention criteria. In some embodiments, the retention criterion comprises a last accessed date and identifying the first data item comprises comparing a last accessed date of the first data item to the last accessed date specified as the retention criteria. In some embodiments, the retention criterion comprises an item size and identifying the first data item comprises comparing an item size of the first data item to the item size specified as the retention criteria.
In some embodiments, the first information store may comprise an electronic mail information store, a directory services information store, or other type of information store. In some embodiments, the second information store is a secondary storage device. In some embodiments, the second data item contains index information identifying a location of the first data item in the second information store.
In some embodiments, the second data item may comprise an electronic mail message, a directory services entry, or other type of data object. In some embodiments, the second data item contains header fields of the first data item which may include, for example, in the case of an electronic mail message, a sender field, a recipient field, a subject field, a date field, and a time field. In some embodiments, the second data item contains a subset of the message body of the first data item. In some embodiments, the second data item contains a message body specified by a user. In some embodiments, replacing the first data item comprises deleting the first data item from the first information store.
In one embodiment, the invention provides a system for archiving data, the system comprising a first information store containing one or more data items; a second information store; and a computer, connectable to the first information store and the second information store; wherein the computer is programmed to identify, in the first information store, a first data item satisfying a retention criteria; to copy the first data item to the second information store; to create, in the first information store, a second data item containing a subset of the data of the first data item selected based on the data type of the first data item; and to replace the first data item from the first information store. In some embodiments, the computer is programmed to identify an electronic mail message, an attachment to an electronic mail message, a directory services entry, and combinations thereof. In some embodiments, the computer is programmed to replace the first data item from the first information store by deleting the first data item.
In one embodiment, the invention provides a computer usable medium storing program code which, when executed on a computerized device, causes the computerized device to execute a computerized method for archiving data, the method comprising identifying, in a first information store, a first data item satisfying a retention criterion; copying the first data item from the first information store to a second information store; creating, in the first information store, a second data item containing a subset of the data of the first data item selected based on the data type of the first data item; and replacing the first data item, in the first information store, with the second data item.
In one embodiment, the invention provides a system for archiving data comprising a plurality of application-specific data agents each configured to coordinate archiving of first data items used in a particular software application; and a plurality of application-specific stubbing modules each functionally integrated with a corresponding application-specific data agent, each stubbing module being configured to replace a first data item used in the corresponding software application with a second data item used in the corresponding software application and representing a subset of the first data item.
The invention is illustrated in the figures of the accompanying drawings which are meant to be exemplary and not limiting, in which like references are intended to refer to like or corresponding parts, and in which:
Embodiments of methods and systems according to the present invention are described through references to
A data agent 105 is a software module that is generally responsible for archiving, migrating, and recovering data of a client computer 107. Each client computer 107 has at least one data agent 105 and the system can support many client computers 107. The system provides a plurality of data agents 105 each of which is intended to backup, migrate, and recover data associated with a different application. For example, different individual data agents 105 maybe designed to handle Microsoft Exchange data, Lotus Notes data, Microsoft Windows 2000 file system data, Microsoft Active Directory Objects data, and other types of data known in the art. If a client computer 107 has two or more types of data, one data agent 105 is required for each data type to archive, migrate, and restore the client computer 107 data. For example, to backup, migrate, and restore all of the data on a Microsoft Exchange 2000 server, the client computer 107 would use one Microsoft Exchange 2000 Mailbox data agent 105 to backup the Exchange 2000 mailboxes, one Microsoft Exchange 2000 Database data agent 105 to backup the Exchange 2000 databases, one Microsoft Exchange 2000 Public Folder data agent 105 to backup the Exchange 2000 Public Folders, and one Microsoft Windows 2000 File System data agent 105 to backup the client computer's 107 file system. These data agents 105 are addressed as four separate data agents 105 by the system even though they reside on the same client computer 107.
The data stubbing module 109 is a component of the media agent that performs stubbing operations on data items as further described herein.
A media agent 110 conducts data between the client computer 107 and one or more storage libraries 115 such as a tape library or other storage device. The media agent 110 is communicatively coupled with and controls the storage library 115. For example, the media agent 110 might instruct the storage library 115 to use a robotic arm or other means to load or eject a media cartridge, and to archive, migrate, or restore application specific data. The media agent 110 generally communicates with the storage library 115 via a local bus such as a SCSI adaptor. In some embodiments, the storage library 115 is communicatively coupled to the data agent 110 via a Storage Area Network (“SAN”).
Each media agent 110 maintains an index cache 120 which stores index data the system generates during backup, migration, and restore storage operations as further described herein. For example, storage operations for Microsoft Exchange data generate index data. Index data is useful because it provides the system with an efficient mechanism for locating user files for recovery operations. Although this index data is generally stored with the data backed up to the storage library 115, the media agent 110 that controls the storage operation also writes an additional copy of the index data to its index cache 120. The data in the index cache 120 is thus readily available to the system for use in storage operations and other activities without having to be first retrieved from the storage library 115.
Each index cache 120 typically resides on the corresponding media agent's 110 hard disk or other fixed storage device. Like any cache, the index cache 120 has finite capacity and the amount of index data that can be maintained directly corresponds to the size of that portion of the disk that is allocated to the index cache 120. In one embodiment, the system manages the index cache 120 on a least recently used (“LRU”) basis as known in the art. When the capacity of the index cache 120 is reached, the system overwrites those files in the index cache 120 that have been least recently accessed with the new index data. In some embodiments, before data in the index cache 120 is overwritten, the data is copied to the index cache 120 copy in the storage library 115. If a recovery operation requires data that is no longer stored in the index cache 120 such as in the case of a cache miss, the system recovers the index data from the index cache 120 copy stored in the storage library 120.
The storage manager 125 is a software module or application that coordinates and controls the system. The storage manager 125 communicates with all elements of the system including media agents 110, client computers 107, and data agents 105 to initiate and manage system backups, migrations, and recoveries.
In some embodiments, components of the system may reside and execute on the same computer. In some embodiments, a client computer 107 component such as a data agent 105, a media agent 110, or a storage manager 125 coordinates and directs local archiving, migration, and retrieval application functions as further described in application Ser. No. 09/610,738. This client computer 107 component can function independently or together with other similar client computer 107 components.
The archive process filters and archives those messages, objects, or other data items in a first information store 108 according to specified retention criteria, step 135. In some embodiments, the retention criteria may be input directly by a user when the archive job is started. In other embodiments, the retention criteria may be pre-defined or calculated automatically according to user preferences or other information and the archive job proceeds autonomously. Those messages, objects, or other data items that fulfill the specified retention criteria are copied from the first information store 108 to a second information store. In some embodiments, the second information store is located on secondary storage media such as a storage library 115.
A stubbing process creates a stub for and deletes each message in the first information store 108 that was copied to the second information store, step 140. As used herein, stubs are data objects that replace messages, objects, and other data items in the first information store 108 that were copied to the second information store. Copying the messages to the second information store frees storage space in the first information store 108. Stubs that replace the copied messages generally require less storage space and indicate which items were copied and deleted from the first information store 108. Stubs also facilitate retrieval of messages that were copied to the second information store.
When all items in the first information store 108 have been archived and stubbed or when directed by a user, the job ends, step 145.
As previously described herein, archive jobs can either be started manually as directed by a user or automatically as a scheduled system management task. In some embodiments, archive jobs may take place according to schedule policies as further described in application Ser. No. 09/882,438 which is incorporated herein by reference in its entirety. For example, a schedule policy may indicate that archive jobs should take place on a specified information store once per day at a particular hour or at other designated times. In some embodiments, the archiving process and stubbing process can also be scheduled at off-peak times to reduce the load to system resources.
The archive management daemon initiates an archiving process of the data agent 105, step 155, which archives messages, objects, or other data items in a first information store 108 according to specified retention criteria.
The archiving process scans an item in the first information store 108 to determine whether the item fulfills the retention criteria, step 160. For example, in an email information store, the archiving process scans the mailboxes in the IS 108 to find candidate messages or objects meeting either the default retention criteria, such as the retention criteria specified in a storage policy, or the retention criteria customized by the user.
As previously described, retention criteria define archiving rules for the archiving process to control the content of stubs, which messages, objects, or other data items get archived, the retention time for stubs and archived messages, objects, or other data items, and other similar filtration criteria. In one embodiment, messages, objects, and other data items are copied to secondary storage according to parameters such as job ID, times, etc. In other embodiments, retention criteria specify additional options to indicate whether a stub should be left behind or not, whether the entire message or object or just the attachment should be archived, and other similar choices. In some embodiments, retention criteria specify a mailbox size threshold and exclusion filter for mailbox(es) or folder(s), so that only mailboxes whose size exceed the threshold and are not in the filter list will be scanned. In some embodiments, retention criteria also specify rules based on message creation time, modification time, size, or attachment(s) to further control the message selection criteria. For example, messages in the IS 108 that satisfy certain retention criteria such as age, size, size of attachments, amount of disk space left, size of mailbox, etc. are archived to secondary storage 115.
Since stubs are usually new small messages or objects with no attachments, they can be difficult to remove from a users mailbox. To facilitate stub management among other things, retention criteria also define the lifetime of a stub in some embodiments. After a stub expires past its lifetime, the next archiving job will either delete the stub from the first information store 108 or archive the stub to secondary storage such as a storage library 115.
The size of index cache 120 may grow over time and in some embodiments, archive pruning-related retention criteria specifies that data should be pruned or deleted in the first information store 108 and also in the index cache 120. In some embodiments, retention criteria may also specify whether archived messages, objects, and other data items in secondary storage 115 should be pruned after additional time has passed or at any desired point.
In some embodiments, retention criteria specifies that there should be no orphan stubs left in the IS 108. In one embodiment, this goal among others is achieved by using retention times, such that stubs always expire before their related messages, objects, or other data items archived in secondary storage 115. In other embodiments, retention criteria specifies that items archived in secondary storage 115 are not pruned if a stub still exists in the first information store 108. In an alternate embodiment, archive pruning of secondary storage 115 items produces a pruned list stored in the index cache 115 or other information store and the system uses this list to then remove the related stubs remaining in the first information store 108. In some embodiments, however, retention criteria may permit messages archived in secondary storage to be pruned even if a related stub still exists in the first information store 108.
If the item scanned fulfills the retention criteria, step 165, the archiving process writes a copy of the message, object, or other data item to secondary storage 115, step 170, as further described in application Ser. No. 09/610,738 and application Ser. No. 09/609,977 which are incorporated herein by reference in their entirety. To make the restore process faster and to achieve other desirable goals, messages, objects, and other data items can first be archived on a magnetic library. Later these items can be moved to tape or some other storage media for long-term storage. In one embodiment, data may be moved from a magnetic library to tape or some other secondary storage media using auxiliary copy to further conserve system resources, and as described in Application No. 60/411,202, COMBINED STREAM AUXILIARY COPY SYSTEM AND METHOD, filed Sep. 16, 2002, which is incorporated herein by reference in its entirety.
Identifying characteristics and other information about the item copied to secondary storage 115 are recorded to an archiving list stored in a local information store of the data agent 105, step 175. During the archiving phase, a record detailing information about every item successfully copied from the first information store 108 to secondary storage 115 will be stored in the archiving list which serves as input and is used during the stubbing phase as further described herein. The content of items in the archiving list include information for the later stubbing phase and restore process to locate the original archived messages, objects, or other data items. Examples of such information include mailbox name, folder ID, message ID, and link information to the item's secondary storage location. An example of such link information is a Universal Naming Convention (“UNC”) path to the item's index entry in a Galaxy file system.
The system determines whether additional items remain in the first information store 108 to be scanned against the retention criteria, step 180. If additional items remain to be scanned, then control returns to step 160, and the process repeats. Otherwise, the archiving process terminates and the job manager then starts the archiving index phase writing the archive information to the index cache 115 on a media agent 110 or other component, step 185, as further described in application Ser. No. 09/610,738 which is hereby incorporated by reference in its entirety.
When the archiving index phase is complete, the media agent notifies the job manager which then initiates a stubbing process, step 190. The stubbing process retrieves the archiving list of messages, objects, or other data items created during the archiving process to use as input during the stubbing phase and sequentially processes each item on the archiving list, step 195. While the stubbing process could query the media agent 110 containing the index cache 115 created during the archiving index phase, this option is less desirable due to the network and processor resources required. A more desirable method, as described herein, combines archiving and stubbing into a single job in which the stubbing phase only starts after the archiving phase is successfully completed. In one embodiment, the stubbing phase processes items on the archiving list based on application ID, job status, and other criteria.
In some embodiments, before a stub is created, the system prompts for, step 200, and accepts, step 205, user input of text and other information to display or otherwise associate with a stub.
For each item on the archiving list, the stubbing process then creates a new “stub” message, object, or other data item in the first information store 108, step 210. Each new message has the same data structure as the original message, except the body field of the message is replaced with explanation text or other information indicating that the message is a stub, and a path linking to the archived message.
New stubs are generally created according to stub configuration options specified in the storage policy associated with the first information store 108. Stub configuration options include stub with no body or stub with full body, but no attachment, etc. The subject of the stub can be changed to incorporate a tag or other parsable identifier such as “<archived> original subject” so that subsequent archive operations can identify the stub. In some embodiments, there are also named properties in stubs. In some embodiments, stubs contain an ID and an archive time to assist backup systems such as Galaxy with stub management.
After each stub is successfully created, the stubbing process deletes the original message, step 215, and determines whether there are additional items to process on the archiving list, step 220. If additional items remain to be processed, control returns to step 195. Otherwise, once all messages, objects, and other data items on the archiving list have been processed, the stubbing process returns control to the job manager and the archiving job terminates, step 225.
Turning to
In one embodiment, items archived in secondary storage, such as the message body, can be restored by manually clicking on the UNC link 285 or other identifying path in the item's related stub. The stub message ID is encoded within the link 285. The media agent 210 or the data agent 205 detects the click, parses the message ID, and passes the ID as a parameter to the restore process, as further described herein.
If an archived e-mail message's corresponding stub is still in a mailbox or other browsable first information store 108, a user can search on the stubs' fields copied from the archived e-mail message including the sender 260, recipient 265, subject 270, time/date 275, and other identifying criteria to find the corresponding stub. In some embodiments, stubs with full bodies can also be located via full-text (index) searching functions of a mail server or other file system.
Sometimes, stubs will no longer be accessible via the first information store 108. For example, stubs may have been pruned or otherwise deleted. In another embodiment, the archived message can be selected via the archived message's index entry in a secondary storage file system such as in the Galaxy system. For example, if the user wants to restore an archived e-mail message whose corresponding stub has been pruned from the first information store 108 mailbox, the user can still restore the archived e-mail via a backup system console browser such as the Galaxy console browser.
As further described in application Ser. No. 09/610,738 and application Ser. No. 09/609,977 which are incorporated herein by reference in their entirety, selecting an item to restore triggers the media agent 210 mapped storage installable file system, and the media agent 210 sends a restore request to a job manager process on the media agent, step 235. The job manager on the media agent 210 starts a restore job using the information contained in the request and notifies a job manager process of the data agent 205, step 240. The job manager process of the data agent 205 creates a restore process which retrieves the archived message from the secondary storage library 115 returning it to the first information store 108, step 245. After the archived item is restored from secondary storage 115 and copied to the first information store 108, the item's corresponding stub is deleted from the first information store 108, step 250, and the job ends, step 255.
In some embodiments, users are prevented from modifying stubs since the restore process depends on special information contained in each stub to identify it as a stub and to restore the original message.
In one embodiment, if users are moved to another mail server having a different information store than the first information store 108, the system first restores all the stubbed messages, objects, and other data items back to the user's mailbox in the first information store 108, and then deletes all the stubs before the administrator is permitted to move the user. In some embodiments, this is accomplished as an integrated part of the system or as a separate process to scan the mailbox in the first information store 108, find all the stubs, pass the links to the media agent 119 to start a restore job, and then delete the stubs. In some embodiments, stubs contain application type, backup management system console information such as CommVault CommServer information, and other information which ensures compatibility and continued functionality of the invention if a user updates their mail server.
While the system has frequently been described above in the context of electronic mail object archiving, the system also archives and restores general directory services client objects for each entry that exists in a service such as Microsoft's Active Directory, the University of Michigan's LDAP Servers, Lotus Notes, Microsoft's Sharepoint Portal, and other similar applications. Attributes and properties of each archived service entry are retained in the corresponding stub. Client operations are performed using an interface such as the Windows LDAP API, which can interface with Active Directory, as well as any other LDAP compliant directory service. Similarly, the directory services client looks and behaves very much like an e-mail file system agent from a GUI standpoint with backup sets and sub-clients where default sub-clients backup the entire directory service and new sub-clients are defined to limit the scope of the backup. Filters specify retention criteria to archive certain branches of the directory tree, certain entries, and certain attributes. Each entry is stored in a separate file that adheres to the interface format, such as the LDIF (LDAP Data Interchange Format) format, which is an RFC standard format for listing the attributes of an entry.
Systems and modules described herein may comprise software, firmware, hardware, or any combination(s) of software, firmware, or hardware suitable for the purposes described herein. Software and other modules may reside on servers, workstations, personal computers, computerized tablets, PDAs, and other devices suitable for the purposes described herein. Software and other modules may be accessible via local memory, via a network, via a browser or other application in an ASP context, or via other means suitable for the purposes described herein. Data structures described herein may comprise computer files, variables, programming arrays, programming structures, or any electronic information storage schemes or methods, or any combinations thereof, suitable for the purposes described herein. User interface elements described herein may comprise elements from graphical user interfaces, command line interfaces, and other interfaces suitable for the purposes described herein. Screenshots presented and described herein can be displayed differently as known in the art to input, access, change, manipulate, modify, alter, and work with information.
While the invention has been described and illustrated in connection with preferred embodiments, many variations and modifications as will be evident to those skilled in this art may be made without departing from the spirit and scope of the invention, and the invention is thus not to be limited to the precise details of methodology or construction set forth above as such variations and modification are intended to be included within the scope of the invention.
This application is a continuation of U.S. patent application Ser. No. 13/250,349, filed Sep. 30, 2011, which is a continuation of U.S. patent application Ser. No. 12/252,897, filed Oct. 16, 2008, now U.S. Pat. No. 8,055,627, which is a continuation of U.S. application Ser. No. 11/497,546, filed Jul. 31, 2006, now U.S. Pat. No. 7,472,142, which is a continuation of U.S. application Ser. No. 10/260,209, filed Sep. 30, 2002, now U.S. Pat. No. 7,107,298, which claims priority from U.S. Provisional Patent Application No. 60/326,023, entitled “APPLICATION SPECIFIC OBJECT ARCHIVING AND RETRIEVAL SYSTEM”, filed Sep. 28, 2001, each of which is herein incorporated by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4464122 | Fuller et al. | Aug 1984 | A |
4686620 | Ng | Aug 1987 | A |
4995035 | Cole et al. | Feb 1991 | A |
5005122 | Griffin et al. | Apr 1991 | A |
5093912 | Dong et al. | Mar 1992 | A |
5133065 | Cheffetz et al. | Jul 1992 | A |
5193154 | Kitajima et al. | Mar 1993 | A |
5212772 | Masters | May 1993 | A |
5212784 | Sparks | May 1993 | A |
5226157 | Nakano et al. | Jul 1993 | A |
5239647 | Anglin et al. | Aug 1993 | A |
5241668 | Eastridge et al. | Aug 1993 | A |
5241670 | Eastridge et al. | Aug 1993 | A |
5276860 | Fortier et al. | Jan 1994 | A |
5276867 | Kenley et al. | Jan 1994 | A |
5287500 | Stoppani, Jr. | Feb 1994 | A |
5321816 | Rogan et al. | Jun 1994 | A |
5333315 | Saether et al. | Jul 1994 | A |
5347653 | Flynn et al. | Sep 1994 | A |
5386545 | Gombos, Jr. et al. | Jan 1995 | A |
5410700 | Fecteau et al. | Apr 1995 | A |
5448718 | Cohn et al. | Sep 1995 | A |
5448724 | Hayashi | Sep 1995 | A |
5485606 | Midgdey et al. | Jan 1996 | A |
5491810 | Allen | Feb 1996 | A |
5495607 | Pisello et al. | Feb 1996 | A |
5504873 | Martin et al. | Apr 1996 | A |
5517405 | McAndrew et al. | May 1996 | A |
5537568 | Yanai et al. | Jul 1996 | A |
5544345 | Carpenter et al. | Aug 1996 | A |
5544347 | Yanai et al. | Aug 1996 | A |
5555371 | Duyanovich et al. | Sep 1996 | A |
5559957 | Balk | Sep 1996 | A |
5564037 | Lam | Oct 1996 | A |
5608865 | Midgely et al. | Mar 1997 | A |
5613134 | Lucus et al. | Mar 1997 | A |
5619644 | Crockett et al. | Apr 1997 | A |
5634052 | Morris | May 1997 | A |
5638509 | Dunphy et al. | Jun 1997 | A |
5659614 | Bailey, III | Aug 1997 | A |
5666501 | Jones et al. | Sep 1997 | A |
5673381 | Huai et al. | Sep 1997 | A |
5673382 | Cannon et al. | Sep 1997 | A |
5699361 | Ding et al. | Dec 1997 | A |
5729743 | Squibb | Mar 1998 | A |
5740405 | DeGraaf | Apr 1998 | A |
5751997 | Kullick et al. | May 1998 | A |
5758359 | Saxon | May 1998 | A |
5758649 | Iwashita et al. | Jun 1998 | A |
5761677 | Senator et al. | Jun 1998 | A |
5764972 | Crouse et al. | Jun 1998 | A |
5778165 | Saxon | Jul 1998 | A |
5778395 | Whiting et al. | Jul 1998 | A |
5812398 | Nielsen | Sep 1998 | A |
5813009 | Johnson et al. | Sep 1998 | A |
5813017 | Morris | Sep 1998 | A |
5860073 | Ferrel et al. | Jan 1999 | A |
5864846 | Voorhees et al. | Jan 1999 | A |
5875478 | Blumenau | Feb 1999 | A |
5887134 | Ebrahim | Mar 1999 | A |
5896531 | Curtis et al. | Apr 1999 | A |
5901327 | Ofek | May 1999 | A |
5924102 | Perks | Jul 1999 | A |
5950205 | Aviani, Jr. | Sep 1999 | A |
5974563 | Beeler, Jr. | Oct 1999 | A |
5983239 | Cannon | Nov 1999 | A |
5991753 | Wilde | Nov 1999 | A |
6012053 | Pant et al. | Jan 2000 | A |
6021415 | Cannon et al. | Feb 2000 | A |
6026414 | Anglin | Feb 2000 | A |
6052735 | Ulrich et al. | Apr 2000 | A |
6064821 | Shough et al. | May 2000 | A |
6073128 | Pongracz et al. | Jun 2000 | A |
6076148 | Kedem | Jun 2000 | A |
6091518 | Anabuki et al. | Jul 2000 | A |
6094416 | Ying | Jul 2000 | A |
6131095 | Low et al. | Oct 2000 | A |
6131190 | Sidwell | Oct 2000 | A |
6148412 | Cannon et al. | Nov 2000 | A |
6154787 | Urevig et al. | Nov 2000 | A |
6161111 | Mutalik et al. | Dec 2000 | A |
6167402 | Yeager | Dec 2000 | A |
6182198 | Hubis et al. | Jan 2001 | B1 |
6212512 | Barney et al. | Apr 2001 | B1 |
6226759 | Miller et al. | May 2001 | B1 |
6239800 | Mayhew et al. | May 2001 | B1 |
6253217 | Dourish et al. | Jun 2001 | B1 |
6260069 | Anglin | Jul 2001 | B1 |
6266679 | Szalwinski et al. | Jul 2001 | B1 |
6266784 | Hsiao et al. | Jul 2001 | B1 |
6269431 | Dunham | Jul 2001 | B1 |
6275953 | Vahalia et al. | Aug 2001 | B1 |
6298439 | Beglin | Oct 2001 | B1 |
6301592 | Aoyama et al. | Oct 2001 | B1 |
6308175 | Lang et al. | Oct 2001 | B1 |
6324581 | Xu et al. | Nov 2001 | B1 |
6327590 | Chidlovskii et al. | Dec 2001 | B1 |
6327612 | Watanabe | Dec 2001 | B1 |
6328766 | Long | Dec 2001 | B1 |
6330570 | Crighton | Dec 2001 | B1 |
6330642 | Carteau | Dec 2001 | B1 |
6341287 | Sziklai | Jan 2002 | B1 |
6343287 | Kumar et al. | Jan 2002 | B1 |
6343324 | Hubis et al. | Jan 2002 | B1 |
6345288 | Reed et al. | Feb 2002 | B1 |
RE37601 | Eastridge et al. | Mar 2002 | E |
6356801 | Goodman et al. | Mar 2002 | B1 |
6363462 | Bergsten | Mar 2002 | B1 |
6367073 | Elledge | Apr 2002 | B2 |
6374363 | Wu et al. | Apr 2002 | B1 |
6389432 | Pothapragada et al. | May 2002 | B1 |
6418478 | Ignatius et al. | Jul 2002 | B1 |
6421678 | Smiga et al. | Jul 2002 | B2 |
6421711 | Blumenau et al. | Jul 2002 | B1 |
6442706 | Wahl et al. | Aug 2002 | B1 |
6470332 | Weschler | Oct 2002 | B1 |
6484162 | Edlund et al. | Nov 2002 | B1 |
6487561 | Ofek et al. | Nov 2002 | B1 |
6487644 | Huebsch et al. | Nov 2002 | B1 |
6502205 | Yanai et al. | Dec 2002 | B1 |
6519679 | Devireddy et al. | Feb 2003 | B2 |
6538669 | Lagueux, Jr. et al. | Mar 2003 | B1 |
6540623 | Jackson | Apr 2003 | B2 |
6549918 | Probert, Jr. et al. | Apr 2003 | B1 |
6557039 | Leong et al. | Apr 2003 | B1 |
6564228 | O'Connor | May 2003 | B1 |
6593656 | Ahn et al. | Jul 2003 | B2 |
6618771 | Leja et al. | Sep 2003 | B1 |
6629110 | Cane et al. | Sep 2003 | B2 |
6647399 | Zaremba | Nov 2003 | B2 |
6658526 | Nguyen et al. | Dec 2003 | B2 |
6662218 | Mighdoll et al. | Dec 2003 | B2 |
6675177 | Webb | Jan 2004 | B1 |
6691232 | Wood et al. | Feb 2004 | B1 |
6721767 | De Meno et al. | Apr 2004 | B2 |
6732088 | Glance | May 2004 | B1 |
6732231 | Don et al. | May 2004 | B1 |
6732244 | Ashton et al. | May 2004 | B2 |
6745178 | Emens et al. | Jun 2004 | B1 |
6795828 | Ricketts | Sep 2004 | B2 |
6816941 | Carlson et al. | Nov 2004 | B1 |
6820070 | Goldman et al. | Nov 2004 | B2 |
6839741 | Tsai | Jan 2005 | B1 |
6839803 | Loh et al. | Jan 2005 | B1 |
6850994 | Gabryjelski | Feb 2005 | B2 |
6860422 | Hull et al. | Mar 2005 | B2 |
6865568 | Chau | Mar 2005 | B2 |
6871182 | Winnard et al. | Mar 2005 | B1 |
6892221 | Ricart et al. | May 2005 | B2 |
6948038 | Berkowitz et al. | Sep 2005 | B2 |
6948039 | Biessener et al. | Sep 2005 | B2 |
6957186 | Guheen et al. | Oct 2005 | B1 |
6970997 | Shibayama et al. | Nov 2005 | B2 |
6976039 | Chefalas et al. | Dec 2005 | B2 |
6995675 | Curkendall et al. | Feb 2006 | B2 |
6996616 | Leighton et al. | Feb 2006 | B1 |
7003641 | Prahlad et al. | Feb 2006 | B2 |
7028079 | Mastrianni et al. | Apr 2006 | B2 |
7035880 | Crescenti et al. | Apr 2006 | B1 |
7039860 | Gautestad et al. | May 2006 | B1 |
7058661 | Ciaramitaro et al. | Jun 2006 | B2 |
7099901 | Sutoh et al. | Aug 2006 | B2 |
7107298 | Prahlad et al. | Sep 2006 | B2 |
7107416 | Stuart et al. | Sep 2006 | B2 |
7133870 | Tripp et al. | Nov 2006 | B1 |
7139826 | Watanabe et al. | Nov 2006 | B2 |
7139846 | Rossi | Nov 2006 | B1 |
7146387 | Russo et al. | Dec 2006 | B1 |
7155421 | Haldar | Dec 2006 | B1 |
7155481 | Prahlad et al. | Dec 2006 | B2 |
7159081 | Suzuki | Jan 2007 | B2 |
7171468 | Yeung et al. | Jan 2007 | B2 |
7171585 | Gail et al. | Jan 2007 | B2 |
7185152 | Takahashi et al. | Feb 2007 | B2 |
7188141 | Novaes | Mar 2007 | B2 |
7240100 | Wein et al. | Jul 2007 | B1 |
7246207 | Kottomtharayil et al. | Jul 2007 | B2 |
7269664 | Hutsch et al. | Sep 2007 | B2 |
7284033 | Jhanji | Oct 2007 | B2 |
7287047 | Kavuri | Oct 2007 | B2 |
7290017 | Wang et al. | Oct 2007 | B1 |
7313659 | Suzuki | Dec 2007 | B2 |
7315923 | Retnamma et al. | Jan 2008 | B2 |
7328325 | Solis et al. | Feb 2008 | B1 |
7343453 | Prahlad et al. | Mar 2008 | B2 |
7346623 | Prahlad et al. | Mar 2008 | B2 |
7346676 | Swildens et al. | Mar 2008 | B1 |
7346751 | Prahlad et al. | Mar 2008 | B2 |
7376947 | Evers | May 2008 | B2 |
7379978 | Anderson et al. | May 2008 | B2 |
7383379 | Patterson et al. | Jun 2008 | B2 |
7386535 | Kalucha et al. | Jun 2008 | B1 |
7395282 | Crescenti et al. | Jul 2008 | B1 |
7421460 | Chigusa et al. | Sep 2008 | B2 |
7424543 | Rice, III | Sep 2008 | B2 |
7434219 | De Meno et al. | Oct 2008 | B2 |
7457790 | Kochunni et al. | Nov 2008 | B2 |
7472142 | Prahlad et al. | Dec 2008 | B2 |
7496841 | Hadfield et al. | Feb 2009 | B2 |
7529782 | Prahlad et al. | May 2009 | B2 |
7565484 | Ghosal et al. | Jul 2009 | B2 |
7577689 | Masinter et al. | Aug 2009 | B1 |
7577694 | Nakano et al. | Aug 2009 | B2 |
7584469 | Mitekura et al. | Sep 2009 | B2 |
7587715 | Barrett et al. | Sep 2009 | B1 |
7593935 | Sullivan | Sep 2009 | B2 |
7596713 | Mani-Meitav et al. | Sep 2009 | B2 |
7603626 | Williams et al. | Oct 2009 | B2 |
7606844 | Kottomtharayil | Oct 2009 | B2 |
7610285 | Zoellner et al. | Oct 2009 | B1 |
7617262 | Prahlad et al. | Nov 2009 | B2 |
7668884 | Prahlad et al. | Feb 2010 | B2 |
7673175 | Mora et al. | Mar 2010 | B2 |
7676542 | Moser et al. | Mar 2010 | B2 |
7689899 | Leymaster et al. | Mar 2010 | B2 |
7730031 | Forster | Jun 2010 | B2 |
7734593 | Prahlad et al. | Jun 2010 | B2 |
7734669 | Kottomtharayil et al. | Jun 2010 | B2 |
7747579 | Prahlad et al. | Jun 2010 | B2 |
7751628 | Reisman | Jul 2010 | B1 |
7761409 | Stefik et al. | Jul 2010 | B2 |
7792789 | Prahlad et al. | Sep 2010 | B2 |
7801871 | Gosnell | Sep 2010 | B2 |
7814118 | Kottomtharayil et al. | Oct 2010 | B2 |
7827266 | Gupta | Nov 2010 | B2 |
7831793 | Chakravarty et al. | Nov 2010 | B2 |
7840537 | Gokhale et al. | Nov 2010 | B2 |
7844676 | Prahlad et al. | Nov 2010 | B2 |
7865517 | Prahlad et al. | Jan 2011 | B2 |
7882077 | Gokhale et al. | Feb 2011 | B2 |
7882093 | Kottomtharayil et al. | Feb 2011 | B2 |
7882097 | Ogilvie | Feb 2011 | B1 |
7937393 | Prahlad et al. | May 2011 | B2 |
7937420 | Tabellion et al. | May 2011 | B2 |
7937702 | De Meno et al. | May 2011 | B2 |
7984063 | Kottomtharayil et al. | Jul 2011 | B2 |
8037028 | Prahlad et al. | Oct 2011 | B2 |
8055627 | Prahlad et al. | Nov 2011 | B2 |
8060514 | Arrouye et al. | Nov 2011 | B2 |
8078607 | Oztekin et al. | Dec 2011 | B2 |
8099428 | Kottomtharayil et al. | Jan 2012 | B2 |
8108427 | Prahlad et al. | Jan 2012 | B2 |
8140786 | Bunte et al. | Mar 2012 | B2 |
8156086 | Lu et al. | Apr 2012 | B2 |
8161003 | Kavuri | Apr 2012 | B2 |
8170995 | Prahlad et al. | May 2012 | B2 |
8219524 | Gokhale | Jul 2012 | B2 |
8229954 | Kottomtharayil et al. | Jul 2012 | B2 |
8230195 | Amarendran et al. | Jul 2012 | B2 |
RE43678 | Major et al. | Sep 2012 | E |
8285681 | Prahlad et al. | Oct 2012 | B2 |
8352954 | Gokhale et al. | Jan 2013 | B2 |
8364652 | Vijayan et al. | Jan 2013 | B2 |
8578120 | Attarde et al. | Nov 2013 | B2 |
20020032878 | Karpf | Mar 2002 | A1 |
20020049883 | Schneider et al. | Apr 2002 | A1 |
20020120858 | Porter et al. | Aug 2002 | A1 |
20030046313 | Leung et al. | Mar 2003 | A1 |
20030050979 | Takahashi | Mar 2003 | A1 |
20030101086 | San Miguel | May 2003 | A1 |
20040039689 | Penney et al. | Feb 2004 | A1 |
20040267815 | De Mes | Dec 2004 | A1 |
20050039069 | Prahlad et al. | Feb 2005 | A1 |
20050097070 | Enis et al. | May 2005 | A1 |
20050251786 | Citron et al. | Nov 2005 | A1 |
20050278207 | Ronnewinkel | Dec 2005 | A1 |
20060036619 | Fuerst et al. | Feb 2006 | A1 |
20060070061 | Cox et al. | Mar 2006 | A1 |
20060115802 | Reynolds | Jun 2006 | A1 |
20060116999 | Dettinger et al. | Jun 2006 | A1 |
20060149604 | Miller | Jul 2006 | A1 |
20060149724 | Ritter et al. | Jul 2006 | A1 |
20060224846 | Amarendran et al. | Oct 2006 | A1 |
20060265396 | Raman et al. | Nov 2006 | A1 |
20060282900 | Johnson et al. | Dec 2006 | A1 |
20070022145 | Kavuri | Jan 2007 | A1 |
20070028229 | Knatcher | Feb 2007 | A1 |
20070043715 | Kaushik et al. | Feb 2007 | A1 |
20070061266 | Moore et al. | Mar 2007 | A1 |
20070061298 | Wilson et al. | Mar 2007 | A1 |
20070136541 | Herz et al. | Jun 2007 | A1 |
20070156783 | Zbogar-Smith et al. | Jul 2007 | A1 |
20070166674 | Kochunni et al. | Jul 2007 | A1 |
20070185915 | Prahlad et al. | Aug 2007 | A1 |
20070214330 | Minami et al. | Sep 2007 | A1 |
20070226320 | Hager et al. | Sep 2007 | A1 |
20070250810 | Tittizer et al. | Oct 2007 | A1 |
20070296258 | Calvert et al. | Dec 2007 | A1 |
20080126302 | Mora et al. | May 2008 | A1 |
20080282048 | Miura | Nov 2008 | A1 |
20080288947 | Gokhale et al. | Nov 2008 | A1 |
20080288948 | Attarde et al. | Nov 2008 | A1 |
20080320319 | Muller et al. | Dec 2008 | A1 |
20090171883 | Kochunni et al. | Jul 2009 | A1 |
20090319534 | Gokhale | Dec 2009 | A1 |
20090320029 | Kottomtharayil | Dec 2009 | A1 |
20090320033 | Gokhale et al. | Dec 2009 | A1 |
20100031017 | Gokhale et al. | Feb 2010 | A1 |
20100070466 | Prahlad et al. | Mar 2010 | A1 |
20100070474 | Lad | Mar 2010 | A1 |
20100070725 | Prahlad et al. | Mar 2010 | A1 |
20100070726 | Ngo et al. | Mar 2010 | A1 |
20100076932 | Lad | Mar 2010 | A1 |
20100114837 | Prahlad et al. | May 2010 | A1 |
20100332456 | Prahlad et al. | Dec 2010 | A1 |
20110093471 | Brockway et al. | Apr 2011 | A1 |
20110138225 | Gunabalasubramaniam et al. | Jun 2011 | A1 |
20110173171 | De Meno et al. | Jul 2011 | A1 |
20120036108 | Prahlad et al. | Feb 2012 | A1 |
20120150818 | Vijayan Retnamma et al. | Jun 2012 | A1 |
20120150826 | Vijayan Retnamma et al. | Jun 2012 | A1 |
20120254119 | Kumarasamy et al. | Oct 2012 | A1 |
20120265754 | Kottomtharayil et al. | Oct 2012 | A1 |
20120317085 | Green et al. | Dec 2012 | A1 |
20130145376 | Gokhale et al. | Jun 2013 | A1 |
20130262410 | Liu et al. | Oct 2013 | A1 |
Number | Date | Country |
---|---|---|
0259912 | Mar 1988 | EP |
0405926 | Jan 1991 | EP |
0467546 | Jan 1992 | EP |
0774715 | May 1997 | EP |
0809184 | Nov 1997 | EP |
0899662 | Mar 1999 | EP |
0910019 | Apr 1999 | EP |
0981090 | Feb 2000 | EP |
0986011 | Mar 2000 | EP |
1035690 | Sep 2000 | EP |
2216368 | Oct 1989 | GB |
07-046271 | Feb 1995 | JP |
7073080 | Mar 1995 | JP |
8044598 | Feb 1996 | JP |
2000035969 | Feb 2000 | JP |
2003531435 | Oct 2003 | JP |
WO-9513580 | May 1995 | WO |
WO-9912098 | Mar 1999 | WO |
WO-0058865 | Oct 2000 | WO |
WO-0106368 | Jan 2001 | WO |
WO-0116693 | Mar 2001 | WO |
WO-0180005 | Oct 2001 | WO |
Entry |
---|
“Multi Instancing,” retrieved from http://documentation.commvault.com/hds/release—8—0—0/books—online—1/english—us/deployment/install/misc/multi—instancing.htm[Feb. 18, 2014 11:57:19 AM] on Feb. 18, 2014, 3 pages. |
Hutchinson, Norman C., et al. “Logical vs. physical file system backup.” OSDI. vol. 99. 1999. |
Matthews, Jeanna, et al. “Data protection and rapid recovery from attack with a virtual private file server and virtual machine appliances.” Proceedings of the IASTED International Conference on Communication, Network and Information Security (CNIS 2005). 2005. |
Quinlan, Sean. “A cached worm file system.” Software: Practice and Experience 21.12 (1991): 1289-1299. |
Wu, Chin-Hsien, Tei-Wei Kuo, and Li-Pin Chang. “Efficient initialization and crash recovery for log-based file systems over flash memory.” Proceedings of the 2006 ACM symposium on Applied computing. ACM, 2006. |
U.S. Appl. No. 09/609,977, Prahlad. |
Microsoft Press Computer Dictionary Third Edition, “Data Compression,” Microsoft Press, 1997, p. 130. |
Veeravalli, B., “Network Caching Strategies for a Shared Data Distribution for a Predefined Service Demand Sequence,” IEEE Transactions on Knowledge and Data Engineering, vol. 15, No. 6, Nov./Dec. 2003, pp. 1487-1497. |
Hennessy et al., “Computer Architecture—A Quantitative Approach”, 2nd Edition, 1996, pp. 246-250. |
Rowe et al., “Indexes for User Access to Large Video Databases”, Storage and Retrieval for Image and Video Databases II, IS,& T/SPIE Symp. On Elec. Imaging Sci. & Tech., Feb. 1994, pp. 1-12. |
PCT International Search Report for International Application No. PCT/US09/32325, date of mailing Mar. 17, 2009, 11 pages. |
Extended European Search Report for Application No. EP 09767119, Mail date Feb. 11, 2013, 12 pages. |
Pitoura et al., “Locating Objects in Mobile Computing”, IEEE Transactions on Knowledge and Data Engineering, vol. 13, No. 4, Jul./Aug. 2001, pp. 571-592. |
Armstead et al., “Implementation of a Campus-wide Distributed Mass Storage Service: The Dream vs. Reality,” IEEE, Sep. 11-14, 1995, pp. 190-199. |
Arneson, “Mass Storage Archiving in Network Environments,” Digest of Papers, Ninth IEEE Symposium on Mass Storage Systems, Oct. 31-Nov. 3, 1988, pp. 45-50, Monterey, CA. |
Cabrera et al., “ADSM: A Multi-Platform, Scalable, Backup and Archive Mass Storage System,” Digest of Papers, Compcon '95, Proceedings of the 40th IEEE Computer Society International Conference, Mar. 5-9, 1995, pp. 420-427, San Francisco, CA. |
Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,” IEEE, Jun. 12-16, 1994, pp. 124-126. |
Jander, M., “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4 (Mar. 21, 1998), pp. 64-72. |
Gait, J., “The Optical File Cabinet: A Random-Access File System for Write-Once Optical Disks,” IEEE Computer, vol. 21, No. 6, pp. 11-22 (Jun. 1988). |
Rosenblum et al., “The Design and Implementation of a Log-Structured File System,” Operating Systems Review SIGOPS, vol. 25, No. 5, New York, US, pp. 1-15 (May 1991). |
Number | Date | Country | |
---|---|---|---|
20140108355 A1 | Apr 2014 | US |
Number | Date | Country | |
---|---|---|---|
60326023 | Sep 2001 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13250349 | Sep 2011 | US |
Child | 14108632 | US | |
Parent | 12252897 | Oct 2008 | US |
Child | 13250349 | US | |
Parent | 11497546 | Jul 2006 | US |
Child | 12252897 | US | |
Parent | 10260209 | Sep 2002 | US |
Child | 11497546 | US |