Data previewing before recalling large data files

Information

  • Patent Grant
  • 10157184
  • Patent Number
    10,157,184
  • Date Filed
    Wednesday, March 13, 2013
    13 years ago
  • Date Issued
    Tuesday, December 18, 2018
    7 years ago
Abstract
Techniques for providing data preview before recalling large data files are disclosed. In one aspect, a data file is made accessible while being offline by converting the data file from a native format to a preview format, storing the data file in the preview format in a primary storage that is locally available and moving, after the conversion to the preview format, the data file in the native format to a secondary storage. When a viewing request is received for the data file, the data file in the preview format is displayed to fulfill the viewing request.
Description
BACKGROUND

A primary copy of data is generally a production copy or other “live” version of the data which is used by a software application and is generally in the native format of that application. Primary copy data may be maintained in a local memory or other high-speed storage device that allows for relatively fast data access if necessary. Such primary copy data is typically intended for short term retention (e.g., several hours or days) before some or all of the data is stored as one or more secondary copies, for example, to prevent loss of data in the event a problem occurred with the data stored in primary storage.


To protect primary copy data or for other purposes, such as regulatory compliance, secondary copies (alternatively referred to as “data protection copies”) can be made. Examples of secondary copies include a backup copy, a snapshot copy, a hierarchical storage management (“HSM”) copy, an archive copy, and other types of copies.


A backup copy is generally a point-in-time copy of the primary copy data stored in a backup format as opposed to in native application format. For example, a backup copy may be stored in a backup format that is optimized for compression and for efficient long-term storage. Backup copies generally have relatively long retention periods and may be stored on media with slower retrieval times than other types of secondary copies and media. In some cases, backup copies may be stored at an offsite location.


After an initial, full backup of a data set is performed, periodic, intermittent, or continuous incremental backup operations may be subsequently performed on the data set. Each incremental backup operation copies only the primary copy data that has changed since the last full or incremental backup of the data set was performed. In this way, even if the entire set of primary copy data that is backed up is large, the amount of data that must be transferred during each incremental backup operation may be significantly smaller, since only the changed data needs to be transferred to secondary storage. Combined, one or more full backup and subsequent incremental copies may be utilized together to periodically or intermittently create a synthetic full backup copy. More details regarding synthetic storage operations are found in commonly-assigned U.S. patent application Ser. No. 12/510,059, entitled “Snapshot Storage and Management System with Indexing and User Interface,” filed Jul. 27, 2009, now U.S. Pat. No. 7,873,806, which is hereby incorporated by reference herein in its entirety.


An archive copy is generally a copy of the primary copy data, but typically includes only a subset of the primary copy data that meets certain criteria and is usually stored in a format other than the native application format. For example, an archive copy might include only that data from the primary copy that is larger than a given size threshold or older than a given age threshold and that is stored in a backup format. Often, archive data is removed from the primary copy, and a stub is stored in the primary copy to indicate its new location. When a user requests access to the archive data that has been removed or migrated, systems use the stub to locate the data and often make recovery of the data appear transparent, even though the archive data may be stored at a location different from the remaining primary copy data.


Archive copies are typically created and tracked independently of other secondary copies, such as other backup copies. For example, to create a backup copy, the data storage system transfers a secondary copy of primary copy data to secondary storage and tracks the backup copy using a backup index separate from the archive index. To create an archive copy, a conventional data storage system transfers the primary copy data to be archived to secondary storage to create an archive copy, replaces the primary copy data with a stub, and tracks the archive copy using an archive index. Accordingly, the data storage system will transfer two separate times to secondary storage a primary copy data object that is both archived and backed-up.


Since each transfer consumes network and computing resources, when the transfers are taking place, the data storage system may not be able to devote such resources to other tasks. Moreover, the data storage system is required to devote resources to maintaining each separate index. In some cases, the archive index may be unaware of the other secondary copy and the other secondary index may be unaware of the archive copy, which may lead to further inefficiencies. Moreover, in some cases, in the event that an archive copy is moved or transferred (e.g., to another tier of secondary storage), the archive index may not be able to be updated to reflect the move or transfer. In such cases, the data storage system may be unable to use the stub to locate the archived data object.


In some operational scenarios, a user may want to browse through files to either take a quick look at the content or identify a particular file that the user is interested in, before the user decides to recall the entire file from a secondary backup or an archive, or open the file for reading or writing using the native application for the file.


Recently, Apple Computers has introduced a facility called “Quick Look” in their computer products. Quick Look allows users to look at the contents of a file in a finder application window at full or near-full size resolution, depending on the size of the document relative to the desktop. Quick Look allows viewing of files in different formats such as PDFs and Microsoft Word, Excel, and PowerPoint file formats. While Quick Look allows quick navigation through various files, no storage efficiencies are gained by using the Quick Look format.


Another problem relates to data storage on mobile devices. Often, data storage on mobile devices is not optimized. Since mobile devices often have limited storage capacity, such lack of optimization affects performance of the device, affects the user experience, etc.


The need exists for systems and methods that overcome the above problems, as well as systems and methods that provide additional benefits. Overall, the examples herein of some prior or related systems and methods and their associated limitations are intended to be illustrative and not exclusive. Other limitations of existing or prior systems and methods will become apparent to those of skill in the art upon reading the following Detailed Description.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram illustrating an example of suitable information management environment in which aspects of the inventive system may operate.



FIG. 2 illustrates examples of production and non-production data that may be processed by the information management environment of FIG. 1.



FIG. 3 is a block diagram illustrating one example of a hierarchical arrangement of resources for the information management system of FIG. 1, including information management cells.



FIG. 4 is a block diagram illustrating an example of resources forming an information management cell.



FIG. 5 is an example screen shot showing files available to a user.



FIG. 6 is an example of menu options available to a user for interacting with a stored file.



FIG. 7 is an example data structure used for storage of preview files.



FIG. 8 is a flow chart representation of a process of providing offline access to a data object.



FIG. 9 is a flow chart representation of a process of managing storage capacity on a computer.



FIG. 10 is a flow chart representation of a process of synchronizing files stored on a user device.



FIG. 11 is a flow chart representation of a smart archiving process implementable on a mobile device.





DETAILED DESCRIPTION

The techniques disclosed in this document are useful, in one aspect, in solving the above-discussed problems related to browsing through large data files before recalling the data files from a secondary storage. In another aspect, the disclosed techniques can be used to convert large data files from their native format (e.g., an MPEG (Moving Pictures Expert Group) video file, or a PowerPoint file, etc,) to a preview format. The converted preview format copy, for example, may require significantly lower storage space and require less bandwidth to transfer between devices. In some implementations, the converted preview format copy may disable the ability to select and copy text or images from the file, but may still allow a low-resource way for a user to browse through the content of the file. When some of the files that the user browses may be relatively large and may be archived in a secondary storage, a user's browsing through such files may use network resources such as Input/Output bandwidth and processing power. The use of file copies in a preview format, also called stub files, in one aspect, reduce the amount of computational resources needed for a user's file browsing operation.


The headings provided herein are for convenience only and do not necessarily affect the scope or meaning of the disclosure.


Overview


