Compact dictionaries for variable-length keys and data with applications

ACM Transactions on Algorithms

Volumn 4, Issue 2, 2008, Pages

  Blandford, Daniel K ^a   Blelloch, Guy E ^b,c  

^a GOOGLE INC   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c Carnegie Mellon University   (United States)

Author keywords

Compression

Indexed keywords

BIT LENGTHS; BIT STRINGS; CONSTANT TIME (CONTI);

CHEMICAL MODIFICATION; DATA STRUCTURES; FILE ORGANIZATION; VARIATIONAL TECHNIQUES;

KEYS (FOR LOCKS);

EID: 44849115971     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1361192.1361194     Document Type: Article

References (31)

1. BAKER, H. G. 1978. List processing in real-time on a serial computer. Comm. ACM 21, 4, 280-294.
2. BENOIT, D., DEMAINE, E. D., RAMAN, J. I. M. R., RAMAN, V., AND RAO, S. 2005. Representing trees of higher degree. Algorithmica 43, 4, 275-292.
3. BLANDFORD, D. AND BLELLOCH, G. 2004. Compact representations of ordered sets. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA). 11-19.
4. BLANDFORD, D., BLELLOCH, G., AND KASH, I. 2003. Compact representations of separable graphs. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA). 342-351.
5. BLANDFORD, D., BLELLOCH, G., AND KASH, I. 2004. An experimental analysis of a compact graph representation. In Proceedings of the 6th Workshop on Workshop on Algorithm Engineering and Experiments (ALENEX).
6. BLANDFORD, D. K., BLELLOCH, G. E., CARDOZE, D. E., AND KADOW, C. 2005. Compact representations of simplicial meshes in two and three dimensions. Int. J. Comput. Geom. Appl. 15, 1, 3-24.
7. BLELLOCH, G. E., MAGGS, B., AND WOO, M. 2003. Space-efficient finger search on degree-balanced search trees. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA). 374-383.
8. BRODNIK, A. AND MUNRO, J. I. 1999. Membership in constant time and almost-minimum space. Siam J. Comput. 28, 5, 1627-1640.
9. CARTER, L. AND WEGMAN, M. 1979. Universal classes of hash functions. J. Comput. Syst. Sci. 18, 2, 143-154.
10. CHUANG, R. C.-N., GARG, A., HE, X., KAO, M.-Y., AND LU, H.-I. 1998. Compact encodings of planar graphs via canonical orderings and multiple parentheses. Lecture Notes in Computer Science, vol. 1443, 118-129.
11. CLEARY, J. G. 1984. Compact hash tables using bidirectional linear probing. IEEE Trans. Comput. 9, 828-834.
12. COHEN, S. AND MATIAS, Y. 2003. Spectral bloom filters. In Proceedings of the International Conference on Management of Data (SIGMOD). 241-252.
13. DIETZFELBINGER, M., KARLIN, A. R., MEHLHORN, K., AUF DER HEIDE, F. M., ROHNERT, H., AND TARJAN, R. E. 1994. Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput. 23, 4, 738-761.
14. ELIAS, P. 1975. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory 21, 2, 194-203.
15. FOTAKIS, D., PAGH, R., SANDERS, P., AND SPIRAKIS, P. G. 2005. Space efficient hash tables with worst case constant access time. Theory Comput. Syst. 38, 2, 229-248.
16. FREDMAN, M. L., KOMLOS, J., AND SZEMERDI, E. 1984. Storing a sparse table with O(1) worst case access time. J. ACM 31, 3, 538-544.
17. GROSSI, R. AND VITTER, J. S. 2005. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput. 35, 2, 378-407.
18. HE, X., KAO, M.-Y., AND LU, H.-I. 2000. A fast general methodology for information-theoretically optimal encodings of graphs. SIAM J. Comput. 30, 3, 838-846.
19. JACOBSON, G. 1989. Space-efficient static trees and graphs. In Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS). 549-554.
20. KEELER, K. AND WESTBROOK, J. 1995. Short encodings of planar graphs and maps. Discrete Appl. Math. 58, 239-252.
21. KNUTH, D. E. 1973. The Art of Computer Programming/Sorting and Searching Vol. 3. Addison Wesley.
22. MEHLHORN, K. AND NAHER, S. 1990. Bounded ordered dictionaries in O(log log N) time and O(n) space. Inform. Process. Lett. 35, 4, 183-189.
23. MILLER, G. L., TENG, S.-H., THURSTON, W. P., AND VAVASIS, S. A. 1997. Separators for sphere-packings and nearest neighbor graphs. J. ACM 44, 1-29.
24. MUNRO, J. I. 1996. Tables. In Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, Vol. 1180, Springer-Verlag, 37-42.
25. MUNRO, J. I. AND RAMAN, V. 2001. Succinct representation of balanced parentheses, static trees and planar graphs. SIAM J. Comput. 31, 2, 762-776.
26. PAGH, R. 2001. Low redundancy in static dictionaries with constant query time. SIAM J. Comput. 31, 2, 353-363.
27. PAGH, R. AND RODLER, F. F. 2004. Cuckoo hashing. J. Algor. 51, 2, 122-144.
28. RAMAN, R., RAMAN, V., AND RAO, S. S. 2002. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA).
29. RAMAN, R. AND RAO, S. S. 2003. Succinct dynamic dictionaries and trees. In Proceedings of the 30th International Colloquium on Automata; Languages and Computation (ICALP). 357-36.
30. T URÁN, G. 1984. Succinct representations of graphs. Discrete Appl. Math. 8, 289-294.
31. VAN EMDE BOAS, P., KAAS, R., AND ZIJLSTRA, E. 1976. Design and implementation of an efficient priority queue. Math. Syst. Theory 10, 2, 99-127.