US 8,719,264 B2Grant
Creating secondary copies of data based on searches for content
Issue Date:2014-05-06
•19 Claims
•7 Drawing Sheets
Abstract
A method and system for creating secondary copies of data whose contents satisfy searches within data stores is described. In some cases, the system searches for data within a data store, identifies a set of data that satisfies the search, copies the identified set of data, and transfers the copy to secondary or other storage. In some cases, the system utilizes search-based secondary copies of days during restoration processes in order to restore data similar to and/or associated with data requested to be restored.
Metadata
Assignee
- CommVault Systems, Inc.
Inventor
- Prakash Varadharajan
Application Information
Application Number:US 13/076,714
Filing Date:2011-03-31
Priority Date:2011-03-31
Art Unit:2156
Classifications
IPC:
G06F7/00G06F17/30
Patent Drawings (7 sheets)
Description
Background
[0001] Data storage systems facilitate the retention of electronic data produced by computing systems. Often, data is stored remotely from a computing system, in secondary or even tertiary storage devices. Example storage devices may include magnetic tapes, optical disks, flash memory, and so on. Data is retained for a wide variety of purposes, such as for compliance purposes or backup purposes.
[0002] Currently, there are many data storage systems capable of restoring data from remote storage devices. Typically, during restoration the systems will attempt to identify specific data elements within massive data stores. For example, during a legal discovery process, a data restore system may review large amounts of data before resolving a certain data recovery request, which may be expensive and overwhelm associated computing and human resources, among other problems.
[0003] There is a need for a system that overcomes the above problems, as well as providing additional benefits.
Brief Description of the Drawings
[0004] FIG. 1 is a block diagram illustrating a computing environment in which aspects of the system may be implemented.
[0005] FIG. 2 is a block diagram illustrating a suitable data storage system in which aspects of the system may be implemented.
[0006] FIG. 3 is a flow diagram illustrating a routine for creating a secondary copy of data based on a search for data.
[0007] FIG. 4 is a block diagram illustrating secondary storage media containing secondary copies of data.
[0008] FIG. 5 is a flow diagram illustrating a routine for creating a secondary copy of data based on a search for data and associated information.
[0009] FIG. 6 is a flow diagram illustrating a routine for restoring data from search based secondary copies of data.
Detailed Description
Overview
[0010] A method and system for creating secondary copies of data identified during searches within a data store is described. That is, in some examples, a backup copy is made of the results of a search for data whose contents satisfy a certain search criteria. The search, which may be performed within secondary storage media, tertiary storage media, primary storage media, or other storage media, and information (i.e., search criteria) associated with the search may be leveraged when creating and/or generating copies of data for backup and other data retention purposes. Thus, in some examples, the system may stage or create copies of data tailored for anticipated or future restoration and other data retrieval tasks, among other benefits.
[0011] In some examples, the system creates secondary copies of data that satisfy search criteria as well as other data, such as data that satisfy other search criteria associated with the search criteria. For example, the system may create a secondary copy for all data that include a company name in response to a search for the company name as well as all data that include the name of a subsidiary of the company. In some examples, the system may create copies of data based on a search for content within the data and content associated with the searched content, among other benefits.
[0012] In some examples, the system may restore data associated with data that is part of a restoration request. For example, the system may receive a request to restore data produced during a certain time period, locate the data within a secondary copy of data that satisfied the criteria of a previous search for data, and restore the secondary copy. Thus, in some examples, the system may, in response to a data recovery request, restore data associated with the requested data in order to anticipate additional recovery requests, among other benefits.
[0013] The system will now be described with respect to various embodiments. The following description provides specific details for a thorough understanding of, and enabling description for, these embodiments of the system. However, one skilled in the art will understand that the system may be practiced without these details. In other instances, well-known structures and functions have not been shown or described in detail to avoid unnecessarily obscuring the description of the embodiments of the system.
[0014] The terminology used in the description presented below is intended to be interpreted in its broadest reasonable manner, even though it is being used in conjunction with a detailed description of certain specific embodiments of the system. Certain terms may even be emphasized below; however, any terminology intended to be interpreted in any restricted manner will be overtly and specifically defined as such in this Detailed Description section.
Suitable System
[0015] FIGS. 1 and 2 and the following discussion provide a brief, general description of a suitable computing environment in which the system can be implemented. Although not required, aspects of the system are described in the general context of computer-executable instructions, such as routines executed by a general-purpose computer, e.g., a server computer, wireless device or personal computer. Those skilled in the relevant art will appreciate that the system can be practiced with other communications, data processing, or computer system configurations, including: Internet appliances, network PCs, mini-computers, mainframe computers, and the like. Indeed, the terms “computer,” “host,” and “host computer” are generally used interchangeably herein, and refer to any of the above devices and systems, as well as any data processor.
[0016] Aspects of the system can be embodied in a special purpose computer or data processor that is specifically programmed, configured, or constructed to perform one or more of the computer-executable instructions explained in detail herein. Aspects of the system can also be practiced in distributed computing environments where tasks or modules are performed by remote processing devices, which are linked through a communications network, such as a Local Area Network (LAN), Wide Area Network (WAN), Storage Area Network (SAN), Fibre Channel, or the Internet. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
[0017] Aspects of the system may be stored or distributed on computer-readable media, including magnetically or optically readable computer discs, hard-wired or preprogrammed chips (e.g., EEPROM semiconductor chips), nanotechnology memory, biological memory, or other data storage media. Indeed, computer implemented instructions, data structures, screen displays, and other data under aspects of the system may be distributed over the Internet or over other networks (including wireless networks), on a propagated signal on a propagation medium (e.g., an electromagnetic wave(s), a sound wave, etc.) over a period of time, or they may be provided on any analog or digital network (packet switched, circuit switched, or other scheme). Those skilled in the relevant art will recognize that portions of the system reside on a server computer, while corresponding portions reside on a client computer, and thus, while certain hardware platforms are described herein, aspects of the system are equally applicable to nodes on a network.
[0018] FIG. 1 is a block diagram illustrating a computing environment 100 in which aspects of the system may be implemented. The environment 100 includes a data storage component 110 and a data store 120, which may be part of a data storage system, such as data storage system 200 of FIG. 2 , to be discussed herein.
[0019] Data storage component 110 includes a search component 112, a copy component 114, an index component 116, and other components 118, such as restore components, databases, user interface components, and so on. The data storage component 110 may transfer and/or retrieve data from a data store 120. The data store 120 may be a secondary storage device, a tertiary storage device, or other storage devices.
[0020] In some examples of the system, the search component 112 searches the data store 120 for data satisfying received or input criteria. In some cases, the search component 112 may receive criteria associated with data to be restored from the data store 120, and search the data store 120 for data satisfying the criteria of the restoration request. In some cases, the search component 112 may receive a request to search for data whose contents satisfy certain search criteria, such as criteria associated with anticipated data recovery or data identification requests. Further details regarding the search component 112 may be found in commonly-assigned U.S. patent application Ser. No. 11/931,034, which is incorporated by reference in its entirety.
[0021] In some examples of the system, the copy component 114 creates a copy of the results of searches performed by the search component 112. In some cases, the copy component 114 may create a secondary copy of data satisfying search criteria, such as a backup copy, an archive copy, and so on.
[0022] In some examples of the system, the index component 116 creates and/or updates an index associated with the data store 120, such as an index that relates the data stored in the data store with locations in the data store that contain the data. The index may also include other data, such as metadata associated with the stored data, metadata associated with creation of copies, and other information.
[0023] Further details regarding the components and processes utilized in the creating and storage of data, such as data stored within data store 120 and/or copies created by copy component 114, will now be discussed with respect to FIG. 2 . FIG. 2 is a block diagram illustrating various components and resources of a suitable data storage system 200.
[0024] The resources in the data storage system 200 may employ the processes and techniques described herein. The data storage system 200 includes a storage manager 205, one or more data agents 295, one or more secondary storage computing devices 265, one or more storage devices 215, one or more clients 230, one or more data or information stores 260 and 262, a single instancing database 223, an index 211, a jobs agent 220, an interface agent 225, and a management agent 231. The system 200 may represent a modular storage system such as the CommVault QiNetix system, and also the CommVault GALAXY backup system, available from CommVault Systems, Inc. of Oceanport, N.J., aspects of which are further described in commonly-assigned U.S. Pat. No. 7,035,880, the entirety of which is incorporated by reference herein. The system 200 may also represent a modular storage system such as the CommVault Simpana system, also available from CommVault Systems, Inc.
[0025] The data storage system 200 may generally include combinations of hardware and software components associated with performing storage operations on electronic data. Storage operations include copying, backing up, creating, storing, retrieving, and/or migrating primary storage data (e.g., data stores 260 and/or 262) and secondary storage data (which may include, for example, snapshot copies, backup copies, HSM copies, archive copies, and other types of copies of electronic data stored on storage devices 215). The system 200 may provide one or more integrated management consoles for users or system processes to interface with in order to perform certain storage operations on electronic data as further described herein. Such integrated management consoles may be displayed at a central control facility or several similar consoles distributed throughout multiple network locations to provide global or geographically specific network data storage information.
[0026] In some examples, storage operations may be performed according to various storage preferences, for example, as expressed by a user preference, a storage policy, a schedule policy, and/or a retention policy. A “storage policy” is generally a data structure or other information source that includes a set of preferences and other storage criteria associated with performing a storage operation. The preferences and storage criteria may include, but are not limited to, a storage location, relationships between system components, network pathways to utilize in a storage operation, data characteristics, compression or encryption requirements, preferred system components to utilize in a storage operation, a single instancing or variable instancing policy to apply to the data, and/or other criteria relating to a storage operation. For example, a storage policy may indicate that certain data is to be stored in the storage device 215, retained for a specified period of time before being aged to another tier of secondary storage, copied to the storage device 215 using a specified number of data streams, and so on.
[0027] A “schedule policy” may specify a frequency with which to perform storage operations and a window of time within which to perform them. For example, a schedule policy may specify that a storage operation is to be performed every Saturday morning from 2:00 a.m. to 4:00 a.m. In some cases, the storage policy includes information generally specified by the schedule policy. (Put another way, the storage policy includes the schedule policy.) Storage policies and/or schedule policies may be stored in a database of the storage manager 205, to archive media as metadata for use in restore operations or other storage operations, or to other locations or components of the system 200.
[0028] The system 200 may comprise a storage operation cell that is one of multiple storage operation cells arranged in a hierarchy or other organization. Storage operation cells may be related to backup cells and provide some or all of the functionality of backup cells as described in commonly-assigned U.S. Pat. No. 7,395,282, which is incorporated herein by reference in its entirety. However, storage operation cells may also perform additional types of storage operations and other types of storage management functions that are not generally offered by backup cells.
[0029] Storage operation cells may contain not only physical devices, but also may represent logical concepts, organizations, and hierarchies. For example, a first storage operation cell may be configured to perform a first type of storage operations such as HSM operations, which may include backup or other types of data migration, and may include a variety of physical components including a storage manager 205 (or management agent 231), a secondary storage computing device 265, a client 230, and other components as described herein. A second storage operation cell may contain the same or similar physical components; however, it may be configured to perform a second type of storage operations, such as storage resource management (“SRM”) operations, and may include monitoring a primary data copy or performing other known SRM operations.
[0030] Thus, as can be seen from the above, although the first and second storage operation cells are logically distinct entities configured to perform different management functions (HSM and SRM, respectively), each storage operation cell may contain the same or similar physical devices. Alternatively, different storage operation cells may contain some of the same physical devices and not others. For example, a storage operation cell configured to perform SRM tasks may contain a secondary storage computing device 265, client 230, or other network device connected to a primary storage volume, while a storage operation cell configured to perform HSM tasks may instead include a secondary storage computing device 265, client 230, or other network device connected to a secondary storage volume and not contain the elements or components associated with and including the primary storage volume. (The term “connected” as used herein does not necessarily require a physical connection; rather, it could refer to two devices that are operably coupled to each other, communicably coupled to each other, in communication with each other, or more generally, refer to the capability of two devices to communicate with each other.) These two storage operation cells, however, may each include a different storage manager 205 that coordinates storage operations via the same secondary storage computing devices 265 and storage devices 215. This “overlapping” configuration allows storage resources to be accessed by more than one storage manager 205, such that multiple paths exist to each storage device 215 facilitating failover, load balancing, and promoting robust data access via alternative routes.
[0031] Alternatively or additionally, the same storage manager 205 may control two or more storage operation cells (whether or not each storage operation cell has its own dedicated storage manager 205). Moreover, in certain embodiments, the extent or type of overlap may be user-defined (through a control console) or may be automatically configured to optimize data storage and/or retrieval.
[0032] Data agent 295 may be a software module or part of a software module that is generally responsible for performing storage operations on the data of the client 230 stored in data store 260/262 or other memory location. Each client 230 may have at least one data agent 295 and the system 200 can support multiple clients 230. Data agent 295 may be distributed between client 230 and storage manager 205 (and any other intermediate components), or it may be deployed from a remote location or its functions approximated by a remote process that performs some or all of the functions of data agent 295.
[0033] The overall system 200 may employ multiple data agents 295, each of which may perform storage operations on data associated with a different application. For example, different individual data agents 295 may be 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. Other examples may employ one or more generic data agents 295 that can handle and process multiple data types rather than using the specialized data agents described above.
[0034] If a client 230 has two or more types of data, one data agent 295 may be required for each data type to perform storage operations on the data of the client 230. For example, to back up, migrate, and restore all the data on a Microsoft Exchange 2000 server, the client 230 may use one Microsoft Exchange 2000 Mailbox data agent 295 to back up the Exchange 2000 mailboxes, one Microsoft Exchange 2000 Database data agent 295 to back up the Exchange 2000 databases, one Microsoft Exchange 2000 Public Folder data agent 295 to back up the Exchange 2000 Public Folders, and one Microsoft Windows 2000 File System data agent 295 to back up the file system of the client 230. These data agents 295 would be treated as four separate data agents 295 by the system even though they reside on the same client 230.
[0035] Alternatively, the overall system 200 may use one or more generic data agents 295, each of which may be capable of handling two or more data types. For example, one generic data agent 295 may be used to back up, migrate and restore Microsoft Exchange 2000 Mailbox data and Microsoft Exchange 2000 Database data while another generic data agent 295 may handle Microsoft Exchange 2000 Public Folder data and Microsoft Windows 2000 File System data, and so on.
[0036] Data agents 295 may be responsible for arranging or packing data to be copied or migrated into a certain format, such as an archive file. Nonetheless, it will be understood that this represents only one example, and any suitable packing or containerization technique or transfer methodology may be used if desired. Such an archive file may include metadata, a list of files or data objects copied, the file, and data objects themselves. Moreover, any data moved by the data agents may be tracked within the system by updating indexes associated with appropriate storage managers 205 or secondary storage computing devices 265. As used herein, a file or a data object refers to any collection or grouping of bytes of data that can be viewed as one or more logical units.
[0037] Storage manager 205 may be a software module or other application that coordinates and controls storage operations performed by the system 200. Storage manager 205 may communicate with some or all elements of the system 200, including clients 230, data agents 295, secondary storage computing devices 265, and storage devices 215, to initiate and manage storage operations (e.g., backups, migrations, data recovery operations), and so on.
[0038] Storage manager 205 may include a jobs agent 220 that monitors the status of some or all storage operations previously performed, currently being performed, or scheduled to be performed by the system 200. Jobs agent 220 may be communicatively coupled to an interface agent 225 (e.g., a software module or application). Interface agent 225 may include information processing and display software, such as a graphical user interface (“GUI”), an application programming interface (“API”), or other interactive interface through which users and system processes can retrieve information about the status of storage operations. For example, in an arrangement of multiple storage operations cell, through interface agent 225, users may optionally issue instructions to various storage operation cells regarding performance of the storage operations as described and contemplated herein. For example, a user may modify a schedule concerning the number of pending snapshot copies or other types of copies scheduled as needed to suit particular needs or requirements. As another example, a user may employ the GUI to view the status of pending storage operations in some or all of the storage operation cells in a given network, to monitor the status of certain components in a particular storage operation cell (e.g., the amount of storage capacity left in a particular storage device 1015), to provide criteria for searches of data stored in storage devices, and so on.
[0039] Storage manager 205 may also include a management agent 231 that is typically implemented as a software module or application program. In general, management agent 231 provides an interface that allows various management agents 231 in other storage operation cells to communicate with one another. For example, assume a certain network configuration includes multiple storage operation cells hierarchically arranged or otherwise logically related in a WAN or LAN configuration. With this arrangement, each storage operation cell may be connected to the other through each respective interface agent 225. This allows each storage operation cell to send and receive certain pertinent information from other storage operation cells, including status information, routing information, information regarding capacity and utilization, etc. These communications paths may also be used to convey information and instructions regarding storage operations.
[0040] For example, a management agent 231 in a first storage operation cell may communicate with a management agent 231 in a second storage operation cell regarding the status of storage operations in the second storage operation cell. Another illustrative example includes the case where a management agent 231 in a first storage operation cell communicates with a management agent 231 in a second storage operation cell to control storage manager 205 (and other components) of the second storage operation cell via management agent 231 contained in storage manager 205.
[0041] Another example is the case where management agent 231 in a first storage operation cell communicates directly with and controls the components in a second storage operation cell and bypasses the storage manager 205 in the second storage operation cell. If desired, storage operation cells can also be organized hierarchically such that hierarchically superior cells control or pass information to hierarchically subordinate cells or vice versa.
[0042] Storage manager 205 may also maintain an index, a database, or other data structure 211. The data stored in database 211 may be used to indicate logical associations between components of the system, user preferences, management tasks, media containerization and data storage information, or other useful data. For example, the storage manager 205 may use data from database 211 to track logical associations between secondary storage computing device 265 and storage devices 215 (or movement of data as containerized from primary to secondary storage).
[0043] Generally speaking, the secondary storage computing device 265, which may also be referred to as a media agent, may be implemented as a software module that conveys or transfers data, as directed by storage manager 205, between a client 230 and one or more storage devices 215, such as a tape library, a magnetic media storage device, an optical media storage device, or any other suitable storage device. In some examples, secondary storage computing device 265 may be communicatively coupled to and control a storage device 215. A secondary storage computing device 265 may be considered to be associated with a particular storage device 215 if that secondary storage computing device 265 is capable of routing and storing data to that particular storage device 215.
[0044] In operation, a secondary storage computing device 265 associated with a particular storage device 215 may instruct the storage device to use a robotic arm or other retrieval means to load or eject a certain storage media, and to subsequently archive, migrate, or restore data to or from that media. Secondary storage computing device 265 may communicate with a storage device 215 via a suitable communications path such as a SCSI or Fibre Channel communications link. In some embodiments, the storage device 215 may be communicatively coupled to the storage manager 205 via a SAN.
[0045] Each secondary storage computing device 265 may maintain an index, a database, or other data structure 261 that may store index data generated during storage operations for secondary storage (SS) as described herein, including creating a metabase (MB). For example, performing storage operations on Microsoft Exchange data may generate index data. Such index data provides a secondary storage computing device 265 or other external device with a fast and efficient mechanism for locating data stored or backed up. Thus, a secondary storage computing device index 261, or a database 211 of a storage manager 205, may store data associating a client 230 with a particular secondary storage computing device 265 or storage device 215, for example, as specified in a storage policy, while a database or other data structure in secondary storage computing device 265 may indicate where specifically the data of the client 230 is stored in storage device 215, what specific files were stored, and other information associated with storage of the data of the client 230. In some examples, such index data may be stored along with the data backed up in a storage device 215, with an additional copy of the index data written to index cache in a secondary storage device. Thus the data is readily available for use in storage operations and other activities without having to be first retrieved from the storage device 215.
[0046] Generally speaking, information stored in a cache is typically recent information that reflects certain particulars about operations that have recently occurred. After a certain period of time, this information is sent to secondary storage and tracked. This information may need to be retrieved and uploaded back into a cache or other memory in a secondary computing device before data can be retrieved from storage device 215. In some examples, the cached information may include information regarding format or containerization of archives or other files stored on storage device 215.
[0047] One or more of the secondary storage computing devices 265 may also maintain one or more single instance databases 223. Single instancing (alternatively called data deduplication) generally refers to storing in secondary storage only a single instance of each data object (or data block) in a set of data (e.g., primary data). More details as to single instancing may be found in one or more of the following previously-referenced U.S. patent application Ser. Nos. 11/269,512, 12/145,347, 12/145,342, 11/963,623, 11/950,376, and 61/100,686, which are incorporated by reference in their entirety.
[0048] In some examples, the secondary storage computing devices 265 maintain one or more variable instance databases. Variable instancing generally refers to storing in secondary storage one or more instances, but fewer than the total number of instances, of each data object (or data block) in a set of data (e.g., primary data). More details as to variable instancing may be found in the previously-referenced U.S. Patent Application No. 61/164,803, which is incorporated by reference in its entirety.
[0049] In some embodiments, certain components may reside and execute on the same computer. For example, in some embodiments, a client 230 such as a data agent 295, or a storage manager 205, coordinates and directs local archiving, migration, and retrieval application functions as further described in the previously-referenced U.S. patent application Ser. No. 09/610,738, which is incorporated by reference in its entirety. This client 230 can function independently or together with other similar clients 230.
[0050] The secondary storage computing devices 265 each has its own associated metabase 261. Each client 230 may also have its own associated metabase 270. However in some embodiments, each “tier” of storage, such as primary storage, secondary storage, tertiary storage, etc., may have multiple metabases or a centralized metabase, as described herein. For example, rather than a separate metabase or index associated with each client 230, the metabases on this storage tier may be centralized. Similarly, second and other tiers of storage may have either centralized or distributed metabases. Moreover, mixed architecture systems may be used if desired, that may include a first tier centralized metabase system coupled to a second tier storage system having distributed metabases and vice versa, and so on.
[0051] Moreover, in operation, a storage manager 205 or other management module may keep track of certain information that allows the storage manager 205 to select, designate, or otherwise identify metabases to be searched in response to certain queries as further described herein. Movement of data between primary and secondary storage may also involve movement of associated metadata and other tracking information as further described herein.
[0052] In some examples, primary data may be organized into one or more sub-clients. A sub-client is a portion of the data of one or more clients 230, and can contain either all of the data of the clients 230 or a designated subset thereof. As depicted in FIG. 10 , the data store 262 includes two sub-clients. For example, an administrator (or other user with the appropriate permissions; the term administrator is used herein for brevity) may find it preferable to separate email data from financial data using two different sub-clients having different storage preferences, retention criteria, and so on.
[0053] In some examples, the data storage system 200 includes a content indexing component (not shown). The context indexing component may select a copy of data to be indexed or stored, identify content within the copy of the data, and update an index of content to make the content available for searching or other purposes. For example, the component may add information such as the location of the content, keywords found within the content, and other supplemental information about the content that may be helpful for locating the content during a search.
Creating Secondary Copies of Data Based on Received Search Criteria
[0054] As described herein, in some examples, the system creates secondary copies of data identified during a search of a data store, such as secondary or tertiary storage. FIG. 3 is a flow diagram illustrating a routine 300 for creating a secondary copy of data based on a search for data in a data store.
[0055] In step 310, the system receives information associated with a search for stored data, such as a request to restore data whose contents satisfy a certain search criteria. For example, the search component 112 may receive a request to retrieve data from a secondary data store, such as an archive data store.
[0056] In step 320, the system identifies data that satisfies the search request. For example, the search component 112 may perform a lookup operation on one or more indices, such as a content index, to search for and identify a set of data that satisfies the criteria of the search request. In some cases, the system may identify data stored in secondary or tertiary data store, such as archive data, backup data, and so on. In some examples, the search criteria are received from a user, such as a database administrator. The search criteria may be associated with discovery requests for data, audits or compliance requests for data, research purposes, and so on.
[0057] In step 330, the system creates a copy of the data whose contents satisfy the criteria of the search. For example, the copy component 116, which may be one or more media agents described herein, may perform a number of different copy operations when creating or making a copy of the data whose contents satisfy a received search criteria, as discussed herein.
[0058] In step 340, the system transfers the created copy to a data store. For example, the system, via the copy component 116 or another component, may transfer the created copy to secondary storage, tertiary storage, or possibly primary storage, depending on the needs of a requestor. In some cases, the system transfers the created copy to the data store that contained the searched data. Example data stores will now be discussed.
[0059] FIG. 4 is a block diagram illustrating secondary storage media 400 containing secondary copies of data. The storage media 400 includes a first search-based copy of data (“search1”) 410, a second search-based copy of data (“search2”) 420, and other non search-based copies of data (“day1”), such as a copy of data produced within a certain time period.
[0060] In some examples, the system may create copies of data in order to stage backup copies in anticipation of future requests for data. In some cases, the system may identify certain search criteria, apply the search criteria to a data store, identify groups of data that satisfy the search criteria, and create a copy of each of the identified groups. In some cases, the system may stage and create copies of data, storing the copies as distinct buckets of data whose contents satisfy search criteria. For example, the search1 copy 410 of data store 400 may be associated with search criteria for a sender's name of an email, while the search2 copy 420 of data store 400 may be associated with the same name as a recipient of an email.
[0061] In some examples, the system may create copies of data whose contents satisfy received search criteria as well as data whose contents satisfy search criteria associated with and/or related to the received search criteria. FIG. 5 is a flow diagram illustrating a routine 500 for creating a secondary copy of data based on a search for data and based on associated searches for data.
[0062] In step 510, the system receives a search request for data that satisfies first search criteria. For example, the system, via a search component 112, receives a search request for data whose contents include a certain keyword, name, parameter, and so on. In step 520, the system identifies data whose contents satisfy the search request. For example, the search component 112 searches an index of a data store for data whose contents satisfy the first search criteria, and generates a set of results of data that satisfy the criteria.
[0063] In step 530, the system determines that there are additional or other search criteria associated with the first search criteria. The system may maintain a table or other data structure of associated search criteria. The criteria may be associated based on the type of data, based on previous restoration requests, based on corporate relationships, based on previous user requests, and so on. For example, the system may associate the name of a CEO of a company with the names of the CTO, CIO, and CFO, as historical information associated with discovery requests related to that company indicates the requests often included requests for data files from the CEO as well as the CTO, CIO, and CFO.
[0064] In step 540, the system identifies data whose contents satisfy the additional or other search criteria. For example, the search component 112 searches an index of the data store for data whose contents satisfy the associated search criteria, and generates a set of results of data that satisfy the criteria. In step 550, the system, via a copy component 114, creates a copy of the identified data. For example, the copy component 114 creates a secondary copy of the data whose contents satisfy the first search criteria and the associated search criteria.
[0065] The following examples illustrate how the system may apply to real world scenarios. One of ordinary skill will appreciate that other applications are of course possible.
[0066] During an ongoing litigation, a company is advised to prepare for the discovery phase by collecting all emails from a certain time period. The company, wishing to avoid the high legal fees associated with discovery, employs aspects of the system described herein by searching a data store containing all the emails for emails whose contents include keywords associated with the litigation. Once the emails whose contents include keywords associated with the litigation are identified, the system creates copies of the data associated with each keyword, creating data buckets for every keyword. Thus, the company avoids a lengthy and costly discovery phase of the litigation by staging the data stored in its archives into buckets of data grouped by search criteria.
[0067] In order to satisfy future compliance requests, a bank may utilize the system described herein to create copies of data grouped based on a number of different criteria. The system searches the bank's data archives for data whose contents include information likely to be requested, creates copies of data that includes the information likely to be requested, and stores the copies in the archives for the expected compliance requests.
Restoring Data from Search Based Secondary Copies of Data
[0068] As described herein, in some examples, the system creates secondary copies of data that contain data whose contents are identified during searches within data stores. In some examples, these secondary copies may be restored for data recovery or data request purposes. Additionally, in some examples, such storage may facilitate improved or anticipatory data recovery, among other benefits.
[0069] FIG. 6 is a flow diagram illustrating a routine 600 for restoring data from search based secondary copies of data. In step 610, the system receives a request to restore data. For example, the system receives a request to restore data from secondary storage media, such as magnetic tape. The received request may identify data to be restored based on metadata associated with the data, such as metadata that identifies a time period in which the data was copied and/or stored, the computing resources used to create and/or store the data, and so on.
[0070] In step 620, the system identifies the data that satisfies the request. For example, the system identifies a secondary copy of the data to be restored, such as a snapshot copy, archive copy, and so on. In step 630, the system determines if the identified data is part of or associated with a search-based copy of data for a data store. That is, the system may determine that a backup copy or other secondary copy was previously created for data whose content satisfied a search of the content of a data source.
[0071] In step 640, when the data is part of a search-based secondary copy of data, the system restores the requested data as well as the search-based secondary copy that includes the requested data. For example, the system restores the specifically requested data along with data deemed to be associated with the requested data based on a similarity of content determined by a previous search for content within a data store.
[0072] Thus, in some examples, creating search-based secondary copies, such as backup copies, of portions of a data store facilitates restoring additional data along with requested data, which may assist in reducing restoration requests because the system anticipates and stages data that may be associated with a later restoration request. For example, if the system receives a request to restore exchange data from a certain day, the system may identify other data whose content is similar to the content within that day's data (e.g., sender names, keywords from subject lines in emails) and restore that other data from the search-based copies described herein. Thus, the system may utilize search-based copies of data during restoration processes in order to recover data that may supplement and/or augment the data of a restoration request, among other benefits.
Conclusion
[0073] From the foregoing, it will be appreciated that specific embodiments of the system have been described herein for purposes of illustration, but that various modifications may be made without deviating from the spirit and scope of the system. Accordingly, the system is not limited except as by the appended claims.
[0074] Unless the context clearly requires otherwise, throughout the description and the claims, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense, as opposed to an exclusive or exhaustive sense; that is to say, in the sense of “including, but not limited to.” The word “coupled”, as generally used herein, refers to two or more elements that may be either directly connected, or connected by way of one or more intermediate elements. Additionally, the words “herein,” “above,” “below,” and words of similar import, when used in this application, shall refer to this application as a whole and not to any particular portions of this application. Where the context permits, words in the above Detailed Description using the singular or plural number may also include the plural or singular number respectively. The word “or” in reference to a list of two or more items, that word covers all of the following interpretations of the word: any of the items in the list, all of the items in the list, and any combination of the items in the list.
[0075] The above detailed description of embodiments of the system is not intended to be exhaustive or to limit the system to the precise form disclosed above. While specific embodiments of, and examples for, the system are described above for illustrative purposes, various equivalent modifications are possible within the scope of the system, as those skilled in the relevant art will recognize. For example, while processes or blocks are presented in a given order, alternative embodiments may perform routines having steps, or employ systems having blocks, in a different order, and some processes or blocks may be deleted, moved, added, subdivided, combined, and/or modified. Each of these processes or blocks may be implemented in a variety of different ways. Also, while processes or blocks are at times shown as being performed in series, these processes or blocks may instead be performed in parallel, or may be performed at different times.
[0076] The teachings of the system provided herein can be applied to other systems, not necessarily the system described above. The elements and acts of the various embodiments described above can be combined to provide further embodiments.
[0077] These and other changes can be made to the system in light of the above Detailed Description. While the above description details certain embodiments of the system and describes the best mode contemplated, no matter how detailed the above appears in text, the system can be practiced in many ways. Details of the system may vary considerably in implementation details, while still being encompassed by the system disclosed herein. As noted above, particular terminology used when describing certain features or aspects of the system should not be taken to imply that the terminology is being redefined herein to be restricted to any specific characteristics, features, or aspects of the system with which that terminology is associated. In general, the terms used in the following claims should not be construed to limit the system to the specific embodiments disclosed in the specification, unless the above Detailed Description section explicitly defines such terms. Accordingly, the actual scope of the system encompasses not only the disclosed embodiments, but also all equivalent ways of practicing or implementing the system under the claims.
[0078] While certain aspects of the system are presented below in certain claim forms, the inventors contemplate the various aspects of the system in any number of claim forms. For example, while only one aspect of the system is recited as embodied in a computer-readable medium, other aspects may likewise be embodied in a computer-readable medium. Accordingly, the inventors reserve the right to add additional claims after filing the application to pursue such additional claim forms for other aspects of the system.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
I claim:
1. A non-transitory computer-readable medium having instructions for execution by a processor, the instructions comprising:
a search component, wherein the search component is configured to search data within a data store of a storage cell to identify a set of data that satisfies first search criteria,
wherein the data store is a secondary or tertiary storage device of the storage cell that stores backup copies of production data generated by at least one client device,
wherein the secondary or tertiary storage device is remotely located from the at least one client device,
wherein the storage cell does not contain a primary storage device that stores the production data generated by the at least one client device, such that a search of the data store of the storage cell excludes a search of the primary storage device,
wherein the search component is configured to identify additional data that satisfies second search criteria and is associated with the set of data and that does not satisfy the first search criteria,
wherein the second criteria include a business entity relationship with the set of data and include information about subsidiary business entities with respect to one or more business entities identified in the set of data;
a copy component, wherein the copy component is configured to create a secondary copy of the identified set of data that satisfies the first search criteria and of the additional data,
wherein the secondary copy of the identified set of data is one of a backup copy, a snapshot copy, and an archive copy;
wherein the secondary copy of the identified set of data and of the additional data is created from the backup copies of production data stored on the secondary or tertiary storage device; and
a transfer component, wherein the transfer component is configured to store the secondary copy of the identified set of data and the additional data to the secondary or tertiary storage device.
2. The computer-readable medium of claim 1, wherein the search component is configured to search for data that satisfies user selected criteria.
3. The computer-readable medium of claim 1, wherein the first search criteria includes at least one criterion associated with content within the data stored within the data store.
4. The computer-readable medium of claim 1, wherein the data store is contained on a certain secondary storage media, and the transfer component is configured to transfer the secondary copy to the certain secondary storage media.
5. The computer-readable medium of claim 1, wherein the instructions further comprise:
an index component, wherein the index component is configured to update an index having entries relating secondary copies of data with media locations for the secondary copies with an entry for the created secondary copy.
6. The computer-readable medium of claim 1, wherein the instructions further comprise:
a content component, wherein the content component is configured to determine content within the created secondary copy that is associated with other content within the data store; and
an identification component, wherein the identification component is configured to identify data stored in the data store that includes the other content;
wherein the copy component is configured to create a secondary copy of data that includes data that satisfies the first search criteria and the identified data that includes the other content.
7. A computer-implemented method for creating a copy of data stored in secondary or tertiary storage media, the method comprising:
receiving, by a computing device, information associated with a search for data stored in the secondary or tertiary storage media and not in a primary storage device of the computing device,
wherein the secondary or tertiary storage media is remotely located from the computing device;
identifying data within the secondary or tertiary storage media that satisfies one or more criteria of the search;
determining additional criteria that is associated with and different than the one or more criteria of the search,
wherein the additional criteria is based on a business entity relationship between the additional criteria and the one or more search criteria;
identifying additional data that satisfies the determined additional criteria,
wherein the additional criteria include information about subsidiary business entities that are subsidiary with respect to one or more business entities identified in the set of data;
generating a copy of the data that satisfies the criteria of the search and of the additional data that satisfies the additional criteria, wherein the copy of the data that satisfies the criteria of the search and the additional data that satisfies the determined additional criteria is created from backup copies of production data stored on the secondary or tertiary storage media,
wherein the copy of the data and the additional data is formatted differently than an original copy of the production data from which the backup copies were created; and
transferring the generated copy of the data and the additional data to the secondary or tertiary storage media to make results of the search accessible in a shorter amount of time than separately performing the search for the one or more search criteria and the additional criteria.
8. The method of claim 7, wherein receiving information associated with the search for data includes receiving information associated with a request for restoring data from a data archive that satisfies certain search criteria.
9. The method of claim 7, wherein identifying data that satisfies the one or more criteria of the search includes identifying data located in at least two distinct secondary copies of data.
10. The method of claim 7, wherein identifying data that satisfies the one or more criteria of the search includes identifying data located in at least two distinct secondary storage media.
11. The method of claim 7, wherein generating a copy of the data that satisfies the criteria of the search includes generating a backup copy of data for a primary data store.
12. The method of claim 7, wherein transferring the generated copy to the secondary storage media includes transferring the generated copy to secondary or tertiary storage media that contains at least a portion of the searched data.
13. A computer-implemented method of restoring information located in secondary or tertiary storage data stores, the method comprising:
receiving, by a computing device, first search terms as part of a request to restore a first data set located in the secondary or tertiary storage data stores,
wherein the first data set includes portions of multiple backup copies of production data stored in the secondary or tertiary storage data stores that are located remotely from the computing device, wherein secondary and tertiary storage data stores are different than a primary storage device for the computing device;
automatically generating second search terms based on a business entity relationship with the first search terms;
identifying a second data set in the secondary or tertiary storage data stores based on the second search terms,
wherein the second search terms include information about subsidiary business entities that are subsidiary with respect to one or more business entities identified in the first set of data;
locating storage media containing the secondary or tertiary data stores and the first data set and the second data set within the secondary or tertiary data stores;
retrieving the first data set and the second data set from the located storage media containing the first data set and the second data set; and
storing the first data set and the second data set to a secondary storage device.
14. The method of claim 13, wherein locating storage media containing the first data set and the second data set includes locating a secondary copy of results of the previous search for information.
15. The method of claim 13, wherein receiving the request to restore the first data set includes receiving a request to restore data produced in a specified time period; and wherein at least a portion of data within the second data set is produced in a time period different than the specified time period.
16. The method of claim 13, wherein receiving the request to restore the first data set includes receiving a request to restore data produced at a specified location; and wherein at least a portion of data within the second data set is produced at a location different than the specified location.
17. The method of claim 13, wherein receiving the request to restore the first data set includes receiving a request to restore data produced by a specified user; and wherein at least a portion of data within the second data set is produced by a user different than the specified user.
18. The method of claim 13, wherein the compliance-related request is associated with a legal discovery request for data whose contents satisfy certain criteria.
19. A computer-implemented method for generating a backup set of search query data, the method comprising:
running, with a computing device, a first query on the content of secondary copies of production data stored in multiple secondary storage devices that are different than a primary storage device of the computing device and that are located remotely from the computing device;
automatically running a second query on the content of the secondary copies based on a type of data defined by the first query and based on a business entity relationship with the first query;
extracting, from the multiple secondary storage devices, data whose content satisfies the first query and the second query,
wherein the second query includes information about subsidiary business entities that are subsidiary with respect to one or more business entities identified in the set of data;
making a copy of the extracted data whose content satisfies the first query and the second query; and
storing the copy of the extracted data whose content satisfies the first query and the second query to make the copy of the extracted data more quickly accessible than running the first query and the second query.
Patent Citations (307)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4686620(A) | 1987-08-01 | Ng | Applicant |
| US4995035(A) | 1991-02-01 | Cole et al. | Applicant |
| US5005122(A) | 1991-04-01 | Griffin et al. | Applicant |
| US5093912(A) | 1992-03-01 | Dong et al. | Applicant |
| US5133065(A) | 1992-07-01 | Cheffetz et al. | Applicant |
| US5193154(A) | 1993-03-01 | Kitajima et al. | Applicant |
| US5212772(A) | 1993-05-01 | Masters | Applicant |
| US5226157(A) | 1993-07-01 | Nakano et al. | Applicant |
| US5239647(A) | 1993-08-01 | Anglin et al. | Applicant |
| US5241668(A) | 1993-08-01 | Eastridge et al. | Applicant |
| US5241670(A) | 1993-08-01 | Eastridge et al. | Applicant |
| US5276860(A) | 1994-01-01 | Fortier et al. | Applicant |
| US5276867(A) | 1994-01-01 | Kenley et al. | Applicant |
| US5287500(A) | 1994-02-01 | Stoppani, Jr. | Applicant |
| US5321816(A) | 1994-06-01 | Rogan et al. | Applicant |
| US5333315(A) | 1994-07-01 | Saether et al. | Applicant |
| US5347653(A) | 1994-09-01 | Flynn et al. | Applicant |
| US5410700(A) | 1995-04-01 | Fecteau et al. | Applicant |
| US5448724(A) | 1995-09-01 | Hayashi | Applicant |
| US5491810(A) | 1996-02-01 | Allen | Applicant |
| US5495607(A) | 1996-02-01 | Pisello et al. | Applicant |
| US5504873(A) | 1996-04-01 | Martin et al. | Applicant |
| US5519865(A) | 1996-05-01 | Kondo et al. | Applicant |
| US5544345(A) | 1996-08-01 | Carpenter et al. | Applicant |
| US5544347(A) | 1996-08-01 | Yanai et al. | Applicant |
| US5559957(A) | 1996-09-01 | Balk | Applicant |
| US5590318(A) | 1996-12-01 | Zbikowski et al. | Applicant |
| US5619644(A) | 1997-04-01 | Crockett et al. | Applicant |
| US5623679(A) | 1997-04-01 | Rivette et al. | Examiner |
| US5638509(A) | 1997-06-01 | Dunphy et al. | Applicant |
| US5673381(A) | 1997-09-01 | Huai et al. | Applicant |
| US5699361(A) | 1997-12-01 | Ding et al. | Applicant |
| US5729743(A) | 1998-03-01 | Squibb | Applicant |
| US5737747(A) | 1998-04-01 | Vishlitzky et al. | Applicant |
| US5751997(A) | 1998-05-01 | Kullick et al. | Applicant |
| US5758359(A) | 1998-05-01 | Saxon | Applicant |
| US5761677(A) | 1998-06-01 | Senator et al. | Applicant |
| US5764972(A) | 1998-06-01 | Crouse et al. | Applicant |
| US5778395(A) | 1998-07-01 | Whiting et al. | Applicant |
| US5812398(A) | 1998-09-01 | Nielsen | Applicant |
| US5813009(A) | 1998-09-01 | Johnson et al. | Applicant |
| US5813017(A) | 1998-09-01 | Morris | Applicant |
| US5829046(A) | 1998-10-01 | Tzelnic et al. | Applicant |
| US5832510(A) | 1998-11-01 | Ito et al. | Applicant |
| US5875478(A) | 1999-02-01 | Blumenau | Applicant |
| US5887134(A) | 1999-03-01 | Ebrahim | Applicant |
| US5892917(A) | 1999-04-01 | Myerson | Applicant |
| US5901327(A) | 1999-05-01 | Ofek | Applicant |
| US5907621(A) | 1999-05-01 | Bachman et al. | Applicant |
| US5918232(A) | 1999-06-01 | Pouschine et al. | Examiner |
| US5924102(A) | 1999-07-01 | Perks | Applicant |
| US5950205(A) | 1999-09-01 | Aviani, Jr. | Applicant |
| US5953721(A) | 1999-09-01 | Doi et al. | Applicant |
| US5974563(A) | 1999-10-01 | Beeler, Jr. | Applicant |
| US6006225(A) | 1999-12-01 | Bowman et al. | Applicant |
| US6021415(A) | 2000-02-01 | Cannon et al. | Applicant |
| US6023710(A) | 2000-02-01 | Steiner et al. | Applicant |
| US6026414(A) | 2000-02-01 | Anglin | Applicant |
| US6052735(A) | 2000-04-01 | Ulrich et al. | Applicant |
| US6061692(A) | 2000-05-01 | Thomas et al. | Applicant |
| US6076148(A) | 2000-06-01 | Kedem | Applicant |
| US6088697(A) | 2000-07-01 | Crockett et al. | Applicant |
| US6092062(A) | 2000-07-01 | Lohman et al. | Examiner |
| US6094416(A) | 2000-07-01 | Ying | Applicant |
| US6131095(A) | 2000-10-01 | Low et al. | Applicant |
| US6131190(A) | 2000-10-01 | Sidwell | Applicant |
| US6148412(A) | 2000-11-01 | Cannon et al. | Applicant |
| US6154787(A) | 2000-11-01 | Urevig et al. | Applicant |
| US6154852(A) | 2000-11-01 | Amundson et al. | Applicant |
| US6161111(A) | 2000-12-01 | Mutalik et al. | Applicant |
| US6167402(A) | 2000-12-01 | Yeager | Applicant |
| US6175829(B1) | 2001-01-01 | Li et al. | Applicant |
| US6212512(B1) | 2001-04-01 | Barney et al. | Applicant |
| US6260069(B1) | 2001-07-01 | Anglin | Applicant |
| US6269431(B1) | 2001-07-01 | Dunham | Applicant |
| US6275953(B1) | 2001-08-01 | Vahalia et al. | Applicant |
| US6301592(B1) | 2001-10-01 | Aoyama et al. | Applicant |
| US6324581(B1) | 2001-11-01 | Xu et al. | Applicant |
| US6328766(B1) | 2001-12-01 | Long | Applicant |
| US6330570(B1) | 2001-12-01 | Crighton | Applicant |
| US6330642(B1) | 2001-12-01 | Carteau | Applicant |
| US6343324(B1) | 2002-01-01 | Hubis et al. | Applicant |
| USRE37601(E) | 2002-03-01 | Eastridge et al. | Applicant |
| US6356801(B1) | 2002-03-01 | Goodman et al. | Applicant |
| US6374336(B1) | 2002-04-01 | Peters et al. | Applicant |
| US6389432(B1) | 2002-05-01 | Pothapragada et al. | Applicant |
| US6418478(B1) | 2002-07-01 | Ignatius et al. | Applicant |
| US6421683(B1) | 2002-07-01 | Lamburt | Applicant |
| US6421711(B1) | 2002-07-01 | Blumenau et al. | Applicant |
| US6421779(B1) | 2002-07-01 | Kuroda et al. | Applicant |
| US6430575(B1) | 2002-08-01 | Dourish et al. | Applicant |
| US6438586(B1) | 2002-08-01 | Hass et al. | Applicant |
| US6487561(B1) | 2002-11-01 | Ofek et al. | Applicant |
| US6487644(B1) | 2002-11-01 | Huebsch et al. | Applicant |
| US6499026(B1) | 2002-12-01 | Rivette et al. | Examiner |
| US6507852(B1) | 2003-01-01 | Dempsey et al. | Applicant |
| US6516314(B1) | 2003-02-01 | Birkler et al. | Applicant |
| US6519679(B2) | 2003-02-01 | Devireddy et al. | Applicant |
| US6538669(B1) | 2003-03-01 | Lagueux, Jr. et al. | Applicant |
| US6542909(B1) | 2003-04-01 | Tamer et al. | Applicant |
| US6542972(B2) | 2003-04-01 | Ignatius et al. | Applicant |
| US6564228(B1) | 2003-05-01 | O'Connor | Applicant |
| US6581143(B2) | 2003-06-01 | Gagne et al. | Applicant |
| US6625623(B1) | 2003-09-01 | Midgley et al. | Applicant |
| US6647396(B2) | 2003-11-01 | Parnell et al. | Applicant |
| US6658436(B2) | 2003-12-01 | Oshinsky et al. | Applicant |
| US6658526(B2) | 2003-12-01 | Nguyen et al. | Applicant |
| US6732124(B1) | 2004-05-01 | Koseki et al. | Applicant |
| US6763351(B1) | 2004-07-01 | Subramaniam et al. | Applicant |
| US6772164(B2) | 2004-08-01 | Reinhardt | Applicant |
| US6775790(B2) | 2004-08-01 | Reuter et al. | Applicant |
| US6785864(B1) | 2004-08-01 | Te et al. | Applicant |
| US6834329(B2) | 2004-12-01 | Sasaki et al. | Applicant |
| US6836779(B2) | 2004-12-01 | Poulin | Applicant |
| US6847984(B1) | 2005-01-01 | Midgley et al. | Applicant |
| US6857053(B2) | 2005-02-01 | Bolik et al. | Applicant |
| US6871163(B2) | 2005-03-01 | Hiller et al. | Applicant |
| US6886020(B1) | 2005-04-01 | Zahavi et al. | Applicant |
| US6947935(B1) | 2005-09-01 | Horvitz et al. | Applicant |
| US6983322(B1) | 2006-01-01 | Tripp et al. | Applicant |
| US6996616(B1) | 2006-02-01 | Leighton et al. | Applicant |
| US7003519(B1) | 2006-02-01 | Biettron et al. | Applicant |
| US7035880(B1) | 2006-04-01 | Crescenti et al. | Applicant |
| US7047236(B2) | 2006-05-01 | Conroy et al. | Applicant |
| US7085787(B2) | 2006-08-01 | Beier et al. | Applicant |
| US7103740(B1) | 2006-09-01 | Colgrove et al. | Applicant |
| US7130860(B2) | 2006-10-01 | Pachet et al. | Applicant |
| US7130970(B2) | 2006-10-01 | Devassy et al. | Applicant |
| US7149750(B2) | 2006-12-01 | Chadwick | Applicant |
| US7165082(B1) | 2007-01-01 | DeVos | Applicant |
| US7167895(B1) | 2007-01-01 | Connelly | Applicant |
| US7171619(B1) | 2007-01-01 | Bianco | Applicant |
| US7181444(B2) | 2007-02-01 | Porter et al. | Applicant |
| US7194454(B2) | 2007-03-01 | Hansen et al. | Applicant |
| US7197502(B2) | 2007-03-01 | Feinsmith | Applicant |
| US7200726(B1) | 2007-04-01 | Gole et al. | Applicant |
| US7240100(B1) | 2007-07-01 | Wein et al. | Applicant |
| US7246207(B2) | 2007-07-01 | Kottomtharayil et al. | Applicant |
| US7246211(B1) | 2007-07-01 | Beloussov et al. | Applicant |
| US7269612(B2) | 2007-09-01 | Devarakonda et al. | Applicant |
| US7272606(B2) | 2007-09-01 | Borthakur et al. | Applicant |
| US7330997(B1) | 2008-02-01 | Odom | Applicant |
| US7343365(B2) | 2008-03-01 | Farnham et al. | Applicant |
| US7346623(B2) | 2008-03-01 | Prahlad et al. | Applicant |
| US7346676(B1) | 2008-03-01 | Swildens et al. | Applicant |
| US7356657(B2) | 2008-04-01 | Mikami | Applicant |
| US7356660(B2) | 2008-04-01 | Matsunami et al. | Applicant |
| US7359917(B2) | 2008-04-01 | Winter et al. | Applicant |
| US7366859(B2) | 2008-04-01 | Per et al. | Applicant |
| US7386663(B2) | 2008-06-01 | Cousins | Applicant |
| US7395282(B1) | 2008-07-01 | Crescenti et al. | Applicant |
| US7430587(B2) | 2008-09-01 | Malone et al. | Applicant |
| US7433301(B2) | 2008-10-01 | Akahane et al. | Applicant |
| US7440966(B2) | 2008-10-01 | Adkins et al. | Applicant |
| US7440984(B2) | 2008-10-01 | Augenstein et al. | Applicant |
| US7454569(B2) | 2008-11-01 | Kavuri et al. | Applicant |
| US7496589(B1) | 2009-02-01 | Jain et al. | Applicant |
| US7500150(B2) | 2009-03-01 | Sharma et al. | Applicant |
| US7509316(B2) | 2009-03-01 | Greenblatt et al. | Applicant |
| US7512601(B2) | 2009-03-01 | Cucerzan et al. | Applicant |
| US7512814(B2) | 2009-03-01 | Chen et al. | Applicant |
| US7529748(B2) | 2009-05-01 | Wen et al. | Applicant |
| US7532340(B2) | 2009-05-01 | Koppich et al. | Applicant |
| US7533103(B2) | 2009-05-01 | Brendle et al. | Applicant |
| US7533181(B2) | 2009-05-01 | Dawson et al. | Applicant |
| US7533230(B2) | 2009-05-01 | Glover et al. | Applicant |
| US7583861(B2) | 2009-09-01 | Hanna et al. | Applicant |
| US7584227(B2) | 2009-09-01 | Gokhale et al. | Applicant |
| US7590997(B2) | 2009-09-01 | Diaz Perez | Applicant |
| US7613728(B2) | 2009-11-01 | Png et al. | Applicant |
| US7613752(B2) | 2009-11-01 | Prahlad et al. | Applicant |
| US7617541(B2) | 2009-11-01 | Plotkin et al. | Applicant |
| US7620710(B2) | 2009-11-01 | Kottomtharayil et al. | Applicant |
| US7624443(B2) | 2009-11-01 | Kramer et al. | Applicant |
| US7627598(B1) | 2009-12-01 | Burke | Applicant |
| US7627617(B2) | 2009-12-01 | Kavuri et al. | Applicant |
| US7631151(B2) | 2009-12-01 | Prahlad et al. | Applicant |
| US7634478(B2) | 2009-12-01 | Yang et al. | Applicant |
| US7657550(B2) | 2010-02-01 | Prahlad et al. | Applicant |
| US7660800(B2) | 2010-02-01 | Prahlad et al. | Applicant |
| US7660807(B2) | 2010-02-01 | Prahlad et al. | Applicant |
| US7668798(B2) | 2010-02-01 | Scanlon et al. | Applicant |
| US7668884(B2) | 2010-02-01 | Prahlad et al. | Applicant |
| US7672962(B2) | 2010-03-01 | Arrouye et al. | Applicant |
| US7693856(B2) | 2010-04-01 | Arrouye et al. | Applicant |
| US7707178(B2) | 2010-04-01 | Prahlad et al. | Applicant |
| US7711700(B2) | 2010-05-01 | Prahlad et al. | Applicant |
| US7716171(B2) | 2010-05-01 | Kryger | Applicant |
| US7716191(B2) | 2010-05-01 | Blumenau et al. | Applicant |
| US7720801(B2) | 2010-05-01 | Chen | Applicant |
| US7725605(B2) | 2010-05-01 | Palmeri et al. | Applicant |
| US7725671(B2) | 2010-05-01 | Prahlad et al. | Applicant |
| US7734593(B2) | 2010-06-01 | Prahlad et al. | Applicant |
| US7734669(B2) | 2010-06-01 | Kottomtharayil et al. | Applicant |
| US7734715(B2) | 2010-06-01 | Hyakutake et al. | Applicant |
| US7747579(B2) | 2010-06-01 | Prahlad et al. | Applicant |
| US7756837(B2) | 2010-07-01 | Williams et al. | Applicant |
| US7801864(B2) | 2010-09-01 | Prahlad et al. | Applicant |
| US7818215(B2) | 2010-10-01 | King et al. | Applicant |
| US7822749(B2) | 2010-10-01 | Prahlad et al. | Applicant |
| US7831553(B2) | 2010-11-01 | Prahlad et al. | Applicant |
| US7831622(B2) | 2010-11-01 | Prahlad et al. | Applicant |
| US7831795(B2) | 2010-11-01 | Prahlad et al. | Applicant |
| US7840537(B2) | 2010-11-01 | Gokhale et al. | Applicant |
| US7840619(B2) | 2010-11-01 | Horn | Applicant |
| US7841011(B2) | 2010-11-01 | Manson et al. | Examiner |
| US7849059(B2) | 2010-12-01 | Prahlad et al. | Applicant |
| US7890467(B2) | 2011-02-01 | Watanabe et al. | Applicant |
| US7890469(B1) | 2011-02-01 | Maionchi et al. | Applicant |
| US7925856(B1) | 2011-04-01 | Greene | Applicant |
| US7933920(B2) | 2011-04-01 | Kojima et al. | Applicant |
| US7962709(B2) | 2011-06-01 | Agrawal | Applicant |
| US7966495(B2) | 2011-06-01 | Ackerman et al. | Applicant |
| US8041677(B2) | 2011-10-01 | Sumner et al. | Applicant |
| US8051045(B2) | 2011-11-01 | Vogler | Applicant |
| US8229954(B2) | 2012-07-01 | Kottomtharayil et al. | Applicant |
| US2001/0047365(A1) | 2001-11-01 | Yonaitis | Applicant |
| US2002/0049626(A1) | 2002-04-01 | Mathias et al. | Applicant |
| US2002/0069324(A1) | 2002-06-01 | Gerasimov et al. | Applicant |
| US2002/0087550(A1) | 2002-07-01 | Carlyle et al. | Applicant |
| US2002/0147734(A1) | 2002-10-01 | Shoup et al. | Applicant |
| US2002/0161753(A1) | 2002-10-01 | Inaba et al. | Applicant |
| US2003/0018607(A1) | 2003-01-01 | Lennon et al. | Applicant |
| US2003/0046313(A1) | 2003-03-01 | Leung et al. | Applicant |
| US2003/0101183(A1) | 2003-05-01 | Kabra et al. | Applicant |
| US2003/0130993(A1) | 2003-07-01 | Mendelevitch et al. | Applicant |
| US2003/0182583(A1) | 2003-09-01 | Turco | Applicant |
| US2004/0015514(A1) | 2004-01-01 | Melton et al. | Applicant |
| US2004/0254919(A1) | 2004-12-01 | Giuseppini | Applicant |
| US2004/0260678(A1) | 2004-12-01 | Verbowski et al. | Applicant |
| US2004/0260973(A1) | 2004-12-01 | Michelman | Examiner |
| US2005/0010588(A1) | 2005-01-01 | Zalewski et al. | Applicant |
| US2005/0050075(A1) | 2005-03-01 | Okamoto et al. | Applicant |
| US2005/0055352(A1) | 2005-03-01 | White et al. | Applicant |
| US2005/0055386(A1) | 2005-03-01 | Tosey | Applicant |
| US2005/0086231(A1) | 2005-04-01 | Moore | Applicant |
| US2005/0154695(A1) | 2005-07-01 | Gonzalez et al. | Applicant |
| US2005/0187937(A1) | 2005-08-01 | Kawabe et al. | Applicant |
| US2005/0188248(A1) | 2005-08-01 | O'Brien et al. | Applicant |
| US2005/0216453(A1) | 2005-09-01 | Sasaki et al. | Applicant |
| US2005/0228794(A1) | 2005-10-01 | Navas et al. | Applicant |
| US2005/0262097(A1) | 2005-11-01 | Sim-Tang et al. | Applicant |
| US2006/0004820(A1) | 2006-01-01 | Claudatos et al. | Applicant |
| US2006/0010227(A1) | 2006-01-01 | Atluri | Applicant |
| US2006/0224846(A1) | 2006-10-01 | Amarendran et al. | Applicant |
| US2006/0230082(A1) | 2006-10-01 | Jasrasaria | Applicant |
| US2006/0259468(A1) | 2006-11-01 | Brooks et al. | Applicant |
| US2006/0259527(A1) | 2006-11-01 | Devarakonda et al. | Applicant |
| US2007/0033191(A1) | 2007-02-01 | Hornkvist et al. | Applicant |
| US2007/0043956(A1) | 2007-02-01 | El Far et al. | Applicant |
| US2007/0067304(A1) | 2007-03-01 | Ives | Applicant |
| US2007/0100867(A1) | 2007-05-01 | Celik et al. | Applicant |
| US2007/0174273(A1) | 2007-07-01 | Jones et al. | Examiner |
| US2007/0185915(A1) | 2007-08-01 | Prahlad et al. | Applicant |
| US2007/0185926(A1) | 2007-08-01 | Prahlad et al. | Applicant |
| US2007/0192385(A1) | 2007-08-01 | Prahlad et al. | Applicant |
| US2007/0203938(A1) | 2007-08-01 | Prahlad et al. | Applicant |
| US2007/0282680(A1) | 2007-12-01 | Davis et al. | Applicant |
| US2007/0288536(A1) | 2007-12-01 | Sen et al. | Applicant |
| US2008/0059495(A1) | 2008-03-01 | Kiessig et al. | Applicant |
| US2008/0059515(A1) | 2008-03-01 | Fulton | Applicant |
| US2008/0077594(A1) | 2008-03-01 | Ota | Applicant |
| US2008/0091655(A1) | 2008-04-01 | Gokhale et al. | Applicant |
| US2008/0091747(A1) | 2008-04-01 | Prahlad et al. | Applicant |
| US2008/0183662(A1) | 2008-07-01 | Reed et al. | Applicant |
| US2008/0228771(A1) | 2008-09-01 | Prahlad et al. | Applicant |
| US2008/0229037(A1) | 2008-09-01 | Bunte et al. | Applicant |
| US2008/0243796(A1) | 2008-10-01 | Prahlad et al. | Applicant |
| US2008/0249996(A1) | 2008-10-01 | Prahlad et al. | Applicant |
| US2008/0294605(A1) | 2008-11-01 | Prahlad et al. | Applicant |
| US2009/0287665(A1) | 2009-11-01 | Prahlad et al. | Applicant |
| US2009/0319534(A1) | 2009-12-01 | Gokhale | Applicant |
| US2009/0319585(A1) | 2009-12-01 | Gokhale | Applicant |
| US2010/0057870(A1) | 2010-03-01 | Ahn et al. | Applicant |
| US2010/0082672(A1) | 2010-04-01 | Kottomtharayil et al. | Applicant |
| US2010/0114952(A1) | 2010-05-01 | Scanlon et al. | Applicant |
| US2010/0131461(A1) | 2010-05-01 | Prahlad et al. | Applicant |
| US2010/0179941(A1) | 2010-07-01 | Agrawal et al. | Applicant |
| US2010/0205150(A1) | 2010-08-01 | Prahlad et al. | Applicant |
| US2010/0250549(A1) | 2010-09-01 | Muller et al. | Applicant |
| US2010/0299490(A1) | 2010-11-01 | Attarde et al. | Applicant |
| US2011/0047180(A1) | 2011-02-01 | Prahlad et al. | Applicant |
| US2011/0093470(A1) | 2011-04-01 | Gokhale et al. | Applicant |
| US2011/0181383(A1) | 2011-07-01 | Lotfi et al. | Applicant |
| US2011/0276664(A1) | 2011-11-01 | Prahlad et al. | Applicant |
| US2012/0215745(A1) | 2012-08-01 | Prahlad et al. | Applicant |
| EP259912(A1) | 1988-03-01 | Applicant | |
| EP405926(A2) | 1991-01-01 | Applicant | |
| EP467546(A2) | 1992-01-01 | Applicant | |
| EP774715(A1) | 1997-05-01 | Applicant | |
| EP809184(A1) | 1997-11-01 | Applicant | |
| EP899662(A1) | 1999-03-01 | Applicant | |
| EP981090(A1) | 2000-02-01 | Applicant | |
| EP1174795 | 2002-01-01 | Applicant | |
| WO-9412944 | 1994-06-01 | Applicant | |
| WO-9513580(A1) | 1995-05-01 | Applicant | |
| WO-9912098(A1) | 1999-03-01 | Applicant | |
| WO-9914692(A1) | 1999-03-01 | Applicant | |
| WO-0106368(A1) | 2001-01-01 | Applicant | |
| WO-0193537 | 2001-12-01 | Applicant | |
| WO-03060774(A1) | 2003-07-01 | Applicant | |
| WO-2004010375(A3) | 2004-06-01 | Applicant | |
| WO-2004063863(A3) | 2005-03-01 | Applicant | |
| WO-2005055093(A2) | 2005-06-01 | Applicant | |
| WO-2007062254(A2) | 2007-05-01 | Applicant | |
| WO-2007062429(A2) | 2007-05-01 | Applicant | |
| WO-2008049023(A2) | 2008-04-01 | Applicant |
Non-Patent Literature (38)
- Harrison, CDIA Training & Test Preparation Guide 2000, Specialized Solutions, p. 52.Examiner
- Quick Reference Guide for West and EAST [date unknown, but verified as of Sep. 13, 2007], Search and Information Resource Administration, 2 pages.Examiner
- User's Manual for the Examiners Automated Search Tool (EAST) Jul. 22, 1999, Version 1.0, 179 pages.Examiner
- iSeries information Center date unknown [Accessed on Aug. 20, 2013], IBM, http://publib.boulder.ibm.com/infocenter/iseries/v5r3/index.jsp?topic=%2Frzam4%2Frzam4tapevsoptical.htmExaminer
- U.S. Appl. No. 13/538,862, filed Jun. 29, 2012, Prahlad et al.Applicant
- U.S. Appl. No. 13/616,197, filed Sep. 14, 2012, Prahlad et al.Applicant
- “Titus Labs—Announces Document Classification for Microsoft Word” Nov. 3, 2005 (Nov. 3, 2005), XP55034835, available at http://web.archive.org/web/20051126093136/http://www.titus-labs.com/about/DocClassRelease.html, 1 page.Applicant
- Titus Labs Document Classification V1.1 for Microsoft Word—Document Policy Enforcement, avaliable at: <http://web.archive.org/web/20060104112621/www.titus-labs.com/includes/PDF/DocClassDataSheet.pdf>, Nov. 3, 2005, 2 pages.Applicant
- U.S. Appl. No. 12/978,050, filed Dec. 23, 2012, Pawar.Applicant
- U.S. Appl. No. 13/076,634, filed Mar. 31, 2011, Prahlad et al.Applicant
- U.S. Appl. No. 13/077,516, filed Mar. 3, 2011, Prahlad et al.Applicant
- “Text Figures”, retrieved from http://www.microsoft.com/msj/1198.ntfs/ntfstextfigs.htm on Nov. 10, 2005, 7 pages.Applicant
- Armstead et al., “Implementation of a Campus-wide Distributed Mass Storage Service: The Dream vs. Reality,” IEEE, 1995, pp. 190-199.Applicant
- Arneson, “Mass Storage Archiving in Network Environments,” Digest of Papers, Ninth IEEE Symposium on Mass Storage Systems, Oct. 31, 1988-Nov. 3, 1988, pp. 45-50, Monterey, CA.Applicant
- Arneson, David A., “Development of Omniserver,” Control Data Corporation, Tenth IEEE Symposium on Mass Storage Systems, May 1990, ‘Crisis in Mass Storage’ Digest of Papers, pp. 88-93, Monterey, CA.Applicant
- Bowman et al. “Harvest: A Scalable, Customizable Discovery and Access System,” Department of Computer Science, University of Colorado—Boulder, Revised Mar. 1995, 29 pages.Applicant
- Brad O'Neill, “New Tools to Classify Data,” Storage Magazine, Aug. 2005, 4 pages.Applicant
- 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, 1995-Mar. 9, 1995, pp. 420-427, San Francisco, CA.Applicant
- Communication with extended European Search Report for Application No. PCT/US2006/061304, dated Dec. 30, 2008.Applicant
- Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,” IEEE, 1994, pp. 124-126.Applicant
- EMC Corporation, “Today's Choices for Business Continuity,” 2004, 12 pages.Applicant
- European Patent Office Examination Report for EP application 06846386.8, Mail Date Apr. 29, 2009, 6 pages.Applicant
- Farley, M., “Storage Network Fundamentals,, Network Backup: The Foundation of Storage Management, Data Management,” Storage Networking Fundamentals: an Introduction to Storage Devices, Subsystems, Applications, Management, and Filing [File] Systems, Cisco Press, Jan. 1, 2005, 9 pages.Applicant
- Jander, M., “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4 (Mar. 21, 1998), pp. 64-72.Applicant
- Jason Gait, “The Optical File Cabinet: A Random-Access File System for Write-Once Optical Disks,” IEEE Computer, vol. 21, No. 6, pp. 11-22 (1988) (see in particular figure 5 in p. 15 and recitation in claim 5).Applicant
- Jeffrey Cooperstein and Jeffrey Richter, “Keeping an Eye on Your NTFS Drives, Part II: Building a Change Journal Application,” Microsoft Systems Journal, Oct. 1999, 14 pages.Applicant
- Jeffrey Cooperstein and Jeffrey Richter, “Keeping an Eye on Your NTFS Drives: the Windows 2000 Change Journal Explained,” Microsoft Systems Journal, Sep. 1999, 17 pages.Applicant
- Jeffrey Richter and Luis Felipe Cabrera, “A File System for the 21st Century: Previewing the Windows NT 5.0 File System,” and attached text figures, Microsoft Systems Journal, Nov. 1998, 24 pages.Applicant
- Karl Langdon and John Merryman, “Data Classification: Getting Started,” Storage Magazine, Jul. 2005, 3 pages.Applicant
- Manber et al., “WebGlimpse—Combining Browsing and Searching,” 1997 Usenix Technical Conference, Jan., 1997, 12 pages.Applicant
- Microsoft Developer Network, “GetFileAttributes,” online library article, [accessed on Nov. 10, 2005], 3 pages.Applicant
- Microsoft Developer Network, “GetFileAttributesEx,” online library article, [accessed on Nov. 10, 2005], 2 pages.Applicant
- Microsoft Developer Network, “Win32—File—Attribute—Data,” online library article, [accessed on Nov. 10, 2005], 3 pages.Applicant
- Partial International Search Results, mailed May 25, 2007, International Application No. PCT/US2006/045556, 2 pages.Applicant
- 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).Applicant
- Supplementary European Search Report for European Application EP06846386, Dated Dec. 20, 2008, European Patent Office, 6 pages.Applicant
- Bhagwan, R. et al. “Total Recall: System Support for Automated Availability Management,” Proceedings of the 1st Conference on Symposium on Networked Systems Design and Implementation, vol. 1, Mar. 3, 2004, XP055057350, Berkeley, CA, 14 pages.Applicant
- Extended European Search Report for European Application No. EP11003795, Mail Date Nov. 21, 2012, 20 pages.Applicant