A software, firmware, and/or hardware system for facilitating data previewing before recalling large data files are disclosed. Also disclosed a software, firmware, and/or hardware system to keep devices “clean” by archiving or moving to secondary storage unused data and applications.


Various examples of the techniques will now be described. The following description provides specific details for a thorough understanding and enabling description of these examples. One skilled in the relevant art will understand, however, that the invention may be practiced without many of these details. Likewise, one skilled in the relevant art will also understand that the invention may include many other obvious features not described in detail herein. Additionally, some well-known structures or functions may not be shown or described in detail below, so as to avoid unnecessarily obscuring the relevant description.


The terminology used below is to be interpreted in its broadest reasonable manner, even though it is being used in conjunction with a detailed description of certain specific examples of the invention. Indeed, 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.


Information Management Environment


Aspects of the technologies described herein may be practiced in an information management environment 100, which will now be described while referencing FIG. 1. As shown in FIG. 1, the environment 100 includes multiple computing devices that execute numerous software applications to facilitate the operations of an organization (or multiple affiliated organizations), such as a household, corporation or other business entity, a non-profit organization, an educational institution, or a governmental agency. The computing devices may include one or more: servers 105 (such as mail servers, file servers, database servers, print servers, and web servers), personal computers 110, workstations 115, or other types of fixed computing systems such as mainframe computers and minicomputers (not shown). The servers 105 may include network-attached storage (NAS) filers.


The environment 100 may include virtualized computing resources, such as a virtual machine 120 provided to the organization by a third-party cloud service vendor or a virtual machine 125 running on a virtual machine host 130 operated by the organization. For example, the organization may use one virtual machine 125A as a database server and another virtual machine 125B as a mail server. The environment 100 may also include mobile or portable computing devices, such as laptops 135, tablet computers 140, personal data assistants 145, mobile phones 152 (such as smartphones), and other mobile or portable computing devices such as embedded computers, set top boxes, vehicle-mounted devices, wearable computers, etc.


Of course, other types of computing devices may form part of the environment 100. As part of their function, each of these computing devices creates, accesses, modifies, writes, and otherwise uses production copies of data and metadata that are typically stored in a persistent storage medium having fast I/O times. For example, each computing device may regularly access and modify data files and metadata stored on semiconductor memory, a local disk drive or a network-attached storage device. Each of these computing devices may access data and metadata via a file system supported by an operating system of the computing device.


