Document Open Access Logo

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing

Authors Kasper Green Larsen , Rasmus Pagh , Giuseppe Persiano , Toniann Pitassi , Kevin Yeo , Or Zamir

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.104.pdf
  • Filesize: 0.65 MB
  • 12 pages

Document Identifiers

Author Details

Kasper Green Larsen
  • Aarhus University, Denmark
Rasmus Pagh
  • BARC, University of Copenhagen, Denmark
Giuseppe Persiano
  • Università di Salerno, Italy
  • Google, New York, NY, USA
Toniann Pitassi
  • Columbia University, New York, NY, USA
Kevin Yeo
  • Columbia University, New York, NY, USA
  • Google, New York, NY, USA
Or Zamir
  • Tel Aviv University, Israel

Funding

  • Larsen, Kasper Green: Supported by Independent Research Fund Denmark (DFF) Sapere Aude Research Leader grant No 9064-00068B.
  • Pagh, Rasmus: Supported by grant 16582, Basic Algorithms Research Copenhagen (BARC), from the VILLUM Foundation.
  • Persiano, Giuseppe: Partially supported by a FARB grant, from Università di Salerno.
  • Pitassi, Toniann: Research supported by NSF AF:Medium 2212136
  • Zamir, Or: Supported in part by Len Blavatnik and the Blavatnik Family foundation.

Cite AsGet BibTex

Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo, and Or Zamir. Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 104:1-104:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.104

Abstract

We present a simple and provably optimal non-adaptive cell probe data structure for the static dictionary problem. Our data structure supports storing a set of n key-value pairs from [u]× [u] using s words of space and answering key lookup queries in t = O(lg(u/n)/lg(s/n)) non-adaptive probes. This generalizes a solution to the membership problem (i.e., where no values are associated with keys) due to Buhrman et al. We also present matching lower bounds for the non-adaptive static membership problem in the deterministic setting. Our lower bound implies that both our dictionary algorithm and the preceding membership algorithm are optimal, and in particular that there is an inherent complexity gap in these problems between no adaptivity and one round of adaptivity (with which hashing-based algorithms solve these problems in constant time). Using the ideas underlying our data structure, we also obtain the first implementation of a n-wise independent family of hash functions with optimal evaluation time in the cell probe model.

Subject Classification

ACM Subject Classification
  • Theory of computation → Data structures design and analysis
Keywords
  • non-adaptive
  • cell probe
  • dictionary
  • hashing

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Noga Alon and Uriel Feige. On the power of two, three and four probes. In Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, pages 346-354. SIAM, 2009. Google Scholar
  2. Bruno Bauwens and Marius Zimand. Hall-type theorems for fast dynamic matching and applications. arXiv preprint arXiv:2204.01936, 2022. Google Scholar
  3. Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Pătraşcu, Milan Ruzic, and Peter Tiedemann. Deterministic load balancing and dictionaries in the parallel disk model. In Phillip B. Gibbons and Uzi Vishkin, editors, SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pages 299-307. ACM, 2006. URL: https://doi.org/10.1145/1148109.1148160.
  4. Joe Boninger, Joshua Brody, and Owen Kephart. Non-adaptive data structure bounds for dynamic predecessor search. In 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India, volume 93 of LIPIcs, pages 20:1-20:12, 2017. Google Scholar
  5. Joshua Brody and Kasper Green Larsen. Adapt or die: Polynomial lower bounds for non-adaptive dynamic data structures. Theory Comput., 11:471-489, 2015. URL: https://doi.org/10.4086/toc.2015.v011a019.
  6. H. Buhrman, P. B. Miltersen, J. Radhakrishnan, and S. Venkatesh. Are bitvectors optimal? SIAM Journal on Computing, 31(6):1723-1744, 2002. URL: https://doi.org/10.1137/S0097539702405292.
  7. J Lawrence Carter and Mark N Wegman. Universal classes of hash functions. In Proceedings of the ninth annual ACM symposium on Theory of computing, pages 106-112, 1977. Google Scholar
  8. Tobias Christiani, Rasmus Pagh, and Mikkel Thorup. From independence to expansion and back again. In Rocco A. Servedio and Ronitt Rubinfeld, editors, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pages 813-820. ACM, 2015. URL: https://doi.org/10.1145/2746539.2746620.
  9. Jeffrey Cohen and Daniel M. Kane. Bounds on the independence required for cuckoo hashing. Manuscript, 2009. URL: https://cseweb.ucsd.edu//~dakane/cuchkoohashing.pdf.
  10. Martin Dietzfelbinger and Philipp Woelfel. Almost random graphs with simple hash functions. In Proceedings of the thirty-fifth Annual ACM Symposium on Theory of Computing, pages 629-638, 2003. Google Scholar
  11. Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with 0(1) worst case access time. J. ACM, 31(3):538-544, 1984. URL: https://doi.org/10.1145/828.1884.
  12. Mohit Garg and Jaikumar Radhakrishnan. Set membership with non-adaptive bit probes. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Google Scholar
  13. Venkatesan Guruswami, Christopher Umans, and Salil P. Vadhan. Unbalanced expanders and randomness extractors from parvaresh-vardy codes. J. ACM, 56(4):20:1-20:34, 2009. URL: https://doi.org/10.1145/1538902.1538904.
  14. Kasper Green Larsen, Rasmus Pagh, Toniann Pitassi, and Or Zamir. Optimal non-adaptive cell probe dictionaries and hashing. arXiv preprint arXiv:2308.16042, 2023. Google Scholar
  15. Anna Pagh and Rasmus Pagh. Uniform hashing in constant time and linear space. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 622-628, 2003. Google Scholar
  16. Rasmus Pagh. On the cell probe complexity of membership and perfect hashing. In Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pages 425-432. ACM, 2001. URL: https://doi.org/10.1145/380752.380836.
  17. Rasmus Pagh and Flemming Friche Rodler. Cuckoo hashing. In Friedhelm Meyer auf der Heide, editor, Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, volume 2161 of Lecture Notes in Computer Science, pages 121-133. Springer, 2001. URL: https://doi.org/10.1007/3-540-44676-1_10.
  18. Rina Panigrahy, Kunal Talwar, and Udi Wieder. Lower bounds on near neighbor search via metric expansion. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pages 805-814. IEEE, 2010. Google Scholar
  19. Giuseppe Persiano and Kevin Yeo. Tight static lower bounds for non-adaptive data structures. CoRR, abs/2001.05053, 2020. URL: https://arxiv.org/abs/2001.05053.
  20. Jaikumar Radhakrishnan and Amnon Ta-Shma. Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discret. Math., 13(1):2-24, 2000. URL: https://doi.org/10.1137/S0895480197329508.
  21. Sivaramakrishnan Natarajan Ramamoorthy and Anup Rao. Lower bounds on non-adaptive data structures maintaining sets of numbers, from sunflowers. In 33rd Computational Complexity Conference, 2018. Google Scholar
  22. Alan Siegel. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pages 20-25. IEEE Computer Society, 1989. URL: https://doi.org/10.1109/SFCS.1989.63450.
  23. Robert Endre Tarjan and Andrew Chi-Chih Yao. Storing a sparse table. Communications of the ACM, 22(11):606-611, 1979. Google Scholar
  24. Andrew Chi-Chih Yao. Should tables be sorted? J. ACM, 28(3):615-628, 1981. URL: https://doi.org/10.1145/322261.322274.
  25. Kevin Yeo. Cuckoo hashing in cryptography: Optimal parameters, robustness and applications. In Annual International Cryptology Conference, pages 197-230. Springer, 2023. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact