2026-07-22T14:20:41Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17306 2024-03-06T10:59:25Z ddc:004 open_access

External-Memory Dictionaries with Worst-Case Update Cost Das, Rathish Iacono, John Nekrich, Yakov Data Structures External Memory Buffer Tree 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(1/B^(1-ε) log_B N) time (rather than O(log_BN) time for the classic B-tree), queries take O(log_B N) time and range queries returning k items take O(log_B N + k/B) 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Rathish Das and John Iacono and Yakov Nekrich 2022 Is Part Of LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2022.21 urn:nbn:de:0030-drops-173060 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.21 eng https://creativecommons.org/licenses/by/4.0/legalcode