Compressed dictionaries: Space measures, data sets, and experiments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4007 LNCS, Issue , 2006, Pages 158-169

  Gupta, Ankur ^a   Hon, Wing Kai ^a   Shah, Rahul ^a   Vitter, Jeffrey Scott ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; ENCODING (SYMBOLS); PROBLEM SOLVING; SET THEORY;

COMBINATORIAL ENCODINGS; DICTIONARY PROBLEM; SPACE-TIME TRADEOFFS;

DATA STRUCTURES;

EID: 33746098893     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11764298_14     Document Type: Conference Paper

References (15)

1. A. Andersson and M. Thorup. Tight(er) worst-case bounds on dynamic searching and priority queues. In Proceedings of the ACM Symposium on Theory of Computing, 2000.
2. P. Beame and P. Fich. Optimal bounds for the predecessor problem. In Proceedings of the ACM Symposium on Theory of Computing, 1999.
3. T. C. Bell, A. Moffat, C. G. Nevill-Manning, I. H. Witten, and J. Zobel. Data compression in full-text retrieval systems. Journal of the American Society for Information Science, 44(9):508-531, 1993.
4. D. Blandford and G. Blelloch. Compact representations of ordered sets. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2004.
5. A. Brodnik and I. Munro. Membership in constant time and almost-minimum space. SIAM Journal on Computing, 28(5):1627-1640, 1999.
6. P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, IT-21:194-203, 1975.
7. R. Grossi and K. Sadakane. Squeezing succinct data structures into entropy bounds. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2006.
8. A. Gupta, W. Hon, R. Shah, and J. Vitter. Compressed data structures: Dictionaries and data-aware measures. In Proceedings of the IEEE Data Compression Conference, 2006.
9. G. Jacobson. Succinct static data structures. Technical Report CMU-CS-89-112, Carnegie-Mellon University, 1989.
10. S. T. Klein and D. Shapira. Searching in compressed dictionaries. In Proceedings of the IEEE Data Compression Conference, 2002.
11. J. I. Munro. Tables. Foundations of Software Technology and Theoretical Computer Science, 16:37-42, 1996.
12. R. Raman, V. Raman, and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 233-242, 2002.
13. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Math. Systems Theory, 10:99-127, 1977.
14. D. E. Willard. New trie data structures which support very fast search operations. Journal of Computer and System Sciences, 28(3):379-394, 1984.
15. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, 1999.