A method for determining an encoding used for a sequence of bytes may be provided. The method comprises providing a set of candidate code pages and transforming them into different groups of sequences of bytes, wherein each group of sequences of bytes corresponds to one of the candidate code pages. Thereby each code point is transformed by applying a transformation from one of the candidate code pages to a reference code point value relating to a reference encoding for each code point. The method comprises further separating each of the transformed sequences of bytes into groups of tokens, wherein each group of tokens relates to one candidate code page, and providing an index relating to a text corpus. Furthermore, the method comprises selecting a code page from the set of candidate code pages at least partially based on how many tokens are found in the index.

A method for compressing data is disclosed. The method may include classifying the data from a plurality of data sources into classifications including at least PCM-encoded data and data structure information. The method may also include determining data states associated with the PCM-encoded data and the data structure information. The method may further include compressing the PCM-encoded data and the data structure information into compressed bit-streams based on the determined data states. The method may also include shuffling the compressed bit-streams to introduce randomness.

A computer-implemented method for compressing, an input group of m data values compresses the two least significant bits of each of the data values by mapping the two least significant bits of each of the data values in the input group of m data values collectively onto an m-bit encoding and storing the m-bit encoding, the m-bit encoding being selected from 2.sup.m m-bit encodings, the 2.sup.m m-bit encodings comprising a first group of encodings comprising (2.sup.m4) m-bit encodings and a second group of encodings comprising four m-bit encodings, wherein if the selected encoding is an encoding from the first group of encodings then the selected encoding represents the two least significant bits for a representative group of m data values in which the second least significant bit of each of the data values is the same as a respective bit of the m-bit encoding, and wherein if the selected encoding is an encoding from the second group of encodings then the selected encoding represents the two least significant bits for a representative group of m data values in which the two least significant bits for each of the data values in the representative group are equal to the two least significant bits of the other data values in the representative group.

The present disclosure may provide systems and methods for data storage. The systems may store data of one or more fields as a byte sequence. The byte sequence may include a first section and a second section. The second section may be configured to store the data of the one or more fields. The first section may be configured to store one or more label items corresponding to the one or more fields. For one of the one or more label items and a corresponding field, the label item may include a field label of the corresponding field and a position label of the corresponding field. The position label of the corresponding field may be configured to identify a position where data of the corresponding field is stored in the second section.

In several aspects, a computing device analyzes data to determine its characteristics. The computing device selects at least one compression process based on the characteristics. A compression switch and a compression level are dynamically adjusted based on multiple factors including available system resources, desired storage savings and performance requirement. The compression level dynamically varies depending on the data being processed and a workload on a system. Performance of compression and decompression operations are continuously monitored for dynamically adjusting compression parameters to optimize performance.

A method includes: receiving, by a server node, a first notification indicating that a first message received by a first node of a cluster of nodes is not a redundant message and cannot be stored by a data store of the nodes, wherein the nodes are managed by the server node; determining to invoke a compression process used to compress message identifiers stored in the first node; receiving a first public key associated with the first node; generating a compression key; generating a first encrypted compression key by encrypting the compression key with the first public key; sending, to the first node, the first encrypted compression key; and receiving, from the first node, a second notification of storing, in a compressed form using a key decrypted from the first encrypted compression key, at least one message identifier in a data store of the first node.

A computer-implemented method for compressing, an input group of m data values compresses the two least significant bits of each of the data values by mapping the two least significant bits of each of the data values in the input group of m data values collectively onto an m-bit encoding and storing the m-bit encoding, the m-bit encoding being selected from 2.sup.m m-bit encodings, the 2.sup.m m-bit encodings comprising a first group of encodings comprising (2.sup.m4) m-bit encodings and a second group of encodings comprising four m-bit encodings, wherein if the selected encoding is an encoding from the first group of encodings then the selected encoding represents the two least significant bits for a representative group of m data values in which the second least significant bit of each of the data values is the same as a respective bit of the m-bit encoding, and wherein if the selected encoding is an encoding from the second group of encodings then the selected encoding represents the two least significant bits for a representative group of m data values in which the two least significant bits for each of the data values in the representative group are equal to the two least significant bits of the other data values in the representative group.

A data service implements a configurable data compressor/decompressor using a recipe generated for a particular data set type and using compression operators of a common registry (e.g., pantry) that are referenced by the recipe, wherein the recipe indicates at which nodes of a compression graph respective ones of the compression operators of the registry are to be implemented. The configurable data compressor/decompressor provides a customizable framework for compressing data sets of different types (e.g., belonging to different data domains) using a common compressor/decompressor implemented using a common set of compression operators.

A compressor for compressing a control signal includes residual compression circuitry configured to sequentially receive a first control signal and a second control signal and perform compression based on a difference between the first control signal and the second control signal, coding mode determination circuitry configured to determine a coding mode based on a type of control signal, analog signal compression circuitry configured to perform compression based on indexing, and control signal compression circuitry configured to perform compression based on run-length encoding (RLE).

An electronic device for compressing data includes a compression unit, a search engine, and a compression controller. The search engine includes a first buffer, a second buffer, and a plurality of comparators configured to perform matching between data stored in the first buffer and data stored in the second buffer. The compression controller is configured to determine a structure of the search engine, adjust a connection between the first buffer and the second buffer based on the determined structure and cause the compression unit to perform compression on target data using the search engine.