Data compression: methods and theory
Data compression: methods and theory
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Compact pat trees
Efficient Storage and Retrieval by Content and Address of Static Files
Journal of the ACM (JACM)
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
Compression and Coding Algorithms
Compression and Coding Algorithms
Binary Interpolative Coding for Effective Index Compression
Information Retrieval
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Inverted Index Compression Using Word-Aligned Binary Codes
Information Retrieval
Super-Scalar RAM-CPU Cache Compression
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Lightweight natural language text compression
Information Retrieval
A general compression algorithm that supports fast searching
Information Processing Letters
A simple storage scheme for strings achieving entropy bounds
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Variable-length Codes for Data Compression
Variable-length Codes for Data Compression
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Directly Addressable Variable-Length Codes
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Broadword implementation of rank/select queries
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Compressed q-Gram Indexing for Highly Repetitive Biological Sequences
BIBE '10 Proceedings of the 2010 IEEE International Conference on Bioinformatics and Bioengineering
Compressed string dictionaries
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Interpolative coding of integer sequences supporting log-time random access
Information Processing and Management: an International Journal
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Phrase-Based pattern matching in compressed text
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Practical compressed suffix trees
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Faster and smaller inverted indices with treaps
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Compact representation of Web graphs with extended functionality
Information Systems
On the compression of search trees
Information Processing and Management: an International Journal
Hi-index | 0.00 |
We present a new variable-length encoding scheme for sequences of integers, Directly Addressable Codes (DACs), which enables direct access to any element of the encoded sequence without the need of any sampling method. Our proposal is a kind of implicit data structure that introduces synchronism in the encoded sequence without using asymptotically any extra space. We show some experiments demonstrating that the technique is not only simple, but also competitive in time and space with existing solutions in several applications, such as the representation of LCP arrays or high-order entropy-compressed sequences.