SIAM Journal on Computing
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Adaptive set intersections, unions, and differences
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Adaptive intersection and t-threshold problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Modern Information Retrieval
Binary Interpolative Coding for Effective Index Compression
Information Retrieval
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Exploiting clustering in inverted file Compression
DCC '96 Proceedings of the Conference on Data Compression
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Inverted Index Compression Using Word-Aligned Binary Codes
Information Retrieval
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Inverted index compression and query processing with optimized document ordering
Proceedings of the 18th international conference on World wide web
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Efficient set intersection for inverted indexing
ACM Transactions on Information Systems (TOIS)
Data structures: time, I/Os, entropy, joules!
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Range queries over untangled chains
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Untangled monotonic chains and adaptive range search
Theoretical Computer Science
Interpolative coding of integer sequences supporting log-time random access
Information Processing and Management: an International Journal
DACs: Bringing direct access to variable-length codes
Information Processing and Management: an International Journal
Faster and smaller inverted indices with treaps
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
| Hi-index | 0.00 |
Let X=x"1,x"2,...,x"n be a sequence of non-decreasing integer values. Storing a compressed representation of X that supports access and search is a problem that occurs in many domains. The most common solution to this problem uses a linear list and encodes the differences between consecutive values with encodings that favor small numbers. This solution includes additional information (i.e. samples) to support efficient searching on the encoded values. We introduce a completely different alternative that achieves compression by encoding the differences in a search tree. Our proposal has many applications, such as the representation of posting lists, geographic data, sparse bitmaps, and compressed suffix arrays, to name just a few. The structure is practical and we provide an experimental evaluation to show that it is competitive with the existing techniques.