Years and Authors of Summarized Original Work
2002; Buhrman, Miltersen, Radhakrishnan, Venkatesh
Problem Definition
The Problem and the Model
A static data structure problem consists of a set of data D, a set of queries Q, a set of answers A, and a function \(f : D \times Q \rightarrow A\). The goal is to store the data succinctly, so that any query can be answered with only a few probes to the data structure. Static membership is a well-studied problem in data structure design [2, 6, 9, 10, 16, 17, 23].
Definition 1 (Static Membership)
In the static membership problem, one is given a subset S of at most n keys from a universe U = { 1, 2, …, m}. The task is to store S so that queries of the form “Is u in S?” can be answered by making few accesses to the memory.
A natural and general model for studying any data structure problem is the cell probe model proposed by Yao [23].
Definition 2 (Cell Probe Model)
An (s, w, t) cell probe scheme for a static data structure problem \(f : D \times...
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Alon N and Feige U (2009) On the power of two, three and four probes. In: Proceedings of SODA’09, New York, pp 346–354
Brodnik A, Munro JI (1994) Membership in constant time and minimum space. In: Algorithms ESA’94: second annual European symposium, Utrecht. Lecture notes in computer science, vol 855, pp 72–81. Final version: Membership in constant time and almost-minimum space. SIAM J Comput 28(5):1627–1640 (1999)
Buhrman H, Miltersen PB, Radhakrishnan J, Venkatesh S (2002) Are bitvectors optimal? SIAM J Comput 31(6):1723–1744
Chen V, Grigorescu E, de Wolf R (2013) Error-correcting data structures. SIAM J Comput 42(1):84–111
Dyachkov AG, Rykov VV (1982) Bounds on the length of disjunctive codes. Problemy Peredachi Informatsii 18(3):7–13 [Russian]
Elias P, Flower RA (1975) The complexity of some simple retrieval problems. J Assoc Comput Mach 22:367–379
Erdős P, Frankl P, Füredi Z (1985) Families of finite sets in which no set is covered by the union of r others. Isr J Math 51:79–89
Fiat A, Naor M (1993) Implicit O(1) probe search. SIAM J Comput 22:1–10
Fiat A, Naor M, Schmidt JP, Siegel A (1992) Non-oblivious hashing. J Assoc Comput Mach 31:764–782
Fredman ML, Komlós J, Szemerédi E (1984) Storing a sparse table with O(1) worst case access time. J Assoc Comput Mach 31(3):538–544
Füredi Z (1996) On r-cover-free families. J Comb Theory Ser A 73:172–173
Garg M, Radhakrishnan J (2015) Set membership with a few bit probes. In: Proceedings of SODA’15, San Diego, pp 776–784
Katz J, Trevisan L (2000) On the efficiency of local decoding procedures for error-correcting codes. In: Proceedings of STOC’00, Portland, pp 80–86
Lewenstein M, Munro JI, Nicholson PK, Raman V (2014) Improved explicit data structures in the bitprobe model. In: Proceedings of ESA’14, Wroclaw, pp 630–641
Miltersen PB, Nisan N, Safra S, Wigderson A (1998) On data structures and asymmetric communication complexity. J Comput Syst Sci 57:37–49
Minsky M, Papert S (1969) Perceptrons. MIT, Cambridge
Pagh R (1999) Low redundancy in static dictionaries with O(1) lookup time. In: Proceedings of ICALP ’99, Prague. Lecture notes in computer science, vol 1644, pp 595–604
Radhakrishnan J, Raman V, Rao SS (2001) Explicit deterministic constructions for membership in the bitprobe model. In: Proceedings of ESA’01, Aarhus, pp 290–299
Radhakrishnan J, Shah S, Shannigrahi S (2010) Data structures for storing small sets in the bitprobe model. In: Proceedings of ESA’10, Liverpool, pp 159–170
Ruszinkó M (1984) On the upper bound of the size of r-cover-free families. J Comb Theory Ser A 66:302–310
Ta-Shma A (2002) Explicit one-probe storing schemes using universal extractors. Inf Process Lett 83(5):267–274
Viola E (2012) Bit-probe lower bounds for succinct data structures. SIAM J Comput 41(6):1593–1604
Yao ACC (1981) Should tables be sorted? J Assoc Comput Mach 28(3):615–628
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Srinivasan, V. (2016). Approximate Dictionaries. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_16
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_16
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering