Abstract: A memory controller is for receiving incoming data and storing and/or transmitting the incoming data utilizing deduplication. The memory controller determines a second hash corresponding to one or more first hashes. The second hash is a sparse hash and the first hashes are strong hashes. The memory controller populates a sparse index with the second hash. The sparse index associates the second hash with the corresponding first hashes. The memory controller determines the second hash based on a probability that the second hash corresponds to a plurality of first hashes using a probabilistic method.

Abstract: A computer-implemented method for indexing a data item in a data storage system includes: dividing the data item into one or more large blocks; dividing each large block into one or more small blocks; calculating a strong hash value for each of the small blocks and storing a list of strong hash values with a pointer to a location of the large block; from the list of strong hash values calculated for each large block, selecting one or more representative hash values for the large block; and compiling a sparse index including an entry for each large block. Each entry is based on the representative hash values and a pointer to the list of strong hash values for each large block.

Abstract: An information processing device comprises: a memory comprising a cache for storing information related to an object from a plurality of objects, and a summary structure configured to store a summary for the object; a volume configured to store a merge file including the plurality of objects, and a set of dump-files, each dump-file being associated with a specific cache-dump operation of the cache; and a processor configured to assign, to the cache, a first identifier; perform a cache-dump operation based on generating a dump-file associated with the first identifier and storing the information related to the object from the cache to the generated dump-file; and assign, to the cache, a second identifier, wherein the second identifier is larger than the first identifier.

Abstract: An apparatus for dynamically scheduling a digital storage backup comprises at least one processor adapted to determine at least one backup parameter for a backup of a plurality of data blocks of a monitored non transitory storage. Determining the at least one backup parameter comprises: computing a storage classification for the plurality of data blocks according to a compliance of an amount of changes to a content of the plurality of data blocks with one or more threshold values, and determining the at least one backup parameter according to the classification.

Abstract: A backup entity and a method for backing up a disk volume of a production device are provided. The backup entity is configured to: create a first backup image of the disk volume, in a backup repository. Further, the backup entity is configured to obtain a first indication from the production device, wherein the first indication is indicative of a first operation to be performed by the production device on the disk volume. The backup entity is further configured to perform the first operation on the first backup image, to obtain a second backup image in the backup repository. According to the application, a solution to mimic an operation that changes data of a production storage, in a backup system, is provided, which can reduce the amount of data sent from the production storage to the backup system and thus reduce a backup window.

Abstract: A method and a global server for deduplicating multiple storage servers are disclosed. The global server maintains information regarding a set of hash values, each hash value being associated with a data chunk of data stored in the global server and/or the storage servers, receive, from one or more of the storage servers, a request to modify the information with respect to one or more hash values, accumulate and sort metadata related to the one or more requests, modifies the information with respect to the one or more hash values, based on the accumulated metadata when the accumulated metadata reaches a determined size.

Abstract: An information processing device comprises: a memory comprising a cache for storing information related to an object from a plurality of objects, and a summary structure configured to store a summary for the object; a volume configured to store a merge file including the plurality of objects, and a set of dump-files, each dump-file being associated with a specific cache-dump operation of the cache; and a processor configured to assign, to the cache, a first identifier; perform a cache-dump operation based on generating a dump-file associated with the first identifier and storing the information related to the object from the cache to the generated dump-file; and assign, to the cache, a second identifier, wherein the second identifier is larger than the first identifier.

Abstract: A method for deduplicating at a global server for multiple storage servers includes receiving, from a storage server, a request to store a data chunk, determining whether the data chunk is highly-duplicated among the storage servers, accepting the request when the data chunk is highly-duplicated, and rejecting the request when the data chunk is not highly-duplicated.

Abstract: An apparatus is described for dynamically scheduling a digital storage backup comprises at least one processor adapted to determine at least one backup parameter for a backup of a plurality of data blocks of a monitored non transitory storage. Determining the at least one backup parameter comprises: computing a storage classification for the plurality of data blocks according to a compliance of an amount of changes to a content of the plurality of data blocks with one or more threshold values, and determining the at least one backup parameter according to the classification.

