Draft paper introduction

paper/bibliography.bib

@@ -51,8 +51,8 @@ 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 = {jun},
-pages = {668–676},
+month = {6},
+pages = {668-676},
 numpages = {9},
 keywords = {data structures, searching, trees}
 }
@@ -75,4 +75,81 @@ keywords = {data structures, searching, trees}
   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{10.5555/17299,
+author = {Bernstein, Philip A and Hadzilacos, Vassos and Goodman, Nathan},
+title = {Concurrency control and recovery in database systems},
+year = {1986},
+isbn = {0201107155},
+publisher = {Addison-Wesley Longman Publishing Co., Inc.},
+address = {USA}
+}
+
+@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}
+}