Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing (2308.16042v2)

Published 30 Aug 2023 in cs.DS

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]x[u] using s words of space and answering key lookup queries in t = O(lg(u/n)/ lg(s/n)) nonadaptive 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. 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.
  2. 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.
  3. 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.
  4. Adapt or die: Polynomial lower bounds for non-adaptive dynamic data structures. Theory Comput., 11:471–489, 2015.
  5. Are bitvectors optimal? SIAM Journal on Computing, 31(6):1723–1744, 2002.
  6. Hall-type theorems for fast dynamic matching and applications. arXiv preprint arXiv:2204.01936, 2022.
  7. Bounds on the independence required for cuckoo hashing. Manuscript, 2009.
  8. 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.
  9. Universal classes of hash functions. In Proceedings of the ninth annual ACM symposium on Theory of computing, pages 106–112, 1977.
  10. Almost random graphs with simple hash functions. In Proceedings of the thirty-fifth Annual ACM Symposium on Theory of Computing, pages 629–638, 2003.
  11. Storing a sparse table with 0(1) worst case access time. J. ACM, 31(3):538–544, 1984.
  12. Set membership with non-adaptive bit probes. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017.
  13. Unbalanced expanders and randomness extractors from parvaresh-vardy codes. J. ACM, 56(4):20:1–20:34, 2009.
  14. Optimal non-adaptive cell probe dictionaries and hashing. arXiv preprint arXiv:2308.16042, 2023.
  15. 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.
  16. 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.
  17. 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.
  18. 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.
  19. Tight static lower bounds for non-adaptive data structures. CoRR, abs/2001.05053, 2020.
  20. Lower bounds on non-adaptive data structures maintaining sets of numbers, from sunflowers. In 33rd Computational Complexity Conference, 2018.
  21. Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discret. Math., 13(1):2–24, 2000.
  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.
  23. Robert Endre Tarjan and Andrew Chi-Chih Yao. Storing a sparse table. Communications of the ACM, 22(11):606–611, 1979.
  24. Andrew Chi-Chih Yao. Should tables be sorted? J. ACM, 28(3):615–628, 1981.
  25. Kevin Yeo. Cuckoo hashing in cryptography: Optimal parameters, robustness and applications. In Annual International Cryptology Conference, pages 197–230. Springer, 2023.
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now