Compressed data structures: Dictionaries and data-aware measures

Data Compression Conference Proceedings

Volumn , Issue , 2006, Pages 213-222

  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

CONSTANT FACTORS; LEADING TERMS; OPTIMAL TIME; PREDECESSOR QUERIES; RAM MODEL; SPACE USAGE; TIME BOUND; WORST CASE;

DATA STRUCTURES; OPTIMIZATION; RANDOM ACCESS STORAGE;

DATA COMPRESSION;

EID: 65749120725     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.2006.12     Document Type: Conference Paper

References (18)

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. D. Blandford and G. Blelloch. Compact representations of ordered sets. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2004.
3. P. Beame and F. Fich. Optimal bounds for the predecessor problem. In Proceedings of the ACM Symposium on Theory of Computing, 1999.
4. A. Brodnik and I. Munro. Membership in constant time and almost-minimum space. SIAM Journal on Computing, 28(5):1627-1640, October 1999. (Pubitemid 129304145)
5. T. C. Bell, A. Mo.at, 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.
6. P. Crescenzi, L. Dardini, and R. Grossi. Ip address lookup made fast and simple. In Proceedings of the European Symposium on Algorithms, pages 65-76, 1999.
7. P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, IT-21:194-203, 1975.
8. R. Grossi, A. Gupta, and J. S. Vitter. High-order entropy-compressed text indexes. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, January 2003.
9. A. Gupta, W. K. Hon, R. Shah, and J. S. Vitter. Compressed dictionaries: Space measures, data sets and experiments, 2005. In preparation.
10. Roberto Grossi and Kunihiko Sadakane. Squeezing succinct data structures into entropy bounds. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. To appear, 2006. (Pubitemid 43275351)
11. R. Grossi and J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In SIAM Journal on Computing (35(2):378-407). A shorter version appeared in the ACM Symposium on Theory of Computing, May 2000.
12. G. Jacobson. Succinct static data structures. Technical Report CMU-CS-89-112, Dept. of Computer Science, Carnegie-Mellon University, January 1989.
13. S. T. Klein and D. Shapira. Searching in compressed dictionaries. In Proceedings of the IEEE Data Compression Conference, 2002.
14. J. I. Munro. Tables. Foundations of Software Technology and Theoretical Computer Science, 16:37-42, 1996.
15. R. Pagh. Low redundancy in static dictionaries with O(1) worst case lookup time. In Proceedings of the International Colloquium on Automata, Languages, and Programming, 1999.
16. 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.
17. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Math. Systems Theory, 10:99-127, 1977.
18. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, Los Altos, CA, 2nd edition, 1999.