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.SEA.2021.7
URN: urn:nbn:de:0030-drops-137799
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13779/
Dinklage, Patrick ;
Fischer, Johannes ;
Herlez, Alexander
Engineering Predecessor Data Structures for Dynamic Integer Sets
Abstract
We present highly optimized data structures for the dynamic predecessor problem, where the task is to maintain a set S of w-bit numbers under insertions, deletions, and predecessor queries (return the largest element in S no larger than a given key). The problem of finding predecessors can be viewed as a generalized form of the membership problem, or as a simple version of the nearest neighbour problem. It lies at the core of various real-world problems such as internet routing.
In this work, we engineer (1) a simple implementation of the idea of universe reduction, similar to van-Emde-Boas trees (2) variants of y-fast tries [Willard, IPL'83], and (3) B-trees with different strategies for organizing the keys contained in the nodes, including an implementation of dynamic fusion nodes [Pǎtraşcu and Thorup, FOCS'14]. We implement our data structures for w = 32,40,64, which covers most typical scenarios.
Our data structures finish workloads faster than previous approaches while being significantly more space-efficient, e.g., they clearly outperform standard implementations of the STL by finishing up to four times as fast using less than a third of the memory. Our tests also provide more general insights on data structure design, such as how small sets should be stored and handled and if and when new CPU instructions such as advanced vector extensions pay off.
BibTeX - Entry
@InProceedings{dinklage_et_al:LIPIcs.SEA.2021.7,
author = {Dinklage, Patrick and Fischer, Johannes and Herlez, Alexander},
title = {{Engineering Predecessor Data Structures for Dynamic Integer Sets}},
booktitle = {19th International Symposium on Experimental Algorithms (SEA 2021)},
pages = {7:1--7:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-185-6},
ISSN = {1868-8969},
year = {2021},
volume = {190},
editor = {Coudert, David and Natale, Emanuele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13779},
URN = {urn:nbn:de:0030-drops-137799},
doi = {10.4230/LIPIcs.SEA.2021.7},
annote = {Keywords: integer data structures, dynamic data structures, predecessor, universe reduction, y-fast trie, fusion tree, B-tree}
}