The environment 100 may also include hosted services 122 that provide various online services to the organization or its constituent members (e.g., the organization's departments, employees, independent contractors, etc.) such as social networking services (e.g., Facebook, Twitter, Pinterest), hosted email services (e.g., Gmail, Yahoo Mail, Hotmail), or hosted productivity applications or other hosted applications (e.g., Microsoft Office 365, Google Docs, Salesforce.com). Hosted services may include software-as-a-service (SaaS), platform-as-a-service (PaaS), application service providers (ASPs), cloud services, and all manner of delivering computing or functionality via a network. As it provides services to users, each hosted service may generate additional “hosted data and metadata” that is associated with each user. For example, Facebook may generate and store photos, wall posts, notes, videos, and other content that are associated with a particular Facebook user's account.


The organization directly or indirectly employs an information management system 150 to protect and manage the data and metadata used by the various computing devices in the environment 100 and the data and metadata that is maintained by hosted services on behalf of users associated with the organization. One example of an information management system is the CommVault Simpana system, available from CommVault Systems, Inc. of Oceanport, N.J. The information management system creates and manages non-production copies of the data and metadata to meet information management goals, such as: permitting the organization to restore data, metadata or both data and metadata if an original copy of the data/metadata is lost (e.g., by deletion, corruption, or disaster, or because of a service interruption by a hosted service); allowing data to be recovered from a previous time; complying with regulatory data retention and electronic discovery (“e-discovery”) requirements; reducing the amount of data storage media used; facilitating data organization and search; improving user access to data files across multiple computing devices and/or hosted services; and implementing information lifecycle management (“ILM”) or other data retention policies for the organization. The information management system 150 may create the additional non-production copies of the data and metadata on any suitable non-production storage medium such as magnetic disks 155, magnetic tapes 160, other storage media 165 such as solid-state storage devices or optical disks, or on cloud data storage sites 170 (e.g. those operated by third-party vendors). Further details on the information management system may be found in the assignee's U.S. patent application Ser. No. 12/751,850, filed Mar. 31, 2010 entitled DATA OBJECT STORE AND SERVER FOR A CLOUD STORAGE ENVIRONMENT, INCLUDING DATA DEDUPLICATION AND DATA MANAGEMENT ACROSS MULTIPLE CLOUD STORAGE SITES, now U.S. Patent Publication Number 2010/0332456, which is hereby incorporated herein by reference in its entirety.



FIG. 2 helps illustrates some differences between “production copies” of data and metadata and “non-production copies” of data and metadata in the data management environment 100. As shown, each computing device 205 in the environment 100 has at least one operating system 210 installed and one or more applications 215A-D, such as mail server applications, file server applications, mail client applications, database applications, word processing applications, spreadsheet applications, presentation applications, browser applications, mobile applications, entertainment applications, and so on. Each application can access and modify various production copies of files stored in a production data storage medium 218, which may be a network attached storage filer or form part of a Hadoop distributed file system, Open VMS file system, or other type of distributed file system, simply by making conventional file system calls via the operating system 210, without needing the information management system 150 to intervene on behalf of the operating system or application. The production copies of files may include structured data (e.g., database files), unstructured data (e.g., documents), and/or semi-structured data, and thus may include one or more documents 220A-B, spreadsheets 225, presentation documents 230, video files 232, image files 234, email mailboxes 235, html/xml or other types of markup language files 222, and/or databases 240. The operating system 210 may also access and modify production copies of files and other data, such as files in a system volume and/or boot volume. The hosted data and metadata used by a hosted service are also “production copies” of data and metadata since the hosted service accesses and modifies the user's data and metadata as part of its services. Production copies of data may include not only files, but also subsets of files, each of which a related application 215 or the operating system 210 treats as an independent functional unit, but which is not separately addressed in the associated file system. For example, a single email mailbox 235 may include multiple email messages 245A-C, email headers, and attachments. As another example, a single database 240 may include multiple tables 255A-C. As used herein, a “data object” refers to both (1) any file that is currently or previously addressable by a file system and (2) a functional subset of such a file that has a particular function for a related application 215A-D or the operating system 210. Each data object may be further decomposed into one or more data blocks each of which is a collection of data bits within the data object that may not have any particular function for a related application or the operating system. In addition to data objects, the operating system 210 and applications 215A-D may also access and modify production copies of metadata, such as boot sectors, partition layouts, file or data object metadata (e.g., file name, file size, creation/modification/access timestamps, file location within a file folder directory structure, user permissions, owners, groups, access control lists (“ACLs”)), and system metadata (e.g., registry information). In addition to metadata generated by or related to file systems and operating systems, some applications maintain indices of production metadata for data objects, e.g., metadata associated with individual email messages. Thus, as shown in FIG. 2, each data object may be associated with a production copy of object metadata (“Meta1-11”), which may be file system metadata and/or application-specific metadata.


The information management system 150 accesses or receives copies of the various production copies of data objects and metadata, and via an information management operation (such as a backup operation, archive operation, or snapshot operation), creates non-production copies of these data objects and metadata, often stored in one or more non-production storage mediums 265 different than the production storage medium 218 where the production copies of the data objects and metadata reside. A non-production copy of a data object represents the production data object and its associated metadata at a particular point in time (non-production objects 260A-C). Since a production copy of a data object or metadata changes over time as it is modified by an application 215, hosted service 122, or the operating system 210, the information management system 150 may create and manage multiple non-production copies of a particular data object or metadata, each representing the state of the production data object or metadata at a particular point in time. Moreover, since a production copy of a data object may eventually be deleted from the production data storage medium and the file system from which it originated, the information management system may continue to manage point-in-time representations of that data object, even though a production copy of the data object itself no longer exists.


For virtualized computing devices, such as virtual machines, the operating system 210 and applications 215A-D may be running on top of virtualization software, and the production data storage medium 218 may be a virtual disk created on a physical medium such as a physical disk. The information management system may create non-production copies of the discrete data objects stored in a virtual disk file (e.g., documents, email mailboxes, and spreadsheets) and/or non-production copies of the entire virtual disk file itself (e.g., a non-production copy of an entire .vmdk file).


Each non-production object 260A-C may contain copies of or otherwise represent more than one production data object. For example, non-production object 260A represents three separate production data objects 255C, 230 and 245C (represented as 245C′, 230′ and 245′, respectively). Moreover, as indicated by the prime mark (′), a non-production object may store a representation of a production data object or metadata differently than the original format of the data object or metadata, e.g., in a compressed, encrypted, deduplicated, or otherwise optimized format. Although FIG. 2 shows that a single production data object (e.g., 255C), and its associated data object metadata (e.g., Meta11) are represented by the contents of only a single non-production object (e.g., 260A), the entire contents of a single production data object and/or its metadata at a particular point in time may instead span across numerous non-production objects. Also a single non-production object 260 may contain copies of or otherwise represent production data objects that originated from different computing devices.


Non-production copies include backup copies, archive copies, and snapshot copies. Backup copies are generally used for shorter-term data protection and restoration purposes and may be in a native application format or in a non-native format (e.g., compressed, encrypted, deduplicated, and/or otherwise modified from the original application format). Archive copies are generally used for long-term data storage purposes and may be compressed, encrypted, deduplicated and/or otherwise modified from the original application format. In some examples, when an archive copy of a data object is made, a logical reference or stub may be used to replace the production copy of the data object in the production storage medium 218. In such examples, the stub may point to or otherwise reference the archive copy of the data object stored in the non-production storage medium so that the information management system can retrieve the archive copy if needed. The stub may also include some metadata associated with the data object, so that a file system and/or application can provide some information about the data object and/or a limited-functionality version (e.g., a preview) of the data object. A snapshot copy represents a data object at a particular point in time. A snapshot copy can be made quickly and without significantly impacting production computing resources because large amounts of data need not be copied or moved. A snapshot copy may include a set of pointers derived from the file system or an application, where each pointer points to a respective stored data block, so collectively, the set of pointers reflect the storage location and state of the data object at a particular point in time when the snapshot copy was created. In “copy-on-write”, if a block of data is to be deleted or changed, the snapshot process writes the block to a particular data storage location, and the pointer for that block is now directed to that particular location. The set of pointers and/or the set of blocks pointed to by a snapshot may be stored within the production data storage medium 218.


Non-production copies of a data object or metadata may be distinguished from a production copy of a data object or metadata in several ways. First, a non-production copy of a data object is created to meet the different information management goals described above and is not directly used or modified by applications 215A-D, hosted services 122, or the operating system 210. Second, a non-production copy of a data object is stored as one or more non-production objects 260 that may have a format different from the native application format of the production copy of the data object, and thus often cannot be directly used by the native application or a hosted service 122 without first being modified. Third, non-production objects are often stored on a non-production storage medium 265 that is inaccessible to the applications 215A-D running on computing devices and hosted services 122. Also, some non-production copies may be “offline copies,” in that they are not readily available (e.g. not mounted tape or disk.) Offline copies include copies of data that the information management system can access without any human intervention (e.g. tapes within an automated tape library, but not yet mounted in a drive), and copies that the information management system 150 can access only with at least some human intervention (e.g. tapes located at an offsite storage site).


The information management system 150 also generates information management data 275, such as indexing information, which permit the information management system to perform its various information management tasks. As shown in FIG. 2, a computing device 205 may include one or more data management agents 280 that provide client-side functions for the information management system.


Information Management System



FIG. 3 shows a hierarchical arrangement of resources that may form an information management system 150. As shown, the information management system 150 includes multiple information management cells 350 arranged in a hierarchy, with some information management cells (e.g., 350D-E) subordinate to other information management cells (e.g., 350B). A global storage manager 305, which may form part of a global information cell 350x, manages the overall hierarchy of information management cells by receiving reports from the various subordinate information management cells related to the operation of the cells, determining global information management policies in light of received reports, and pushing information management policies towards subordinate cells for implementation. The global storage manager may also maintain and disseminate, to the various cells, system-wide information management data. A superior information management cell (e.g., 350B), may perform similar tasks for its subordinate cells (e.g., 350D-E) and/or otherwise act as an intermediary between the subordinate cells and the global storage manager 305.


Information Management Cell



FIG. 4 shows an arrangement of resources that may form an information management cell 350. As shown, the information management cell includes a storage manager 402, one or more media agents 410A-M, one or more non-production storage mediums 155-870, one or more computing devices 205A-N, and one or more production data storage mediums 218A-N. Outside of the information management cell are hosted services 122, which may interact with media agents 410 and its components, as described further herein. In some examples, all or a portion of an information management cell may be implemented as an object store, as described in assignee's U.S. patent application Ser. No. 12/751,850 (introduced above).


The storage manager 402 may be a software module or other application that coordinates and controls information management operations performed by one or more information management cells 350 to protect and control copies of non-production data objects and metadata. As shown by the dashed lines 416 and 422, the storage manager may communicate with some or all elements of the information management cell 350, such as the media agents 410 and computing devices 205, to initiate and manage backup operations, snapshot operations, archive operations, data replication operations, data migrations, data distributions, data recovery, and other information management operations. The storage manager may control additional information management operations including ILM, deduplication, content indexing, data classification, data mining or searching, e-discovery management, collaborative searching, encryption, and compression. Alternatively or additionally, a storage manager may control the creation and management of disaster recovery copies, which are often created as secondary, high-availability disk copies, using auxiliary copy or replication technologies.


The storage manager 402 may include a jobs agent 455, a management agent 450, a network agent 445, and an interface agent 460, all of which may be implemented as interconnected software modules or application programs. The jobs agent 455 monitors the status of information management operations previously performed, currently being performed, or scheduled to be performed by the information management cell 350. The management agent 450 provides an interface that allows various management agents 450 in multiple information management cells 350 (or in a global storage manager 305) to communicate with one another. This allows each information management cell 350 to exchange status information, routing information, capacity and utilization information, and information management operation instructions or policies with other cells. In general, the network agent 445 provides the storage manager 402 with the ability to communicate with other components within the information management cell and the larger information management system, e.g., via proprietary or non-proprietary network protocols and application programming interfaces (“APIs”) (including HTTP, HTTPS, FTP, REST, virtualization software APIs, cloud service provider APIs, hosted service provider APIs). The interface agent 460 includes information processing and display software, such as a graphical user interface (“GUI”), an API, or other interactive interface through which users and system processes can retrieve information about the status of information management operations or issue instructions to the information management cell and its constituent components. The storage manager 402 may also track information that permits it to select, designate, or otherwise identify content indices, deduplication databases, or similar databases within its information management cell (or another cell) to be searched in response to certain queries.


The storage manager 402 may also maintain information management data, such as a database 465 of management data and policies. The database 465 may include a management index that stores logical associations between components of the system, user preferences, user profiles (that among other things, map particular information management users to computing devices or hosted services), management tasks, or other useful data. The database 465 may also include various “information management policies,” which are generally data structures or other information sources that each include a set of criteria and rules associated with performing an information management operation. The criteria may be used to determine which rules apply to a particular data object, system component, or information management operation, an may include:

    • frequency with which a production or non-production copy of a data object or metadata has been or is predicted to be used, accessed, or modified;
    • access control lists or other security information;
    • the sensitivity (e.g., confidentiality) of a data object as determined by its content and/or metadata;
    • time-related factors;
    • deduplication information;
    • the computing device, hosted service, computing process, or user that created, modified, or accessed a production copy of a data object; and
    • an estimated or historic usage or cost associated with different components.


      The rules may specify, among other things:
    • a schedule for performing information management operations,
    • a location (or a class or quality of storage media) for storing a non-production copy,
    • preferences regarding the encryption, compression, or deduplication of a non-production copy,
    • resource allocation between different computing devices or other system components (e.g., bandwidth, storage capacity),
    • whether and how to synchronize or otherwise distribute files or other data objects across multiple computing devices or hosted services,
    • network pathways and components to utilize (e.g., to transfer data) during an information management operation, and
    • retention policies (e.g., the length of time a non-production copy should be retained in a particular class of storage media).


As noted above, each computing device 205 may include one or more data management agents 280. Each data management agent is a software module or component that helps govern communications with other system components. For example, the data management agent receives commands from the storage manager 402 and sends to and receives from media agents 410 copies of data objects, metadata, and other payload (as indicated by the heavy arrows). Each data management agent accesses data and/or metadata stored in a production data storage medium 218 and arranges or packs the data and metadata in a certain format (e.g., backup or archive format) before it is transferred to another component. Each data management agent can also restore a production copy of a data object or metadata in a production data storage medium 218 from a non-production copy. A data management agent may perform some functions provided by a media agent, which are described further herein, such as compression, encryption, or deduplication. Each data management agent may be specialized for a particular application (e.g. a specified data management agent customized to handle data generated or used by Exchange by Microsoft Corp.). Alternatively or additionally, a more generic data management agent may handle data generated or used by two or more applications.


Each computing device 205 may also include a data distribution and live browsing client module 405 (herein “distribution client module”). The distribution client module 405 is responsible for, inter alia, associating mobile devices and/or hosted service accounts with users of the information management system, setting information management policies for mobile and other computing devices, pushing data objects to a distribution module for distribution to other computing devices, providing unified access to a user's data via an interface, and providing live browsing features. The various functions of the distribution client module are described in greater detail herein.


A media agent 410, which may be implemented as a software module, conveys data, as directed by the storage manager 402, between a computing device 205 (or hosted service 122) and one or more non-production storage mediums 155-870. Each media agent 410 may control one or more intermediary storage devices 418, such as a cloud server or a tape or magnetic disk library management system, to read, write, or otherwise manipulate data stored in a non-production storage medium 155-870. Each media agent 410 may be considered to be “associated with” a storage device and its related non-production storage media if that media agent is capable of routing data to and storing data in the storage media managed by the particular storage device. A media agent may communicate with computing devices 205, hosted services 122, storage devices 418A-D, and the storage manager 402 via any suitable communications path, including SCSI, a Storage Area Network (“SAN”), a Fiber Channel communications link, or a wired, wireless, or partially wired/wireless computer or telecommunications network, including the Internet.


To perform its functions, the media agent 410 may include a media file system module 425, a data classification module 435, a content indexing module 420, a deduplication module 430, an encryption module 475, a compression module 485, a network module 415, a distribution module 490, and a media agent database 440. The media file system module 425 is responsible for reading, writing, archiving, copying, migrating, restoring, accessing, moving, sparsifying, deleting, sanitizing, destroying, or otherwise performing file system operations on various non-production storage devices of disparate types. The media file system module may also instruct the storage device to use a robotic arm or other retrieval means to load or eject certain storage media such as a tape.


The network module 415 permits the media agent to communicate with other components within the system and hosted services 122 via one or more proprietary and/or non-proprietary network protocols or APIs (including cloud service provider APIs, virtual machine management APIs, and hosted service provider APIs). The deduplication module 430 performs deduplication of data objects and/or data blocks to reduce data redundancy in the cell. The deduplication module may generate and store data structures to manage deduplicated data objects, such as deduplication tables, in the media agent database 440. The encryption module 475 performs encryption of data objects, data blocks, or non-production objects to ensure data security in the cell. The compression module 485 performs compression of data objects, data blocks, or non-production objects to reduce the data capacity needed in the cell.


The content indexing module 420 analyzes the contents of production copies or non-production copies of data objects and/or their associated metadata and catalogues the results of this analysis, along with the storage locations of (or references to) the production or non-production copies, in a content index stored within a media agent database 440. The results may also be stored elsewhere in the system, e.g., in the storage manager 402, along with a non-production copy of the data objects, and/or an index cache. Such index data provides the media agent 410 or another device with an efficient mechanism for locating production copies and/or non-production copies of data objects that match particular criteria. The index data or other analyses of data objects or metadata may also be used by the data classification module 435 to associate data objects with classification identifiers (such as classification tags) in the media agent database 440 (or other indices) to facilitate information management policies and searches of stored data objects.


The distribution module 490 may be a set of instructions that coordinates the distribution of data objects and indices of data objects. The distribution may occur from one computing device 205 to another computing device 205 and/or from hosted services 122 to computing devices 205. As a first example, the distribution module may collect and manage data and metadata from hosted services 122 or mobile devices 205. As another example, the distribution module may synchronize data files or other data objects that are modified on one computing device so that the same modified files or objects are available on another computing device. As yet another example, the distribution module may distribute indices of data objects that originated from multiple computing devices and/or hosted services, so a user can access all of their data objects through a unified user interface or a native application on their computing device. The distribution module may also initiate “live browse” sessions to permit communications between different computing devices so that the devices can interchange data and metadata or so the devices can provide computing resources, such as applications, to each other. The functions performed by the distribution module are described in greater detail herein.


Brief Architectural Overview


A brief overview of certain aspects of the techniques described in greater detail below is now provided. In some implementations, a user is able to browse through a file system on his computer using a menu structure and user interface (UI) generally supported by his computer (e.g., Windows 7 interface, Apple iOS interface, and so on). Some of the displayed files may be stored in a secondary storage or an archive, which may not be on the user's computer, but are accessible elsewhere on a network to which the user's computer is connected. In some implementations, a visual cue is provided to a user for the user to be able to distinguish between files that are locally present and files that have been archived. In some implementations, archived files are replaced by a locally available “stub file” copy. In some implementations, the stub file copy is created by converting a file from its native format to a preview format. The preview format may be customized to minimize storage requirement at the expense of added functionality such as being able to manipulate text and graphics in the file. In one aspect, a user is able to quickly view the content of a large file using the locally stored stub file and then make a decision about whether to recall the entire file from the secondary storage; which may take a significant amount of network and computing resources.


Suitable User Interaction


With reference to FIG. 5, an example of a user interface 500 for allowing data preview before recalling large data files is shown. In some implementations, the user interface 500 is in the form of a folder view, depicting files available in the folder. In the example shown in FIG. 5, three files, 502, 504 and 506 are displayed to a user. The files may also show a file type, e.g., .xyz, .ddd and .abc respectively to identify the file to a user. Other variations of the folder view and file display are well known in art and are possible, but omitted in the present document for brevity. In FIG. 5, files 502, 504, 506 contain an additional cue, indicating to the user whether the file is available in its native format or in a preview format. A cue may be provided only for stub files (e.g., file in the native format is not available on the primary storage). Each displayed file icon may include another smaller icon (e.g., 508, 510, 512) indicating whether the file is available in its native format or in preview format. For example, 508 indicates that the file is not available in the native format while 510, 512 indicate that the file is available in the native format and locally stored.


In some implementations, audio tone cues are used to indicate such availability. For example, when a user moves the cursor over on the file icon, an audio tone is generated for stub, e.g., files that are not stored locally in their native formats. Various other techniques, e.g., use of different colors, different sizes, different fonts, etc. are also possible to provide audio/visual cues to the user about which files are stored locally and in native file format, and which are stub files, e.g., available from a secondary (or offline) storage and in a preview format.


When a user interacts with a file (e.g., file 502), a viewer application can be launched. The viewer application may be launched in a separate window 514 (e.g., a pop-up window). The viewer application is described in greater detail elsewhere in this document. The system may activate the viewer application when the user performs a specific action on the file icon (e.g., glide, single click, double click, etc.). The pop-up window may be an independent application frame with well-known attributes and controls such as “full page,” “minimize,” “move,” “close,” etc. Alternatively, the pop-up window is a balloon window which (other than below-described content browsing) is not further manipulatable by the user.


Preview Client Application


In some implementations, the viewing program used for showing content of a stub file to a user is operable on a computer platform as a preview client application. The preview client may be an off-the-shelf browser that is modified to display the files in their preview format (e.g., a JPEG viewer or an Internet browser). Alternatively, the preview client may be a custom viewing application. The preview client application may provide a static display of the content of a stub file. In other words, the preview client does not allow interaction with content being displayed. For example when text is displayed as a JPEG or a .bmp file, the preview client may not allow a user to select and copy text or images embedded within the content. Other image viewing clients may also be used (e.g., a TIFF viewer etc.).


In some implementations, the preview client allows some user interaction such as page forward/page backward/page skip for efficient navigation through file content via the stub file. For example, with the cursor on window 514, a user may be able to press page up/page down and receive different content, e.g., different video frames or different pages.



FIG. 6 depicts additional tasks that can be supported for user interaction and control. In some implementations, while browsing the folder 500, a user can perform a specific action (e.g., a right click) to open a menu list 600 of possible actions. In some implementations, a user can open additional menu by performing specific actions (e.g., mouse right click) while having the cursor on the icon 502 or the preview area 514. The possible menu items (actions) include, for example, Recall 602, Play 604, Preview 606, and so on.


In some implementations, when a user selects the Recall 602 option, the computer system recalls the file to regenerate the file in native file format from a secondary storage or archive to the primary storage, thereby making the file available to the user locally and in the native file format. If the file is currently not available for recalling, for example, when the user is not connected to the appropriate network (e.g., a corporate, an intra network or the Internet) an error message is displayed to the user that the file is currently not available.


In some implementations, the View 604 mode is made available for multimedia files. For example, the selection of View 604 option, while previewing a media file, may result in, first, a recall of the media file from a secondary storage and, second, launching of an application (e.g., a media player) in which the media file can be viewed when it is recalled to the local storage.


In some implementations, the Play 606 option enables a user to put the underlying content “in motion.” For example, if the underlying content is a multi-slide presentation, then the selection of play option results in an auto-staged playback of the slides in the “preview mode.” As another example, in the play mode, pages of a multi-page document may be flipped automatically by the computer system.


In some implementations, the content of a stub file may be displayed to the user by refreshing content with next pages or next video frames, simply when the user's cursor is on the file icon. In some implementations, a stub file may be a hypertext markup language (HTML) file that can be viewed using a web browser. Of course, other file types and viewers may be used, such as the PDF file type and the Adobe Acrobat viewer.


Storage Management


In some implementations, after converting a file from a native format to a preview format, the file in native format is moved to secondary storage and information about the location in the secondary storage is associated with the copy in the preview format. The location information is associated with the preview format file. One of several well known mechanisms such as the user resource locator (URL) indicator may be used for the association.



FIG. 7 depicts an example block diagram representation of the creation of a stub file (or a file in a preview format) from the original file (file in a native format). The system processes file 700 through a converter 702 that converts the file from its native format to a preview format (e.g., from PDF to JPEG or from PowerPoint to PNG, etc.) to generate preview content 706 representation of the file 700. In other words, the converter 702 converts the native file to another, lower resolution format file, where the lower resolution format file contains less data, and thus consumes fewer data storage resources. In some implementations, the converter 702 may use off-the-shelf technologies such as the content-aware format converter by Stellent, a subsidiary of Oracle.


After the file is converted to the preview format, the system transfers the file in native format by a transfer module 704 to a secondary or archive storage, as previously described. Based on the transfer, the system generates a pointer 708 with information about where the transferred occurred to, or in other words, the location of the file in the secondary storage. The pointer 708 is associated with the viewable content 706, together representing the stub file 710.


In some implementations, the decision regarding which files to keep on the local storage and which ones to replace with their stub file versions is performed using a set of predetermined rules. The rules include, for example, criteria such as archiving least used files, files larger than a threshold size, files of a certain type (e.g., media files), files specifically identified by a user for such offline storage, files identified by an application as being suitable for offline storage, etc. A system administrator may be to modify or update the predetermined rules. The management of these rules, in one aspect, helps a corporate network strike the balance between storage use of an organization and response time to a user browsing through files on the corporate network. In other words, the organization can manage the amount of primary storage data storage required. The system can analyze historical trends in data being stored, data storage capacity (primary and secondary storage), bandwidth capacity for exchanging data files, and other factors. Based on statistical analysis of these historical trends, the system may periodically or continuously/dynamically change the rules to compensate for changes in data storage, data storage capacity, bandwidth, etc. Further details regarding other rules and processes for moving data objects to secondary storage, especially for mobile devices, is discussed below.



FIG. 8 is a flow chart representation of a process 800 for providing offline access to a data file. At 802, the system converts the data file from a native format to a preview format. Various encoders exist for converting files from one format to another. In some implementations, the process 800 may use alternate informative formats as the preview format. For example, if the file in the native format is a movie file, then the process 800 may acquire a corresponding trailer file for the movie. The process 800 may, e.g., use publically available databases such as Internet Movie Database (IMDb) to receive the trailer file, or a user resource link (URL) to the trailer. In one beneficial aspect, the preview format thus can be selected to provide an “intelligent” condensed version of the data file in the native format, instead of a “machine based” sliced up preview version. In some implementations, files from other data formats (e.g., images, program source codes) etc. could be replaced with other condensed versions such as links or actual files of related resources (smaller video clips, Wikipedia pages, etc.). In some implementations, a check is first made to find out whether a condensed or minimized version is available. If there is a minimized version of the same file or document available elsewhere (in the system or in the Internet), the process 800 could replace the original native format data file with the minimized version. When retrieving, the user could watch the movie trailer first, for example, instead of using system resource to retrieve the entire movie file.


At 804, the system stores the data file in the preview format in primary storage. At 806, after converting the file to the preview format, the system moves the data file in native format to secondary storage, provide a link to it, and updates the data structure reflecting the new location of the native format in secondary storage. In this context, “moving” includes copying and then deleting from the primary storage.


At 808, the system, at some later time, receives a viewing request for the data file. At 810, if the file to be viewed as located in primary storage, the data file is displayed in the preview format to fulfill the viewing request. As previously discussed, in some embodiments, the preview format comprises a picture encoding format such as a JPEG image, or a bitmap format or a GIF (graphics intermediate format) image or a PNG (portable network graphics) image, and so on. At 818, if the file requested is the native format file, then the system accesses the data structure to identify the location of the native format file in secondary storage, and retrieves it for display or to be provided to the user.


In some implementations, a menu for accessing the data file in the native format is provided. As previously discussed, in some implementation an audio or a visual cue is provided to a user to indicate whether or not the file icon being browsed by the user is in the primary storage. For files that are not stored in the primary storage but are available by retrieving from a secondary storage, a menu may be provided in some implementations. For example, in some implementations, a user can access file open menu by right-clicking on the file icon.


As previously discussed, the process 800 may include a resource locator with the data object stored in the preview format. The resource locator is, e.g., in the URL format, indicating the location in the secondary storage of the native format data object. When the user selects to load the image in the native format, then access to the data object may be provided using the resource locator, using one of several well know network file interface schemes.


While the larger, native format file is generally described herein as being stored on the secondary storage, while the stub is stored on primary storage, the two may be stored together, within a single file. Thus, in an alternative embodiment, a single container file may include the initial preview file, followed by the native format file. A header may be provided in the container file to describe the contents, format and extends (e.g. size) of the embedded preview and native format files. The information management system may manage the container file as a single file, while the file system of a computing device may view the two files independently.


By embedding both preview and native format files within a container file, storage management efficiencies may be obtained. Further, such a container file may allow both the preview and native format files to be moved from primary storage to secondary storage. The stub described herein may link or point to the preview file within the container file, and it is this preview file that is returned by accessing the stub. However, with further input by the user, the system can retrieve the native format file for the user.


Forward Compatibility with Newer File Formats


When new file formats are introduced (e.g., newer video file formats or files generated by new releases of application programs), the converter 702 may simply be updated to add a module that is responsive to the new file format and is able to convert the new file format to a preview format such as a bitmap or a PNG format file.


Multimedia File Handling


It is well known that multimedia files, especially video files, often occupy a large amount of storage space, compared to documents and spreadsheets. In some implementations, the system replaces above-discussed pointer 708 with a list of pointers, with each pointer in the list pointing to a next section (e.g., a next independently decodable video frame or group of frames) of the stored video file. In one aspect, such as facility enables random access within a long video file and allows a user to recall a portion of a video file that is of interest. In other words, “bookmarks” may be provided and displayed to access sections or portions of the video file. In some embodiments, a video file in the native format (e.g., an mp4 video file) may be converted into its stub format by simply clipping the video file to first few seconds or by sampling video frames periodically (e.g., once every second). It will be appreciated that such techniques beneficially would result in a considerable reduction in the storage space needed for the stub file, compared to the original file, while still providing a user the ability to preview content of the file.


Mobile Computing Environment


In some implementations, a user accesses files (e.g., file folder 500) from a mobile device. A mobile device is often run on battery power and therefore it may be desirable to customize a user's access to the files based on the amount of battery power available to the mobile device. For example, in some implementations, when the available batter power (or time remaining for battery power operation) falls below a threshold, a user may be able to browse through a file 502, 504 or 506 only using a low power option. The low power option may be, e.g., limiting the user to only be able to preview the file in the preview format.


The system described herein can establish certain rules or policies to implement this functionality on a mobile device. For example, if the battery-power drops below a 20% threshold, then the system permits the mobile device to access only previews. However, when the battery-powered drops below a 10% threshold, then the system prevents the mobile device from launching resource intensive previews. For example, processor-intensive video decoding may be prohibited and/or access to previews that require downloads via a wireless link (locally stored previews would still be permitted). In other words, any applications that would burden the processor, or consume radio resources, would be rationed. Rather than prohibiting or inhibiting such functionality at these thresholds, the system may instead provide a click through warning for a user, which would require the user to acknowledge the resource intensive request before permitting the file to be accessed/viewed/previewed.


Furthermore, a mobile device typically also has a limited memory or processor power for application execution. For example, some mobile devices may not have a native Office application installed. In such mobile devices, the only option for a user to be able to view content of files for which no application is available locally may be to use a preview format. In such implementations, when a user attempts to browse through the content of a file, the content is made available only in a preview format.


Typical mobile devices may also be limited by viewing constraints such as screen resolution, color depth, etc. In some implementations, the converter 702 selects a target preview format based on such mobile device limitations. For example, in some implementations, the converter 702 creates multiple resolution images of content pages of a native format file. When the user wishes to browse through such multi-resolution content, the system provides or offers a preview file suitable for the user's mobile device capabilities (e.g., high resolution, low resolution, 18 bit color depth, etc.), also called device resource profile.


Further information regarding data storage methods for mobile devices may be found in the assignee's concurrently filed U.S. Patent Application No. 61/618,506, to Vibhor et al., entitled “Backup Methods for Mobile Devices,” incorporated herein by reference in its entirety.


In some implementations, when a user syncs his user device to a corporate network, a synchronization server automatically stores file in the right format on the user device. For example, in the case of a mobile device that has a 352×240 screen resolution with 16 bit color depth, a preview file suitable for display on a 352×240 resolution with 16 bit color depth is “synched” or stored on the user device.


With reference to FIG. 10, a synchronization server may implement a process 1000 as follows. At 1002, the synchronization server obtains a resource profile of a user device (e.g., battery life, display resolution, available memory, preview applications loaded on the user device, etc.). At 1004, based on the resource profile, the synchronization server then makes file storage decisions regarding multiple files to be made available to a user of the user device. For each file, the synchronization server decides whether to store the file in its native format on the user device or whether to store the file in a preview format on the user device and move the corresponding native format version to a secondary or archive location in the network.


At 1006, when the decision is to store a preview copy on the local storage of the user device, the synchronization server then decides attributes of the local copy (e.g., which preview format to use, what level of compression to use, etc.). The synchronization server may make decisions about the attributes of the local copy based on the resource profile of the user device. At 1008, in addition, the synchronization server adds metadata to the locally stored preview format file to indicate where to locate the file in its native format and whether the file is in a preview format or in its native format. To generate the preview format file, the synchronization server may communicate with the converter 702, previously discussed.


The above-discussed synchronization process may be run when a portable or mobile device is docked in a device dock or on a periodic basis (e.g., once every week). A user or a system administrator may be able to perform synchronization by running a script or a program. Mobile devices often have memory interfaces to attach a removable memory (e.g., secure digital memory card, SIM card, USB flash memory device, etc.). In some implementations, the removable memory card may be used to transfer files to/from a user's mobile device and the user's computer. For example, from the desktop, a user may be able to create a “To go” folder and add files to the folder by dragging and dropping the files into the folder. The system may then decide, using the previously discussed methodology, whether to store the file in its native format in the “To go” folder or whether to convert the file to a preview format before copying the file to the “To go” folder. Once the user has copied all the files he wants to this folder, the user can simply remove the memory device from the computer and attach the memory device to his mobile platform (phone, smartphone, tablet etc.).


The above-discussed system may be expanded to any data or even applications. Many current mobile devices, such as tablets and smart phones, have a maximum of 8 GB of storage. The present system may intelligently archive data and applications by scanning data and applications on the device and automatically backing up or moving to secondary storage old and unused data/applications, including data/applications that consume power on the device. For example, an electronic magazine subscription could consume 50 MB per issue, particularly if the magazine has many images. The system can automatically archive these old subscriptions, such as moving them to a secure cloud storage location associated with the mobile device. As another example, the system can scan applications running on the device, including identifying services accessed, to help understand power consumption, and compare that to use of those applications by the user—unused power-hungry applications can be automatically archived to free up not only data storage on the device, but also free up processing resources and conserve battery power.


In some implementations, a smart archival application may be installed on a mobile device for monitoring memory use by locally stored files. The smart archival application may continuously run in the background or may periodically wake up and analyze memory usage and whether any local memory can be freed up by archiving unused files, as described above. In some implementations, the smart archival application may perform the actual archival task. In some other applications, the housekeeper application may only mark files for archival at next available opportunity (e.g., when the device is being run on AC power or the battery level is above a threshold such as 80%),



FIG. 11 is a flow chart representation of a process 1100 of performing smart archiving on mobile devices. At 1102, an archival profile is generated for a file. The term “file” may include applications files (e.g., executables, DLLs, etc.). The archival profile may include rules related to when and when not to archive a file. The rules may be based on criteria such as (a) when was the file used last time, (2) file size, (3) if the file is for a gaming application, then has the user already finished the level for which the file is used, and so on. For example, files that are not used for a certain period (e.g., 30 days) may be considered archival candidates. Similarly, files that are greater than 2% of currently available memory or are larger than 50 Mbytes may be considered archival candidates. At 1104, a current usage status for a file may be determined using operating system application programmers interface (APIs). For example, several well known mobile phone operating systems provide APIs for querying file usage, access log, etc. At 1106, a decision is taken about whether or not to archive the file based on the current usage status. For example, the current usage status of the file indicates that the file meets the archival candidate criteria in the archive profile, a decision may be taken that the file should be archived. At 1108, based on availability of resources to perform the archival of the file, file archival may be performed using a previously discussed technique or alternatively the file may be marked for a later archival. For example, when the mobile device is running low on battery (e.g., less than 20%) or when a user is engaged in a CPU-intensive activity such as a game, file archiving may be deferred to a later time by simply marking files for archival.


CONCLUSION

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, smart phones, and other devices suitable for the purposes described herein. Modules described herein may be 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 aspects of the invention can be practiced with other communications, data processing, or computer system configurations, including: Internet appliances, hand-held devices (including personal digital assistants (PDAs)), wearable computers, all manner of cellular or mobile phones, multi-processor systems, microprocessor-based or programmable consumer electronics, set-top boxes, network PCs, mini-computers, mainframe computers, and the like. Indeed, the terms “computer,” “server,” “host,” “host system,” and the like, are generally used interchangeably herein and refer to any of the above devices and systems, as well as any data processor. Furthermore, aspects of the invention 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.


Software and other modules may be accessible via local memory, a network, a browser, or other application in an ASP context, or via another means suitable for the purposes described herein. Examples of the technology 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), or the Internet. In a distributed computing environment, program modules may be located in both local and remote memory storage devices. 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.


