diff options
Diffstat (limited to 'references')
| -rw-r--r-- | references/references.bib | 98 |
1 files changed, 98 insertions, 0 deletions
diff --git a/references/references.bib b/references/references.bib index 0dbc804..5fef30a 100644 --- a/references/references.bib +++ b/references/references.bib @@ -421,6 +421,25 @@ bibsource = {dblp computer science bibliography, https://dblp.org} } +@inproceedings{overmars81-2, + author = {Mark H. Overmars and + Jan van Leeuwen}, + editor = {Peter Deussen}, + title = {Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case + Bounds}, + booktitle = {Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, + March 23-25, 1981, Proceedings}, + series = {Lecture Notes in Computer Science}, + volume = {104}, + pages = {224--233}, + publisher = {Springer}, + year = {1981}, + url = {https://doi.org/10.1007/BFb0017314}, + doi = {10.1007/BFB0017314}, + timestamp = {Tue, 14 May 2019 10:00:39 +0200}, + biburl = {https://dblp.org/rec/conf/tcs/OvermarsL81.bib}, + bibsource = {dblp computer science bibliography, https://dblp.org} +} @article{naidan14, author = {Bilegsaikhan Naidan and Magnus Lie Hetland}, @@ -1482,3 +1501,82 @@ keywords = {analytic model, analysis of algorithms, overflow chaining, performan } +@misc{leveldb, + author = {Sanjay Ghemawat and Jeff Dean}, + title = {LevelDB}, + year = {2025}, + publisher = {GitHub}, + journal = {GitHub repository}, + howpublished = {\url{https://github.com/google/leveldb}} +} + + +@inproceedings{monkey, + author = {Niv Dayan and + Manos Athanassoulis and + Stratos Idreos}, + editor = {Semih Salihoglu and + Wenchao Zhou and + Rada Chirkova and + Jun Yang and + Dan Suciu}, + title = {Monkey: Optimal Navigable Key-Value Store}, + booktitle = {Proceedings of the 2017 {ACM} International Conference on Management + of Data, {SIGMOD} Conference 2017, Chicago, IL, USA, May 14-19, 2017}, + pages = {79--94}, + publisher = {{ACM}}, + year = {2017}, + url = {https://doi.org/10.1145/3035918.3064054}, + doi = {10.1145/3035918.3064054}, + timestamp = {Thu, 14 Oct 2021 10:11:38 +0200}, + biburl = {https://dblp.org/rec/conf/sigmod/DayanAI17.bib}, + bibsource = {dblp computer science bibliography, https://dblp.org} +} + +@inproceedings{dostoevsky, + author = {Niv Dayan and + Stratos Idreos}, + editor = {Gautam Das and + Christopher M. Jermaine and + Philip A. Bernstein}, + title = {Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value + Stores via Adaptive Removal of Superfluous Merging}, + booktitle = {Proceedings of the 2018 International Conference on Management of + Data, {SIGMOD} Conference 2018, Houston, TX, USA, June 10-15, 2018}, + pages = {505--520}, + publisher = {{ACM}}, + year = {2018}, + url = {https://doi.org/10.1145/3183713.3196927}, + doi = {10.1145/3183713.3196927}, + timestamp = {Wed, 21 Nov 2018 12:44:08 +0100}, + biburl = {https://dblp.org/rec/conf/sigmod/DayanI18.bib}, + bibsource = {dblp computer science bibliography, https://dblp.org} +} + +@misc{autumn, + title={Autumn: A Scalable Read Optimized LSM-tree based Key-Value Stores with Fast Point and Range Read Speed}, + author={Fuheng Zhao and Zach Miller and Leron Reznikov and Divyakant Agrawal and Amr El Abbadi}, + year={2024}, + eprint={2305.05074}, + archivePrefix={arXiv}, + primaryClass={cs.DB}, + url={https://arxiv.org/abs/2305.05074}, +} + +@inproceedings{sarkar23, + author = {Subhadeep Sarkar and + Niv Dayan and + Manos Athanassoulis}, + title = {The {LSM} Design Space and its Read Optimizations}, + booktitle = {39th {IEEE} International Conference on Data Engineering, {ICDE} 2023, + Anaheim, CA, USA, April 3-7, 2023}, + pages = {3578--3584}, + publisher = {{IEEE}}, + year = {2023}, + url = {https://doi.org/10.1109/ICDE55515.2023.00273}, + doi = {10.1109/ICDE55515.2023.00273}, + timestamp = {Sun, 12 Nov 2023 02:08:10 +0100}, + biburl = {https://dblp.org/rec/conf/icde/SarkarDA23.bib}, + bibsource = {dblp computer science bibliography, https://dblp.org} +} + |