Implicit B-trees: New results for the dictionary problem

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 145-154

  Franceschini, Gianni ^a   Grossi, Roberto ^a   Munro, J Ian ^b   Pagli, Linda ^a  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; DATA HANDLING; DATA STORAGE EQUIPMENT; DATA TRANSFER; DATABASE SYSTEMS; ENCODING (SYMBOLS); PROBLEM SOLVING;

BLOCK TRANSFER; IMPLICIT B-TREES; MEMORY HIERARCHY;

DATA STRUCTURES;

EID: 0036949101     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. G. M. Adel'son-Vel'skii and E. M. Landis. An algorithm for the organization of information. Soviet Mathematics Doklady, 3:1259-1263, 1962.
2. A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson. A tradeoff between search and update time for the implicit dictionary problem. Theoretical Computer Science, 58(1-3):57-68, 1988.
3. A. Brodnik and J. I. Munro. Membership in constant time and almost-minimum space. SIAM Journal on Computing, 28(5):1627-1640, 1999.
4. Z. Chen. Compression from the database perspective. In DIMACS Working Group Meeting on Data Compression in Networks and Applications, 2002.
5. A. Fiat, J. I. Munro, M. Naor, A. A. Schäffer, J. P. Schmidt, and A. Siegel. An implicit data structure for searching a multikey table in logarithmic time. Journal of Computer and System Sciences, 43(3):406-424, 1991.
6. R. W. Floyd. Algorithm 245 (TREESORT). Communications of the ACM, 7:701, 1964.
7. G. N. Frederickson. Implicit data structures for the dictionary problem. Journal of the ACM, 30(1):80-94, 1983.
8. G. N. Frederickson. Self-organizing heuristics for implicit data structures. SIAM Journal on Computing, 13(2):277-291, 1984.
9. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, 1984.
10. 2 n) time. Journal of Computer and System Sciences, 33(1):66-74, 1986.
11. J. I. Munro and H. Suwanda. Implicit data structures for fast search and update. Journal of Computer and System Sciences, 21(2):236-250, 1980.
12. R. Pagh. Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, 31(2):353-363, 2002.
13. J. Radhakrishnan and V. Raman. A tradeoff between search and update in dictionaries. Information Processing Letters, 80(5):243-247, 2001.
14. R. Raman, V. Raman, and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In ACM-SIAM SODA, pages 233-242, 2002.
15. J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7:347-348, 1964.
16. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann Publishers, Los Altos, CA 94022, USA, second edition, 1999.
17. A. C. Yao. Should tables be sorted? J. Assoc. Comput. Mach., 31:245-281, 1984.