Author:
Jermaine Christopher,Omiecinski Edward,Yee Wai Gen
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Information Systems
Reference37 articles.
1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Communications of the ACM 31, 1116–1127 (1988)
2. Agarwal, P.K., Arge, L., Procopiuc, O., Vitter, J.S.: A framework for index bulk loading and dynamization. In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001) pp. 115–127. Crete, Greece (2001)
3. Arge, L.: The buffer tree: A new technique for optimal I/O-algorithms (extended abstract). In: Algorithms and Data Structures, 4th International Workshop (WADS 1995) pp. 334–345. Kingston, Ontario, Canada (1995)
4. Arge, L., Hinrichs, K., Vahrenhold, J., Vitter, J.S.: Efficient bulk operations on dynamic R-trees. Algorithm Engineering and Experimentation, International Workshop (ALE-NEX 1999), Baltimore, MD, USA. January 15–16, pp. 328–348 (1999)
5. Bentley, J.L.: Decomposable searching problems. Information Processing Letters 8(5), 244–251 (1979)
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Increase Merge Efficiency in LSM Trees Through Coordinated Partitioning of Sorted Runs;2023 IEEE International Conference on Big Data (BigData);2023-12-15
2. Spooky;Proceedings of the VLDB Endowment;2022-07
3. Comparison and evaluation of state-of-the-art LSM merge policies;The VLDB Journal;2021-02-13
4. Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores;Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data;2020-06-11
5. LSM-based storage techniques: a survey;The VLDB Journal;2019-07-19