Compressed data structures: Dictionaries and data-aware measures

Theoretical Computer Science

Volumn 387, Issue 3, 2007, Pages 313-331

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

^a BUTLER UNIVERSITY   (United States)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^c Louisiana State University   (United States)

^d Purdue University   (United States)

Author keywords

BSGAP; Compressed; Dictionary problem; Gap encoding; Predecessor; Rank; Select

Indexed keywords

COMBINATORIAL MATHEMATICS; DATA COMPRESSION; MATHEMATICAL MODELS; PROBLEM SOLVING;

DATASETS; DICTIONARY PROBLEM; GAP ENCODING; PREDECESSOR;

DATA STRUCTURES;

EID: 35448972513     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.07.042     Document Type: Article

References (23)

1. A. Andersson, M. Thorup, Tight(er) worst-case bounds on dynamic searching and priority queues, in: ACM Symposium on Theory of Computing, STOC, 2000
2. D. Blandford, G. Blelloch, Compact representations of ordered sets, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, January 2004
3. D. Blandford, G. Blelloch, Dictionaries using variable-length keys and data, with applications, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, January 2005
4. P. Beame, F. Fich, Optimal bounds for the predecessor problem, in: ACM Symposium on Theory of Computing, STOC, 1999, pp. 295-304
5. Brodnik A., and Munro I. Membership in constant time and almost-minimum space. SIAM Journal on Computing 28 5 (1999) 1627-1640
6. Bell T.C., Moffat A., Nevill-Manning C.G., Witten I.H., and Zobel J. Data compression in full-text retrieval systems. Journal of the American Society for Information Science 44 9 (1993) 508-531
7. P. Crescenzi, L. Dardini, R. Grossi, IP address lookup made fast and simple, in: European Symposium on Algorithms, ESA, 1999, pp. 65-76
8. Elias P. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory IT-21 (1975) 194-203
9. Fredman M.L., and Willard D.E. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences 47 3 (1993) 424-436
10. R. Grossi, A. Gupta, J.S. Vitter, High-order entropy-compressed text indexes, in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, January 2003
11. Greene D.H., and Knuth D.E. Mathematics for the Analysis of Algorithms (1981), Birkhäuser, Boston
12. Grossi R., and Vitter J.S. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. Proceedings of the ACM Symposium on Theory of Computing vol. 32 (2000)
13. G. Jacobson, Succinct static data structures, Technical Report CMU-CS-89-112, Dept. of Computer Science, Carnegie-Mellon University, January 1989
14. S.T. Klein, D. Shapira, Searching in compressed dictionaries, in: Data Compression Conference, DCC, 2002
15. Mäkinen V., and Navarro G. Rank and select revisited and extended. Theoretical Computer Science (2006)
16. Munro J.I. Tables. Foundations of Software Technology and Theoretical Computer Science 16 (1996) 37-42
17. Pagh R. Low redundancy in static dictionaries with O (1) worst case lookup time. Proceedings of the International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science vol. 1644 (1999), Springer-Verlag 595-604
18. M. Pa ̌traşcu, M. Thorup, Time-space trade-offs for predecessor search, in: Proceedings of the ACM Symposium on Theory of Computing, 2006, pp. 232-240
19. R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 233-242
20. K. Sadakane, R. Grossi, Squeezing succinct data structures into entropy bounds, in: ACM-SIAM Symposium on Discrete Algorithms, SODA, 2006, pp. 1230-1239
21. van Emde Boas P., Kaas R., and Zijlstra E. Design and implementation of an efficient priority queue. Mathematical Systems Theory 10 (1977) 99-127
22. Willard D.E. New trie data structures which support very fast search operations. Journal of Computer and System Sciences 28 3 (1984) 379-394
23. Witten I.H., Moffat A., and Bell T.C. Managing Gigabytes: Compressing and Indexing Documents and Images. second ed. (1999), Morgan Kaufmann Publishers, Los Altos, CA