Document Type
Conference Proceeding
Publication Date
12-1-2022
Department
Department of Computer Science
Abstract
The Bϵ-tree [Brodal and Fagerberg 2003] is a simple I/O-efficient external-memory-model data structure that supports updates orders of magnitude faster than B-tree with a query performance comparable to the B-tree: for any positive constant ϵ < 1 insertions and deletions take O(B11-ϵ logB N) time (rather than O(logB N) time for the classic B-tree), queries take O(logB N) time and range queries returning k items take O(logB N + Bk) time. Although the Bϵ-tree has an optimal update/query tradeoff, the runtimes are amortized. Another structure, the write-optimized skip list, introduced by Bender et al. [PODS 2017], has the same performance as the Bϵ-tree but with runtimes that are randomized rather than amortized. In this paper, we present a variant of the Bϵ-tree with deterministic worst-case running times that are identical to the original’s amortized running times.
Publication Title
Leibniz International Proceedings in Informatics, LIPIcs
ISBN
9783959772587
Recommended Citation
Das, R.,
Iacono, J.,
&
Nekrich, Y.
(2022).
External-Memory Dictionaries with Worst-Case Update Cost.
Leibniz International Proceedings in Informatics, LIPIcs,
248.
http://doi.org/10.4230/LIPIcs.ISAAC.2022.21
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/16640
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Version
Publisher's PDF
Publisher's Statement
© Rathish, Das, John Iacono, and Yakov Nekrich. Publisher’s version of record: https://doi.org/10.4230/LIPIcs.ISAAC.2022.21