摘要:
A computer-implemented method, system, and apparatus for storing binary data is disclosed. A processor receives a digital bit stream and transforms the digital bit stream to an encoded digital bit stream. The encoded digital bit stream comprises a data message encoded by an OCTS-expanded table for storage. The processor stores the encoded digital bit stream on a digital data storage device or system.
摘要:
Collecting, by a metadata controller (MDC) in a storage system, first information indicating a current working status of each computing node in the storage system, and second information indicating a current working status of each storage node in the storage system, determining, by the MDC based on the first information, a computing node that is one of the computing nodes and whose current working status is not a busy state as a current active computing node, determining, by the MDC based on the second information, a storage node that is one of the storage nodes and whose current working status is not a busy state as a current active storage node, and compressing, by a distributed software header (DSH) in the current active computing node or a memory manager (MM) in the current active storage node, a piece of data when the storage system needs to compress the data.
摘要:
A method and an apparatus for calculating an estimated data compression ratio relate to the field of data processing technologies. In the solutions, an estimated data compression ratio is calculated using a related indicator that represents a distribution pattern of symbols in a symbol sequence, where the related indicator that represents the distribution pattern of the symbols in the symbol sequence is relatively closely related to the estimated data compression ratio.
摘要:
A method and an apparatus for calculating an estimated data compression ratio relate to the field of data processing technologies. In the solutions, an estimated data compression ratio is calculated using a related indicator that represents a distribution pattern of symbols in a symbol sequence, where the related indicator that represents the distribution pattern of the symbols in the symbol sequence is relatively closely related to the estimated data compression ratio.
摘要:
Data records may be managed in a relational database by monitoring, a record length for a first data record in a page of memory, an amount of free space in the page, and a page length. In response to receiving an operator command to replace the first data record with a second data record, a database management system may determine whether an estimated record length of a compressed second data record is outside of the amount of free space in the page. In response to determining the estimated record length of a compressed second data record is outside of the amount of free space in the page, the database management system may determine whether an estimated length of a compressed page is outside of the page length. In response to determining the estimated length of a compressed page is within the page length, the page may be compressed.
摘要:
A method of encoding input data in an encoder to generate corresponding encoded data includes splitting and/or transforming the input data into data chunks, analyzing symbols present in the input data and compressing the symbols as a function of occurrence of the symbols in the data chunks; generating code tables, frequency tables, and/or length of code word tables for the symbols present in the data chunks; computing sets of indices relating the symbols in each data chunk and/or the compressed symbols to entries in the code tables, the frequency tables, and/or the length of code word tables; and assembling the sets of indices, together with the frequency tables, the code tables, and/or information indicative of such tables, for generating the encoded data. An encoder that utilizes the method, together with a corresponding decoder, wherein the encoder and the decoder in combination form a codec.
摘要:
A data compression and decompression algorithm performing the function of data compression and decompression by using the steps of: dividing a main data stream into sub data streams, calculating frequency of occurrence of sub data streams in the main data stream, repeating the process of calculating frequency of occurrence by changing the number of digits in sub data stream and by changing the starting digit position in main data stream, assigning codes to sub data streams based on their frequency occurrence values, calculating group dimension index for each group, selecting the group with the lowest group dimension index and placing codes of the group with the lowest group dimension index in a multi dimensional space wherein vector placement is utilized to eliminate the need to use digits that are common to neighboring codes therefore providing an additional compression.
摘要:
Data records may be managed in a relational database by monitoring, a record length for a first data record in a page of memory, an amount of free space in the page, and a page length. In response to receiving an operator command to replace the first data record with a second data record, a database management system may determine whether an estimated record length of a compressed second data record is outside of the amount of free space in the page. In response to determining the estimated record length of a compressed second data record is outside of the amount of free space in the page, the database management system may determine whether an estimated length of a compressed page is outside of the page length. In response to determining the estimated length of a compressed page is within the page length, the page may be compressed.
摘要:
A system, method, and computer program product are provided for saving and restoring a compression-decompression state. In operation, data is processed, the processing including compressing or decompressing the data. Additionally, a state of the processing is saved. Further, the state of the processing is restored.
摘要:
For boosting decompression in the presence of reoccurring Huffman trees, a previous Huffman tree is used to decompress a new data block if a match is identified between a compacted description of the Huffman tree and a recently used Huffman tree compaction.