A data storage apparatus includes a storage including a plurality of planes, which include a plurality of pages, and a controller configured to control the storage to read data by grouping the plurality of pages as a page group in an interleaving unit, manage pages in which valid data are stored, among the plurality of pages, as a first bitmap table, and manage a second bitmap table generated by compressing the first bitmap table in a page group unit.

In a data reading operation, a first terminal in a distributed storage system obtains a first data identifier, which is a unique identifier of first data in the distributed storage system. The first terminal determines, based on the first data identifier, whether first data is local data. When the first data is not local data, the first terminal obtains a first identifier that uniquely identifies the first data in the distributed storage system. The first terminal obtains, based on the first identifier, a second identifier corresponding to the first data and associated with content of the first data. The first terminal obtains, based on the second identifier, a read address that indicates that the first data is stored at a second terminal in the distributed storage system. The first terminal then retrieves the first data from the second terminal.

It is made possible to pursue both higher speeds of rebuilds in the distributed RAID scheme and high availability due to acquisition of DE-failure tolerance. A virtual chunk includes k (k is an integer that is equal to or larger than two) virtual parcels including a virtual parcel having user data and a virtual parcel having element data that is redundant data for repairing the user data, the virtual parcels included in the same virtual chunk is stored by mapping the virtual parcels in storage areas of k mutually different physical storage drives among N (k<N) of the physical storage drives, and the maximum value of the numbers of the same virtual parcels to be mapped to the physical storage drives housed in the same drive enclosures is equal to or smaller than a predetermined value.

A solid state drive having a drive aggregator and multiple component solid state drives. The drive aggregator associates the host interfaces with different logical address spaces, interprets commands received from the host interfaces in the different logical address spaces, and implements the commands using the plurality of component solid state drives. Some of the host interfaces can be configured to share a common logical address space. Some of the logical address spaces can be configured to have an overlapping region that are hosted on the same set of memory units such that the memory units can be addressed in any of the logical address spaces having the overlapping region.

A method, computer program product, and computing system for identifying a first memory device source that includes first content; identifying a second memory device source that include second content; and initiating a first iteration of a memory device cleansing procedure wherein first content and at least a first portion of the second content are moved to a first unused memory device.

The compression and decompression of files can be selectively offloaded to a hardware controller. A hardware controller, such as the controller of an SSD or other drive, can include a compression engine that is configured to implement compression techniques. A filter driver in the I/O pathway on a computing device may be configured to intercept an application's attempt to write a file to or read a file from the SSD or other drive and to selectively offload compression or decompression of the file to a compression engine on the SSD or other drive.

Systems, apparatuses, and methods may provide for an eventually-consistent distributed caching mechanism for database systems. As an example, the system may include a recently updated objects (RUO) manager, which may store object identifiers of recently updated objects and RUO time-to-live values of the object identifiers. As servers read objects from the cache or write objects into the cache, the servers may also check the RUO manager to determine if the object has been updated recently enough to be at risk of being stale or outdated. If so, the servers may invalidate the object stored at the cache as it may be stale, which results in eventual consistency across the distributed database system.

Systems, apparatuses, and methods related to bit string conversion are described. A memory resource and/or logic circuitry may be used in performance of bit string conversion operations. The logic circuitry can perform operations on bit strings, such as universal number and/or posit bit strings, to alter a level of precision (e.g., a dynamic range, resolution, etc.) of the bit strings. For instance, the memory resource can receive data comprising a bit string having a first quantity of bits that correspond to a first level of precision. The logic circuitry can determine that the bit string having the first quantity of bits has a particular data pattern and alter the first quantity of bits to a second quantity of bits that correspond to a second level of precision based, at least in part, on the determination that the bit string has the particular data pattern.

Embodiments of the present disclosure measure a state of a storage group within a storage array. The embodiments also increase or decrease a compression ratio corresponding to input/output (I/O) operations on the storage group based on a target data reduction ratio (DRR) of the storage array, an expected performance envelope, and a compressibility factor of the storage group.

A method for data storage tape access ordering is provided. The method receives an order request for accessing a plurality of data segments stored on a data storage tape. Each data segment is defined by segment characteristics. The method identifies a number of data segments within the plurality of data segments in the order request. The method determines an order model based on the number of data segments and the segment characteristics of the plurality of data segments. The method generates an access order for the plurality of data segments based on the order model and retrieves a subset of data segments from the data storage tape based on the access order.