This application discloses a data processing method and a related device. A file header including block information, a description information compression parameter, a sequence compression parameter, and a quality score compression parameter is obtained. A plurality of blocks are obtained based on the block information and a first file. Data corresponding to each of the plurality of blocks is compressed based on the compression parameters in the file header to obtain a data block corresponding to each of the plurality of blocks. A second file is obtained, where the second file includes the file header and the data block corresponding to each of the plurality of blocks.

A computer-implemented method for compressing structured data or semi-structured data is provided. The method comprises: (a) estimating one or more latent variables associated with rows or columns of the structured data or semi-structured data; (b) partitioning the structured data or semi-structured data in one or more blocks according to the one or more one or more latent variables; (c) applying a sequential encoding algorithm to each of the blocks; and (d) appending a compressed encoding of the one or more latent variables.

A processor-implemented method including generating k sub-compressed data streams based on a compressed data stream for a plurality of symbols divided into a plurality of k blocks and count information for each of the plurality of k blocks, generating k sub-symbols by processing each of the k sub-compressed data streams using k decoding engines, metadata about the compressed data stream, and generating an output data stream corresponding to the plurality of symbols based on the k sub-symbols.

Provided are a graph data compression method and apparatus. A computing device divides graph data including information about a source vertex and a destination vertex of an edge into a plurality of pieces, generates a plurality of compressed data obtained by compressing the plurality of pieces, and stores the plurality of compressed data as a file. The computing device may generate a plurality of pieces having a size equal to or less than a predefined data size by recursively dividing graph data.

A computer-implemented method for decompressing compressed data, the compressed data representing an n-bit decompressed data value, the compressed data comprising a first compressed subset of bits and a second compressed subset of bits, the first compressed subset representing the n2 most significant bits of the decompressed data value and the second compressed subset representing the two least significant bits of the decompressed data value, the method comprising performing decompression of the first compressed subset using a first decompression module to determine the n2 most significant bits of the decompressed data value; performing decompression of the second compressed subset using a second decompression module to determine the two least significant bits of the decompressed data value, the first and second decompression modules implementing different decompression schemes; and combining the determined n2 most significant bits of the decompressed data value and the determined two least significant bits of the decompressed data value to determine the n-bit decompressed data value.

An encoding scheme is provided for arithmetically encoding a sequence of information values into an arithmetic coded bitstream by providing the bitstream with entry point information, allowing for resuming arithmetic decoding of the bitstream from a predetermined entry point onward. A respective decoding scheme is also provided. These encoding and decoding schemes provide more efficient encoding in view of the decoding speed.

Disclosed are a compressor for a memory device and an operating method thereof. a method of operating the compressor for the memory device includes: extracting first features from pages corresponding to application programs; clustering the first features into clusters, and generating cluster features respectively corresponding to the clusters; generating trees for compression, the trees respectively corresponding to the cluster features; and storing the trees for performing compression in the memory device.

The present invention proposes a data processing method, a data processing apparatus, an electronic device, and a computer-readable storage medium. The method includes: in response to a data processing instruction, segmenting an original data to obtain multiple data segments of the original data to enable parallel processing of the multiple data segments, wherein the multiple data segments includes a first data segment; determining whether the first data segment is suitable for using a preset run-length encoding; and when the first data segment is suitable for using the run-length encoding, using the run-length encoding to perform a run-length encoding processing on the first data segment. According to some embodiments, the original data is initially segmented into multiple data segments, and each data segment can be processed independently and concurrently, thereby enhancing the speed of data compression processing.