In some examples, a system performs data deduplication using a deduplication fingerprint index in a hash data structure comprising a plurality of blocks, wherein a block of the plurality of blocks comprises fingerprints computed based on content of respective data values. The system merges, in a merge operation, updates for the deduplication fingerprint index to the hash data structure stored in a persistent storage. As part of the merge operation, the system mirrors the updates to a cached copy of the hash data structure in a cache memory, and updates, in an indirect block, information regarding locations of blocks in the cached copy of the hash data structure.

Representative embodiments set forth herein disclose techniques for implementing dynamic file system volumes that can share storage space with other file system (FS) volumes within the same partition/storage device. According to some embodiments, techniques are disclosed for establishing an FS volume within a container. According to other embodiments, techniques are disclosed for handling input/output (I/O) requests across different FS volumes. According to yet other embodiments, techniques are disclosed for efficiently establishing, within a storage device, an FS volume from an image of the FS volume.

The present disclosure discloses a system for content curation and collaboration. The system comprises a database arrangement configured to store an uncurated and/or a curated content and a data processing arrangement communicably coupled to the database arrangement. The data processing arrangement is configured to enable secured access of a user to the uncurated and/or the curated content stored in the database arrangement, identify at least one content relevant to the user from the uncurated and/or the curated content stored in the database arrangement based on at least one input received from the user, and provide the relevant content to the user in a desired format.

Transmitting or storing subsegments is disclosed. A data stream or a data block is received and broken into a plurality of segments. For at least one segment, the segment is broken into a plurality of subsegments. A previously stored or transmitted segment similar to the at least one segment is identified. A fingerprint is computed for at least one subsegment. And, using the fingerprint for the at least one subsegment, determining whether the at least one subsegment is identical to a subsegment of the previously stored or transmitted segment without directly comparing the content of the at least one subsegment with the content of the subsegment of the previously stored or transmitted segment.

Example apparatus and methods process virtual machine image level backups that may include files that are compressed and files that are not compressed. Example apparatus and methods may produce virtual machine image level backups by selectively compressing some files associated with the image while leaving other files in their uncompressed state. Example apparatus and methods may selectively recover a file or even an entire disk image from an image level backup that may include both compressed files and files that are not compressed. The file recovery or image recovery may be performed at the file level by accessing files in the image and selectively decompressing files that are compressed in the image while passing through files that are not compressed in the image. Different files in a single image may be compressed or decompressed using different techniques.

Described are techniques for creating windows of free blocks in a file system selected in accordance with trigger conditions. A first slice is selected, in accordance with slice selection criteria, from a plurality of slices of storage provisioned for use by the file system. First processing is performed on the first slice that creates at least one window of free blocks in the first slice for use by the file system. It is determined, in accordance with termination criteria, whether to process one or more additional slices of the file system to create additional windows of free blocks for use by the file system. Such processing to create free windows may be subject to various limits of resource consumption.

Various systems facilitate encrypted file storage. A client device may generate an encrypted version of a file. The client device may obtain at least one reference to at least one storage location for the encrypted version of the file. The client device may cause the encrypted version of the file to be store at the at least one storage location using the at least one reference to the at least one storage location.

An information processing apparatus refers to a first variable in a case where an object saving instruction is received, sets a second variable to a value indicating that an object is being saved in a case where a state of a saving destination of an object is a normal state, refers to the second variable in a case where a deletion instruction of a saving destination of an object is received, sets the first variable to a value indicating that a state of the saving destination is a deletion start state and then refers to the second variable again in a case where an object is not being saved, responds that deletion of the saving destination is not possible in a case where an object is being saved.

The embodiments described herein relate to managing compressed data to optimize file compression for efficient random access to the data. A first partition of a first data block of a compression group is compressed. The first compressed partition is stored in a first compression entity. An in-memory table is maintained, which includes updating the in-memory table with data associated with an address of the stored compressed first partition. At such time as it is determined that the first compression entity is full, the in-memory table is compressed and written to the first compression entity. Accordingly, the in-memory table, which stores partition compression data, is store with the compression entity.

Embodiments are provided for enhancing storage efficiency in a de-duplication enabled storage system. Metadata of a shared-nothing clustered file system is scanned, and a first state of the storage system is determined. One or more cores are located from the metadata. Each core includes a grouping of objects having a minimum coreness. An arrangement of the located cores is optimized to improve global de-duplication efficiency by evaluating the objects of each core, identifying respective nodes in the storage system to maintain each core for de-duplication efficiency based on the evaluation, and re-arranging one or more of the evaluated objects in the storage system.