Examples of the technology may be stored or distributed on computer-readable media, including magnetically or optically readable computer disks, 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 invention 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).


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.” As used herein, the terms “connected,” “coupled,” or any variant thereof, means any connection or coupling, either direct or indirect, between two or more elements; the coupling or connection between the elements can be physical, logical, or a combination thereof. Additionally, the words “herein,” “above,” “below,” and words of similar import, when used in this application, 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, 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.


The above Detailed Description is not intended to be exhaustive or to limit the invention to the precise form disclosed above. While specific examples for the invention are described above for illustrative purposes, various equivalent modifications are possible within the scope of the invention, as those skilled in the relevant art will recognize. For example, while processes or blocks are presented in a given order, alternative implementations 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 to provide alternative or subcombinations. 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 or implemented in parallel, or may be performed at different times. Further any specific numbers noted herein are only examples: alternative implementations may employ differing values or ranges.


The teachings of the invention provided herein can be applied to other systems, not necessarily the systems described herein. The elements and acts of the various examples described above can be combined to provide further implementations of the invention.


Any patents and applications and other references noted above, including any that may be listed in accompanying filing papers, are incorporated herein by reference. Aspects of the invention can be modified, if necessary, to employ the systems, functions, and concepts of the various references described above to provide yet further implementations of the invention.


