Abstract
A static dictionary is a data structure for storing subsets of a finite universe U, so that membership queries can be answered efficiently. We study this problem in a unit cost RAM model with word size Ω(log |U|), and show that for n-element subsets, constant worst case query time can be obtained using B + O(log log |U|) + o(n) bits of storage, where B = [log2( |U|n ) is the minimum number of bits needed to represent all such subsets. For |U|= nlogo(1)n the dictionary supports constant time rank queries.
Supported in part by the ESPRIT Long Term Research Programme of the EU under project number 20244 (ALCOM-IT)
Basic Research in Computer Science, Centre of the Danish National Research Foundation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Adleman and M. Huang. Recognizing primes in random polynomial time. In Alfred Aho, editor, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 462–469, New York City, NY, May 1987. ACM Press.
A. Brodnik and J.I. Munro. Membership in constant time and almost minimum space. To appear in SIAM Journal on Computing.
A. Brodnik and J.I. Munro. Membership in constant time and minimum space. Lecture Notes in Computer Science, 855:72–81, 1994.
Faith Fich and Peter Bro Miltersen. Tables should be sorted (on random access machines). In Algorithms and data structures (Kingston, ON, 1995), pages 482–493. Springer, Berlin, 1995.
Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time. J. Assoc. Comput. Mach., 31(3):538–544, 1984.
Michael L. Fredman and Michael E. Saks. The cell probe complexity of dynamic data structures. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 345–354, Seattle, Washington, 15-17 May 1989.
D.R. Heath-Brown and H. Iwaniec. On the difference between consecutive primes. Invent. Math., 55(1):49–69, 1979.
Peter Bro Miltersen. Lower bounds for static dictionaries on RAMs with bit operations but no multiplication. In Automata, languages and programming (Paderborn, 1996), pages 442–453. Springer, Berlin, 1996.
Jeanette P. Schmidt and Alan Siegel. The spatial complexity of oblivious k-probe hash functions. SIAM J. Comput., 19(5):775–786, 1990.
Robert Endre Tarjan and Andrew Chi Chih Yao. Storing a sparse table. Communications of the ACM, 22(11):606–611, November 1979.
Andrew Chi Chih Yao. Should tables be sorted? J. Assoc. Comput. Mach., 28(3):615–628, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pagh, R. (1999). Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_56
Download citation
DOI: https://doi.org/10.1007/3-540-48523-6_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66224-2
Online ISBN: 978-3-540-48523-0
eBook Packages: Springer Book Archive