Data structures for quadtree approximation and compression
Communications of the ACM
Robust transmission of unbounded strings using Fibonacci representations
IEEE Transactions on Information Theory
A data compression scheme for Chinese text files using Huffman coding and a two-level dictionary
Information Sciences—Informatics and Computer Science: An International Journal
An on-line variable-length binary encoding of text
Information Sciences: an International Journal
A text compression scheme that allows fast searching directly in the compressed file
ACM Transactions on Information Systems (TOIS)
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
An experimental study of a compressed index
Information Sciences: an International Journal - Dictionary based compression
Optimal encoding of non-stationary sources
Information Sciences: an International Journal - Dictionary based compression
Compression and Coding Algorithms
Compression and Coding Algorithms
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Compressing Relations and Indexes
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Data Compression
Fast Decoding of Fibonacci Encoded Texts
DCC '07 Proceedings of the 2007 Data Compression Conference
Variable-length Codes for Data Compression
Variable-length Codes for Data Compression
Using Fibonacci Compression Codes as Alternatives to Dense Codes
DCC '08 Proceedings of the Data Compression Conference
PPM with the extended alphabet
Information Sciences: an International Journal
Information Sciences: an International Journal
On the Usefulness of Fibonacci Compression Codes
The Computer Journal
Integrating unsupervised and supervised word segmentation: The role of goodness measures
Information Sciences: an International Journal
A fast and efficient nearly-optimal adaptive Fano coding scheme
Information Sciences: an International Journal
Run-length encodings (Corresp.)
IEEE Transactions on Information Theory
Benchmarking the compression of XML node streams
DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications
Lossy-to-lossless 3D image coding through prior coefficient lookup tables
Information Sciences: an International Journal
Information Sciences: an International Journal
Information Sciences: an International Journal
Hi-index | 0.07 |
Data compression has been widely applied in many data processing areas. Compression methods use variable-length codes with the shorter codes assigned to symbols or groups of symbols that appear in the data frequently. There exist many coding algorithms, e.g. Elias-delta codes, Fibonacci codes and other variable-length codes which are often applied to encoding of numbers. Although we often do not consider time consumption of decompression as well as compression algorithms, there are cases where the decompression time is a critical issue. For example, a real-time compression of data structures, applied in the case of the physical implementation of database management systems, follows this issue. In this case, pages of a data structure are decompressed during every reading from a secondary storage into the main memory or items of a page are decompressed during every access to the page. Obviously, efficiency of a decompression algorithm is extremely important. Since fast decoding algorithms were not known until recently, variable-length codes have not been used in the data processing area. In this article, we introduce fast decoding algorithms for Elias-delta, Fibonacci of order 2 as well as Fibonacci of order 3 codes. We provide a theoretical background making these fast algorithms possible. Moreover, we introduce a new code, called the Elias-Fibonacci code, with a lower compression ratio than the Fibonacci of order 3 code for lower numbers; however, this new code provides a faster decoding time than other tested codes. Codes of Elias-Fibonacci are shorter than other compared codes for numbers longer than 26 bits. All these algorithms are suitable in the case of data processing tasks with special emphasis on the decompression time.