These and other changes can be made to the invention in light of the above Detailed Description. While the above description describes certain examples of the invention and describes the best mode contemplated, no matter how detailed the above appears in text, the invention can be practiced in many ways. Details of the system may vary considerably in its specific implementation, while still being encompassed by the invention disclosed herein. As noted above, particular terminology used when describing certain features or aspects of the invention 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 invention with which that terminology is associated. In general, the terms used in the following claims should not be construed to limit the invention to the specific examples disclosed in the specification, unless the above Detailed Description section explicitly defines such terms. Accordingly, the actual scope of the invention encompasses not only the disclosed examples, but also all equivalent ways of practicing or implementing the invention under the claims.


While certain examples are presented below in certain forms, the applicant contemplates the various aspects of the invention in any number of claim forms. Accordingly, the applicant reserves the right to add additional claims after filing the application to pursue such additional claim forms for other aspects of the invention.

Claims
  • 1. A method for providing to a user computer access to a data file, the method comprising: obtaining a resource profile of the user computer that contains capacity information associated with data storage at the user computer;determining that the data file is to be converted from a native format to a preview format when the native format requires data storage resources greater than data storage resources of the user computer;converting the data file from the native format to the preview format, wherein the preview format occupies less data storage capacity than the native format;storing the data file in the preview format in a primary data storage device, wherein the primary data storage device is accessible to the user computer via a network;moving, after the conversion to the preview format, the data file in the native format to a secondary data storage device, wherein the secondary data storage device is offline and not immediately accessible for providing data files in response to requests from the user computer, andwherein moving the data file in the native format to the secondary data storage device comprises: copying contents of the data file in the native format to the secondary storage device;updating a data structure storing a location of the data file in the native format to reflect a new location of the data file in the native format in the secondary storage; anddeleting the data file in the native format from the primary data storage device;receiving a request for the data file from the user computer; andproviding for display on the user computer the data file in the preview format to fulfill the request.
  • 2. The method of claim 1, wherein the preview format comprises a picture encoding format, and wherein the picture encoding format comprises one of a JPEG format, a bitmap format, a GIF format, a TIFF format and a PNG format.
  • 3. The method of claim 1, wherein the preview format comprises a picture encoding format.
  • 4. The method of claim 1, further comprising: providing a menu for accessing the data file in the native format, andwherein the providing the menu includes providing the menu upon a right-click operation by a user.
  • 5. The method of claim 1, further comprising providing a menu for accessing the data file in the native format.
  • 6. The method of claim 1, further comprising: including a resource locator with the preview format; andproviding access to the data file using the resource locator.
  • 7. An apparatus for providing access to a data file, the method comprising: means for obtaining a resource profile of the user computer that contains capacity information associated with data storage at a user computer;means for determining that the data file is to be converted from a native format to a preview format when the native format requires data storage resources greater than data storage resources of the user computer;means for converting the data file from the native format to the preview format, wherein the preview format occupies less data storage capacity than the native format;means for storing the data file in the preview format in a primary storage;means for moving, after the conversion to the preview format, the data file in the native format to a secondary storage, wherein the secondary data storage device is offline and not immediately accessible for providing data files in response to requests from the user computer,and wherein moving the data file in the native format to the secondary data storage device comprises:copying contents of the data file in the native format to the secondary storage device; updating a data structure storing a location of the data file in the native format to reflect a new location of the data file in the native format in the secondary storage; anddeleting the data file in the native format from the primary data storage device; means for receiving a viewing request for the data file; andmeans for providing for display the data file in the preview format to fulfill the viewing request.
  • 8. The apparatus of claim 7, wherein the preview format comprises a picture encoding format.
  • 9. The apparatus of claim 8, wherein the picture encoding format comprises one of a JPEG format, a bitmap format, a GIF format, a TIFF format and a PNG format.
  • 10. The apparatus of claim 7, further comprising: means for providing a menu for accessing the data file in the native format.
  • 11. The apparatus of claim 10, wherein the means for providing the menu includes means for providing the menu upon a right-click operation by a user.
  • 12. The apparatus of claim 7, further comprising: means for including a resource locator with the preview format.
  • 13. The apparatus of claim 12 further comprising: means for providing access to the data file using the resource locator.
  • 14. A computer program product comprising a non-transitory computer-readable storage medium having code stored thereon, the code, when executed by a processor, causing the processor to manage storage capacity on a computer, comprising: obtaining a resource profile of the computer that contains capacity information associated with data storage at the computer;determining that the data file is to be converted from a first format to a second format when the first format requires data storage resources greater than data storage resources of the computer;receiving a data file from a primary data storage device coupled to a computing device,wherein the data file has the first format associated with a first application program;creating a copy of the data file by converting the data file from the first format into the second format, wherein the second format permits at least some content of the data file to be viewable using a viewer application;moving the data file from the primary data storage device to a location in a secondary data storage device, wherein the secondary data storage device is offline and not immediately accessible for providing data files in response to requests from the user computer,and wherein moving the data file to the secondary data storage device comprises:copying contents of the data file in the first format to the secondary storage device;updating a data structure storing a location of the data file in the first format to reflect a new location of the data file in the first format in the secondary storage device; anddeleting the data file in the first format from the primary data storage device; andstoring, on the primary data storage device, the copy of the data file in the second format and information about the location of the data file on the secondary data storage device.
  • 15. The computer program product of claim 14, wherein the step of creating the copy of the data file includes creating the copy of the data file by reducing a size of the data file, and wherein the viewer application comprises a web browser.
  • 16. The computer program product of claim 14, wherein, when the data file includes a video, then the step of creating a copy of the data file includes creating a copy of the data file that includes periodic snapshots of video frames in the video.
  • 17. The computer program product of claim 14, wherein the second format is one of a JPEG format, a bitmap format, a GIF format, a TIFF format and a PNG format.
  • 18. The computer program product of claim 14, further comprising: launching, responsive to a user interaction, the viewer application for viewing the copy of the data file, and wherein the viewer application is configured to view but not modify the content of the copy of the data file.
  • 19. The computer program product of claim 14, further comprising: fetching, responsive to a user interaction, the data file from the secondary data storage; andlaunching the first application program.
