Application-aware and remote single instance data management

    公开(公告)号:US09971784B2

    公开(公告)日:2018-05-15

    申请号:US14816687

    申请日:2015-08-03

    Inventor: Parag Gokhale

    CPC classification number: G06F17/30156 G06F17/30 G06F17/30117 G06F17/30174

    Abstract: A method and system for reducing storage requirements and speeding up storage operations by reducing the storage of redundant data includes receiving a request that identifies one or more files or data objects to which to apply a storage operation. For each file or data object, the storage system determines if the file or data object contains data that matches another file or data object to which the storage operation was previously applied, based on awareness of the application that created the data object. If the data objects do not match, then the storage system performs the storage operation in a usual manner. However, if the data objects do match, then the storage system may avoid performing the storage operation with respect to the particular file or data object.

    System and method for synchronizing history data for compression and decompression

    公开(公告)号:US09959284B2

    公开(公告)日:2018-05-01

    申请号:US14591750

    申请日:2015-01-07

    Abstract: An apparatus and a computer-implemented method for processing data are disclosed. The apparatus comprises a memory device that stores first history data, and at least one processor configured to modify a first portion of the first history data, transmit first information to a recipient device reflecting the modification to the first portion of the first history data, determine that the recipient device has modified a second portion of the second history data associated with the first portion based on the first information, receive input data, and responsive to the confirmation, transmit one or more reference tokens reflecting a relationship between the modified first history data and one or more portions of the input data, wherein the one or more first reference tokens allows the recipient device to reconstruct the one or more portions of the input data from the modified second portion of the second history data.

    Accessing a file system using tiered deduplication

    公开(公告)号:US09934238B2

    公开(公告)日:2018-04-03

    申请号:US15399597

    申请日:2017-01-05

    Abstract: An illustrative pseudo-file-system driver uses deduplication functionality and resources in a storage management system to provide an application and/or a virtual machine with access to a locally-stored file system. From the perspective of the application/virtual machine, the file system appears to be of virtually unlimited capacity. The pseudo-file-system driver instantiates the file system in primary storage, e.g., configured on a local disk. The application/virtual machine requires no configured settings or limits for the file system's storage capacity, and may thus treat the file system as “infinite.” The pseudo-file-system driver intercepts write requests and may use the deduplication infrastructure in the storage management system to offload excess data from local primary storage to deduplicated secondary storage, based on a deduplication database. The pseudo-file-system driver also intercepts read requests and in response may restore data from deduplicated secondary storage to primary storage, also based on the deduplication database.

    Range-based data deduplication using a hash table with entries replaced based on address alignment information

    公开(公告)号:US09921773B2

    公开(公告)日:2018-03-20

    申请号:US14743520

    申请日:2015-06-18

    Inventor: Ivan Georgiev

    Abstract: Deduplicated data storage is provided by presenting a virtual volume mapped by a translation table to a physical volume of a physical data storage system. The translation table maps sets of ranges of duplicate data blocks of the virtual volume to corresponding individual ranges of shared data blocks of the physical volume. A hash table for identifying duplicate data is indexed by a portion of a hash value calculated from newly written data blocks, and has entries each identifying an address alignment of the corresponding data block. In operation, existing entries are replaced with new entries for colliding data blocks having better address alignment, promoting wider address-space separation of the entries. Upon occurrence of a hit in the hash table, for a given data block in a range of newly written data blocks, data blocks of the range are compared to corresponding blocks in a range identified by the hit to maximize a size of a region to be identified by the translation table as duplicate data.

Patent Agency Ranking