@inproceedings{DBLP:conf/sigmod/ZhouXSNMTABSLRD21,
  author       = {Jingyu Zhou and
                  Meng Xu and
                  Alexander Shraer and
                  Bala Namasivayam and
                  Alex Miller and
                  Evan Tschannen and
                  Steve Atherton and
                  Andrew J. Beamon and
                  Rusty Sears and
                  John Leach and
                  Dave Rosenthal and
                  Xin Dong and
                  Will Wilson and
                  Ben Collins and
                  David Scherer and
                  Alec Grieser and
                  Young Liu and
                  Alvin Moore and
                  Bhaskar Muppana and
                  Xiaoge Su and
                  Vishesh Yadav},
  editor       = {Guoliang Li and
                  Zhanhuai Li and
                  Stratos Idreos and
                  Divesh Srivastava},
  title        = {FoundationDB: {A} Distributed Unbundled Transactional Key Value Store},
  booktitle    = {{SIGMOD} '21: International Conference on Management of Data, Virtual
                  Event, China, June 20-25, 2021},
  pages        = {2653--2666},
  publisher    = {{ACM}},
  year         = {2021},
  url          = {https://doi.org/10.1145/3448016.3457559},
  doi          = {10.1145/3448016.3457559},
  timestamp    = {Tue, 31 Oct 2023 15:43:39 +0100},
  biburl       = {https://dblp.org/rec/conf/sigmod/ZhouXSNMTABSLRD21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{10.1145/78973.78977,
author = {Pugh, William},
title = {Skip lists: a probabilistic alternative to balanced trees},
year = {1990},
issue_date = {June 1990},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {33},
number = {6},
issn = {0001-0782},
url = {https://doi.org/10.1145/78973.78977},
doi = {10.1145/78973.78977},
abstract = {Skip lists are data structures that use probabilistic balancing rather than strictly enforced balancing. As a result, the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.},
journal = {Commun. ACM},
month = {6},
pages = {668-676},
numpages = {9},
keywords = {data structures, searching, trees}
}

@inproceedings{DBLP:conf/icde/LeisK013,
  author       = {Viktor Leis and
                  Alfons Kemper and
                  Thomas Neumann},
  editor       = {Christian S. Jensen and
                  Christopher M. Jermaine and
                  Xiaofang Zhou},
  title        = {The adaptive radix tree: ARTful indexing for main-memory databases},
  booktitle    = {29th {IEEE} International Conference on Data Engineering, {ICDE} 2013,
                  Brisbane, Australia, April 8-12, 2013},
  pages        = {38--49},
  publisher    = {{IEEE} Computer Society},
  year         = {2013},
  url          = {https://doi.org/10.1109/ICDE.2013.6544812},
  doi          = {10.1109/ICDE.2013.6544812},
  timestamp    = {Fri, 24 Mar 2023 00:00:01 +0100},
  biburl       = {https://dblp.org/rec/conf/icde/LeisK013.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@book{cormen2022introduction,
  title={Introduction to algorithms},
  author={Cormen, Thomas H and Leiserson, Charles E and Rivest, Ronald L and Stein, Clifford},
  year={2022},
  publisher={MIT press},
  chapter={17 Augmenting Data Structures}
}

@article{bentley1979decomposable,
  title={Decomposable searching problems},
  author={Bentley, Jon Louis and others},
  journal={Inf. Process. Lett.},
  volume={8},
  number={5},
  pages={244--251},
  year={1979}
}

@inproceedings{adelson1962algorithm,
  title={An algorithm for organization of information},
  author={Adelson-Velskii, Georgii Maksimovich and Landis, Evgenii Mikhailovich},
  booktitle={Doklady Akademii Nauk},
  volume={146},
  number={2},
  pages={263--266},
  year={1962},
  organization={Russian Academy of Sciences}
}

@inproceedings{guibas1978dichromatic,
  title={A dichromatic framework for balanced trees},
  author={Guibas, Leo J and Sedgewick, Robert},
  booktitle={19th Annual Symposium on Foundations of Computer Science (sfcs 1978)},
  pages={8--21},
  year={1978},
  organization={IEEE}
}

@article{seidel1996randomized,
  title={Randomized search trees},
  author={Seidel, Raimund and Aragon, Cecilia R},
  journal={Algorithmica},
  volume={16},
  number={4-5},
  pages={464--497},
  year={1996},
  publisher={Springer}
}

@article{comer1979ubiquitous,
  title={Ubiquitous B-tree},
  author={Comer, Douglas},
  journal={ACM Computing Surveys (CSUR)},
  volume={11},
  number={2},
  pages={121--137},
  year={1979},
  publisher={ACM New York, NY, USA}
}

@inproceedings{binna2018hot,
  title={HOT: A height optimized trie index for main-memory database systems},
  author={Binna, Robert and Zangerle, Eva and Pichl, Martin and Specht, G{\"u}nther and Leis, Viktor},
  booktitle={Proceedings of the 2018 International Conference on Management of Data},
  pages={521--534},
  year={2018}
}

@article{kung1981optimistic,
  title={On optimistic methods for concurrency control},
  author={Kung, Hsiang-Tsung and Robinson, John T},
  journal={ACM Transactions on Database Systems (TODS)},
  volume={6},
  number={2},
  pages={213--226},
  year={1981},
  publisher={ACM New York, NY, USA}
}