CROSS-REFERENCE TO RELATED APPLICATION(S)

The present application claims priority to and the benefit of U.S. Provisional Application No. 61/618,039, filed Mar. 30, 2012, which is hereby incorporated herein by reference in its entirety.

US Referenced Citations (326)
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
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
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 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 et al. 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 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 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
20010028363 Nomoto Oct 2001 A1
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
20060177114 Tongdee et al. Aug 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
20090119322 Mills May 2009 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
20100131566 Sato May 2010 A1
20100262911 Kaplan et al. Oct 2010 A1
20100306283 Johnson et al. Dec 2010 A1
20100306643 Chabot et al. Dec 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
20130006625 Gunatilake et al. Jan 2013 A1
20130104027 Bennett et al. Apr 2013 A1
20130110854 Lockhart et al. May 2013 A1
20130111326 Lockhart May 2013 A1
20130145376 Gokhale et al. Jun 2013 A1
20130238969 Smith et al. Sep 2013 A1
20140150023 Gudorf May 2014 A1
Foreign Referenced Citations (21)
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-9912098 Mar 1999 WO
WO-0058865 Oct 2000 WO
WO-0106368 Jan 2001 WO
WO-0116693 Mar 2001 WO
WO-0180005 Oct 2001 WO
Non-Patent Literature Citations (20)
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.
U.S. Appl. No. 09/609,977, filed Jul. 5, 2000, Prahlad.
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, 1988-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, 1995-Mar. 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.
Extended European Search Report for Application No. EP 09767119, dated Feb. 11, 2013, 12 pages.
Hennessy et al., “Computer Architecture—A Quantitative Approach”, 2nd Edition, 1996, pp. 246-250.
Jander, M., “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4 (Mar. 21, 1998), pp. 64-72.
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 (Jun. 1988).
Microsoft Press Computer Dictionary Third Edition, “Data Compression,” Microsoft Press, 1997, p. 130.
PCT International Search Report for International Application No. PCT/US09/32325, dated Mar. 17, 2009, 11 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.
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).
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.
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.
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.
Related Publications (1)
Number Date Country
20130262410 A1 Oct 2013 US
Provisional Applications (1)
Number Date Country
61618039 Mar 2012 US