Abstract: For maintaining consistency for a cache that contains dependent objects in a computing environment, object dependencies for cached objects are managed by defining and maintaining object dependency lists for each one of the cached objects for identifying objects upon which the cached objects are dependent. Maintaining cache consistency for 2 types of cache eviction policies is supported by maintaining an object dependency lists for each one of the cached objects for identifying objects dependent upon the cached object. Each of the objects in an object dependency list is updated when the object is updated.

Abstract: For maintaining consistency for a cache that contains dependent objects in a computing environment, object dependencies for cached objects are managed by defining and maintaining object dependency lists for each one of the cached objects for identifying objects upon which the cached objects are dependent. Maintaining cache consistency for 2 types of cache eviction policies is supported by maintaining an object dependency lists for each one of the cached objects for identifying objects dependent upon the cached object. Each of the objects in an object dependency list is updated when the object is updated.

Abstract: For maintaining consistency for a cache that contains dependent objects in a computing environment, object dependencies for cached objects are managed by defining and maintaining object dependency lists for each one of the cached objects for identifying objects upon which the cached objects are dependent. Maintaining cache consistency for 2 types of cache eviction policies is supported by maintaining an object dependency lists for each one of the cached objects for identifying objects dependent upon the cached object. Each of the objects in an object dependency list is updated when the object is updated.

Abstract: A selective tuple versioning is used on a files system for preserving past states of file system nodes by adding a bitmap to a row for a node within a file system table for preserving the past state of the node in a file system, receiving a request for updating the node along with a node identification (ID) and associated attributes of the node needing to be updated, generating a second time value indicating the time of the updating, and duplicating the row for the node into a new row in the file system table with an end time set equal to the second time value if the bit in the bitmap for the node is set.

Abstract: A multiplicity of nodes are represented with a unique node identification (ID) and range ID for both enabling the database tree to be modified and identifying descendants of each of the plurality of nodes in a single query.

Abstract: Selective tuple versioning is used on a file system providing file system snapshots by, receiving a request for updating at least one node and at least a node identification (ID) and associated attributes of the plurality of nodes, generating a new snapshot timestamp indicating the time of the updating, duplicating one of a plurality of rows of the nodes in the file system table into a new one of the rows of the file system table with an end time set equal to a new snapshot timestamp if the snapshot has the snapshot timestamp that is greater than a start time and less than the end time of the nodes, and updating the rows of the nodes in the file system table according to the update request, wherein the start time of the nodes is set equal to the new snapshot timestamp.

Abstract: A selective tuple versioning is used on a files system for preserving past states of file system nodes by adding a bitmap to a row for a node within a file system table for preserving the past state of the node in a file system, receiving a request for updating the node along with a node identification (ID) and associated attributes of the node needing to be updated, generating a second time value indicating the time of the updating, and duplicating the row for the node into a new row in the file system table with an end time set equal to the second time value if the bit in the bitmap for the node is set.

Abstract: A multiplicity of nodes are represented with a unique node identification (ID) and range ID for both enabling the database tree to be modified and identifying descendants of each of the plurality of nodes in a single query.

Abstract: Selective tuple versioning is used on a file system providing file system snapshots by, receiving a request for updating at least one node and at least a node identification (ID) and associated attributes of the plurality of nodes, generating a new snapshot timestamp indicating the time of the updating, duplicating one of a plurality of rows of the nodes in the file system table into a new one of the rows of the file system table with an end time set equal to a new snapshot timestamp if the snapshot has the snapshot timestamp that is greater than a start time and less than the end time of the nodes, and updating the rows of the nodes in the file system table according to the update request, wherein the start time of the nodes is set equal to the new snapshot timestamp.

Abstract: For preserving past states of file system nodes, selective tuple versioning on a file system table is used by adding a bitmap to a row for a node within a file system table for preserving the past state of the node in a file system. A request is received for updating the node along with a node identification and associated attributes of the node needing to be updated. A second time value indicating the time of the updating is generated. The row for the node is duplicated into a new row in the file system table with an end time set equal to the second time value if the bit in the bitmap for the node is set. The row associated with the node is updated according to the update request.

Abstract: Selective tuple versioning is used on a file system providing file system snapshots using selective tuple versioning for maintaining the state of the file system. The selective tuple versioning works by adding a snapshot table to associate with a file system table by storing a timestamp and a snapshot identification (ID) relating to a snapshot created for preserving past nodes in the file system.