License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2022.18
URN: urn:nbn:de:0030-drops-156145
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15614/
Bender, Michael A. ;
Farach-Colton, Martín ;
Kuszmaul, William
What Does Dynamic Optimality Mean in External Memory?
Abstract
A data structure A is said to be dynamically optimal over a class of data structures ? if A is constant-competitive with every data structure C ∈ ?. Much of the research on binary search trees in the past forty years has focused on studying dynamic optimality over the class of binary search trees that are modified via rotations (and indeed, the question of whether splay trees are dynamically optimal has gained notoriety as the so-called dynamic-optimality conjecture). Recently, researchers have extended this to consider dynamic optimality over certain classes of external-memory search trees. In particular, Demaine, Iacono, Koumoutsos, and Langerman propose a class of external-memory trees that support a notion of tree rotations, and then give an elegant data structure, called the Belga B-tree, that is within an O(log log N)-factor of being dynamically optimal over this class.
In this paper, we revisit the question of how dynamic optimality should be defined in external memory. A defining characteristic of external-memory data structures is that there is a stark asymmetry between queries and inserts/updates/deletes: by making the former slightly asymptotically slower, one can make the latter significantly asymptotically faster (even allowing for operations with sub-constant amortized I/Os). This asymmetry makes it so that rotation-based search trees are not optimal (or even close to optimal) in insert/update/delete-heavy external-memory workloads. To study dynamic optimality for such workloads, one must consider a different class of data structures.
The natural class of data structures to consider are what we call buffered-propagation trees. Such trees can adapt dynamically to the locality properties of an input sequence in order to optimize the interactions between different inserts/updates/deletes and queries. We also present a new form of beyond-worst-case analysis that allows for us to formally study a continuum between static and dynamic optimality. Finally, we give a novel data structure, called the Jεllo Tree, that is statically optimal and that achieves dynamic optimality for a large natural class of inputs defined by our beyond-worst-case analysis.
BibTeX - Entry
@InProceedings{bender_et_al:LIPIcs.ITCS.2022.18,
author = {Bender, Michael A. and Farach-Colton, Mart{\'\i}n and Kuszmaul, William},
title = {{What Does Dynamic Optimality Mean in External Memory?}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {18:1--18:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15614},
URN = {urn:nbn:de:0030-drops-156145},
doi = {10.4230/LIPIcs.ITCS.2022.18},
annote = {Keywords: Dynamic optimality, external memory, buffer propagation, search trees}
}
|
Keywords: |
|
Dynamic optimality, external memory, buffer propagation, search trees |
|
Collection: |
|
13th Innovations in Theoretical Computer Science Conference (ITCS 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
25.01.2022 |
