Document Open Access Logo

B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load

Authors Roodabeh Safavi , Martin P. Seybold

PDF

File

Thumbnail PDF
PDF
LIPIcs.WADS.2025.47.pdf
  • Filesize: 1.03 MB
  • 23 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
Keywords
  • Unique Representation
  • Randomization
  • Top-Down Analysis
  • Block Search Tree
  • Write-Efficiency
  • Storage-Efficiency

Metrics

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

Abstract

Uniquely represented (UR) data structures represent each logical state with a unique storage state. We study the problem of maintaining a dynamic set of n keys from a totally ordered universe in this context. UR structures are also called "strongly history independent" structures in the literature.
We introduce a two-layer data structure called (α,ε)-Randomized Block Search Tree (RBST) that is uniquely represented and suitable for external memory (EM). Though RBSTs naturally generalize the well-known binary Treaps, several new ideas are needed to analyze the expected search, update, and storage efficiency in terms of block-reads, block-writes, and blocks stored. We prove that searches have O(ε^{-1} + log_α n) block-reads, that dynamic updates perform O(ε^{-1} + log_α(n)/α) block-writes and O(ε^{-2}+(1+(ε^{-1}+log n)/α)log_α n) block-reads, and that (α, ε)-RBSTs have an asymptotic load-factor of at least (1-ε) for every ε ∈ (0,1/2].
Thus (α, ε)-RBSTs improve on the known, uniquely represented B-Treap [Golovin; ICALP'09]. Compared with non-UR structures, the RBST is also, to the best of our knowledge, the first external memory structure that is storage-efficient and has a non-amortized, write-efficient update bound.

Cite As Get BibTex

Roodabeh Safavi and Martin P. Seybold. B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load. In 19th International Symposium on Algorithms and Data Structures (WADS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 349, pp. 47:1-47:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.WADS.2025.47

Author Details

Roodabeh Safavi
  • Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria
Martin P. Seybold
  • Faculty of Computer Science, Theory and Applications of Algorithms, University of Vienna, Austria

Funding

This work was supported under the Australian Research Council Discovery Projects funding scheme (project number DP180102870). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) "The Design of Modern Fully Dynamic Data Structures (MoDynStruct)" and from the Austrian Science Fund (FWF) project Z 422-N and project "Fast Algorithms for a Reactive Network Layer (ReactNet)" P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020-2024.

References

  1. Arne Andersson and Thomas Ottmann. New Tight Bounds on Uniquely Represented Dictionaries. SIAM J. Comput., 24(5):1091-1101, 1995. URL: https://doi.org/10.1137/S0097539792241102.
  2. Lars Arge. The buffer tree: A technique for designing batched external data structures. Algorithmica, 37(1):1-24, 2003. URL: https://doi.org/10.1007/s00453-003-1021-x.
  3. Ricardo A. Baeza-Yates. The expected behaviour of b+-trees. Acta Informatica, 26(5):439-471, 1989. URL: https://doi.org/10.1007/BF00289146.
  4. Rudolf Bayer and Edward M. McCreight. Organization and maintenance of large ordered indices. Acta Informatica, 1:173-189, 1972. URL: https://doi.org/10.1007/BF00288683.
  5. Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, and Julian Shun. Parallel algorithms for asymmetric read-write costs. In Proc. Symposium on Parallelism in Algorithms and Architectures (SPAA'16), pages 145-156, 2016. URL: https://doi.org/10.1145/2935764.2935767.
  6. Michael A. Bender, Jonathan W. Berry, Rob Johnson, Thomas M. Kroeger, Samuel McCauley, Cynthia A. Phillips, Bertrand Simon, Shikha Singh, and David Zage. Anti-persistence on persistent storage: History-independent sparse tables and dictionaries. In Proc. 35th Symposium on Principles of Database Systems (PODS'16), pages 289-302. ACM, 2016. URL: https://doi.org/10.1145/2902251.2902276.
  7. Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, and Jelani Nelson. Cache-oblivious streaming b-trees. In Proc. Symposium on Parallelism in Algorithms and Architectures (SPAA'07), pages 81-92. ACM, 2007. URL: https://doi.org/10.1145/1248377.1248393.
  8. Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, and Julian Shun. Sorting with asymmetric read and write costs. In Proc. Symposium on Parallelism in Algorithms and Architectures (SPAA'15), pages 1-12, 2015. URL: https://doi.org/10.1145/2755573.2755604.
  9. Guy E. Blelloch and Daniel Golovin. Strongly History-Independent Hashing with Applications. In Proc. 48th Symposium on Foundations of Computer Science (FOCS'07), 2007. URL: https://doi.org/10.1109/FOCS.2007.36.
  10. Guy E. Blelloch, Daniel Golovin, and Virginia Vassilevska. Uniquely Represented Data Structures for Computational Geometry. In Joachim Gudmundsson, editor, Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT'08), pages 17-28. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-69903-3_4.
  11. Guy E. Blelloch and Margaret Reid-Miller. Fast set operations using treaps. In Proc. 10th Symposium on Parallel Algorithms and Architectures (SPAA'98), pages 16-26, 1998. URL: https://doi.org/10.1145/277651.277660.
  12. Milutin Brankovic, Nikola Grujic, André van Renssen, and Martin P. Seybold. A simple dynamization of trapezoidal point location in planar subdivisions. In Proc. 47th International Colloquium on Automata, Languages, and Programming (ICALP'20), pages 18:1-18:18, 2020. URL: https://doi.org/10.4230/LIPIcs.ICALP.2020.18.
  13. Gerth Stølting Brodal and Rolf Fagerberg. Lower bounds for external memory dictionaries. In Proc. 14th Symposium on Discrete Algorithms (SODA'03), pages 546-554, 2003. URL: https://dl.acm.org/doi/10.5555/644108.644201.
  14. Douglas Comer. The ubiquitous b-tree. ACM Comput. Surv., 11(2):121-137, 1979. URL: https://doi.org/10.1145/356770.356776.
  15. Mark de Berg, Otfried Cheong, Marc J. van Kreveld, and Mark H. Overmars. Computational Geometry: Algorithms and Applications, 3rd Edition. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-77974-2.
  16. James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, and Robert Endre Tarjan. Making data structures persistent. J. Comput. Syst. Sci., 38(1):86-124, 1989. URL: https://doi.org/10.1016/0022-0000(89)90034-2.
  17. Amr Elmasry, Mostafa Kahla, Fady Ahdy, and Mahmoud Hashem. Red-black trees with constant update time. Acta Informatica, 56(5):391-404, 2019. URL: https://doi.org/10.1007/s00236-019-00335-9.
  18. Eric Demaine et al. Lecture notes on persistent data structures. URL: https://web.archive.org/web/20230601205149/http://courses.csail.mit.edu/6.851/spring21/scribe/lec1.pdf.
  19. Daniel Golovin. Uniquely represented data structures with applications to privacy. PhD thesis, Carnegie Mellon University, 2008. Google Scholar
  20. Daniel Golovin. B-Treaps: A Uniquely Represented Alternative to B-Trees. In Proc. 36th International Colloquium on Automata, Languages, and Programming (ICALP'09), pages 487-499, 2009. URL: https://doi.org/10.1007/978-3-642-02927-1_41.
  21. Daniel Golovin. The b-skip-list: A simpler uniquely represented alternative to b-trees. CoRR, abs/1005.0662, 2010. URL: https://arxiv.org/abs/1005.0662.
  22. Dana Jansens. Persistent binary search trees. https://web.archive.org/web/20230526175144/https://cglab.ca/~dana/pbst/, 2014. Accessed: 2023-05-26.
  23. Donald E. Knuth. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, 1973. Google Scholar
  24. Klaus Küspert. Storage Utilization in B*-Trees with a Generalized Overflow Technique. Acta Informatica, 19:35-55, 1983. URL: https://doi.org/10.1007/BF00263927.
  25. Ketan Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, 1994. Google Scholar
  26. Moni Naor and Vanessa Teague. Anti-presistence: history independent data structures. In Proc. 33rd Symposium on Theory of Computing (STOC'01), pages 492-501, 2001. URL: https://doi.org/10.1145/380752.380844.
  27. Raimund Seidel and Cecilia R. Aragon. Randomized Search Trees. Algorithmica, 16(4/5):464-497, 1996. URL: https://doi.org/10.1007/BF01940876.
  28. Lawrence Snyder. On uniquely represented data strauctures. In Proc. 18th Symposium on Foundations of Computer Science (SFCS'77), pages 142-146, 1977. URL: https://doi.org/10.1109/SFCS.1977.22.
  29. Rajamani Sundar and Robert Endre Tarjan. Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences. SIAM J. Comput., 23(1):24-44, 1994. URL: https://doi.org/10.1137/S0097539790189733.
  30. Jeffrey Scott Vitter. External memory algorithms and data structures. ACM Comput. Surv., 33(2):209-271, 2001. URL: https://doi.org/10.1145/384192.384193.
  31. Jean Vuillemin. A unifying look at data structures. Commun. ACM, 23(4):229-239, 1980. URL: https://doi.org/10.1145/358841.358852.
  32. Andrew Chi-Chih Yao. On Random 2-3 Trees. Acta Informatica, 9:159-170, 1978. URL: https://doi.org/10.1007/BF00289075.
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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact