{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T23:58:58Z","timestamp":1772927938983,"version":"3.50.1"},"reference-count":88,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-1910216"],"award-info":[{"award-number":["IIS-1910216"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-2337806"],"award-info":[{"award-number":["IIS-2337806"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s00778-024-00876-7","type":"journal-article","created":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T06:14:57Z","timestamp":1733811297000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An update-intensive LSM-based R-tree index"],"prefix":"10.1007","volume":"34","author":[{"given":"Jaewoo","family":"Shin","sequence":"first","affiliation":[]},{"given":"Libin","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Jianguo","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8169-7775","authenticated-orcid":false,"given":"Walid G.","family":"Aref","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,10]]},"reference":[{"key":"876_CR1","unstructured":"AsterixDB. URL http:\/\/asterix.ics.uci.edu\/"},{"issue":"9","key":"876_CR2","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.14778\/3397230.3397236","volume":"13","author":"WY Alkowaileet","year":"2020","unstructured":"Alkowaileet, W.Y., Alsubaiee, S., Carey, M.J.: An LSM-based tuple compaction framework for apache AsterixDB. Proc. VLDB Endow. 13(9), 1388\u20131400 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"876_CR3","doi-asserted-by":"publisher","unstructured":"Alsubaiee, S., Altowim, Y., Altwaijry, H., Behm, A., Borkar, V., Bu, Y., Carey, M., Cetindil, I., Cheelangi, M., Faraaz, K., Gabrielova, E., Grover, R., Heilbron, Z., Kim, Y.S., Li, C., Li, G., Ok, J.M., Onose, N., Pirzadeh, P., Tsotras, V., Vernica, R., Wen, J., Westmann, T.: AsterixDB: a scalable, open source BDMS. Proc. VLDB Endow. 7(14), 1905\u20131916 (2014). https:\/\/doi.org\/10.14778\/2733085.2733096","DOI":"10.14778\/2733085.2733096"},{"issue":"10","key":"876_CR4","doi-asserted-by":"publisher","first-page":"841","DOI":"10.14778\/2732951.2732958","volume":"7","author":"S Alsubaiee","year":"2014","unstructured":"Alsubaiee, S., Behm, A., Borkar, V., Heilbron, Z., Kim, Y.S., Carey, M.J., Dreseler, M., Li, C.: Storage management in AsterixDB. Proc. VLDB Endow. (PVLDB) 7(10), 841\u2013852 (2014)","journal-title":"Proc. VLDB Endow. (PVLDB)"},{"key":"876_CR5","doi-asserted-by":"crossref","unstructured":"Alsubaiee, S., Carey, M.J., Li, C.: LSM-based storage and indexing: an old idea with timely benefits. In: Second International ACM Workshop on Managing and Mining Enriched Geo-spatial Data (GeoRich), pp. 1\u20136 (2015)","DOI":"10.1145\/2786006.2786007"},{"key":"876_CR6","unstructured":"Apache: Accumulo. URL https:\/\/accumulo.apache.org\/"},{"key":"876_CR7","doi-asserted-by":"publisher","unstructured":"Athanassoulis, M., Idreos, S.: Design tradeoffs of data access methods. In: Proceedings of the 2016 International Conference on Management of Data, SIGMOD \u201916, pp. 2195\u20132200. ACM, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2882903.2912569","DOI":"10.1145\/2882903.2912569"},{"key":"876_CR8","unstructured":"Athanassoulis, M., Kester, M.S., Maas, L.M., Stoica, R., Idreos, S., Ailamaki, A., Callaghan, M.D.: Designing access methods: the rum conjecture. In: International Conference on Extending Database Technology (2016). URL https:\/\/api.semanticscholar.org\/CorpusID:15354110"},{"key":"876_CR9","doi-asserted-by":"publisher","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The r*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201990, pp. 322\u2013331. ACM, New York, NY, USA (1990). https:\/\/doi.org\/10.1145\/93597.98741","DOI":"10.1145\/93597.98741"},{"issue":"7","key":"876_CR10","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"876_CR11","unstructured":"Cao, Z., Dong, S., Vemuri, S., Du, D.H.C.: Characterizing, modeling, and benchmarking rocksDB key-value workloads at facebook. In: Proceedings of the 18th USENIX Conference on File and Storage Technologies, FAST\u201920, pp. 209\u2013224. USENIX Association, USA (2020)"},{"key":"876_CR12","unstructured":"Cassandra. URL http:\/\/cassandra.apache.org\/"},{"key":"876_CR13","doi-asserted-by":"publisher","unstructured":"Chandramouli, B., Prasaad, G., Kossmann, D., Levandoski, J., Hunter, J., Barnett, M.: Faster: a concurrent key-value store with in-place updates. In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD \u201918, pp. 275\u2013290. ACM, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3183713.3196898","DOI":"10.1145\/3183713.3196898"},{"issue":"2","key":"876_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1365815.1365816","volume":"26","author":"F Chang","year":"2008","unstructured":"Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: a distributed storage system for structured data. ACM Trans. Comput. Syst. (TOCS) 26(2), 1\u201326 (2008)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"876_CR15","doi-asserted-by":"publisher","unstructured":"Chatterjee, S., Jagadeesan, M., Qin, W., Idreos, S.: Cosine: a cloud-cost optimized self-designing key-value storage engine. Proc. VLDB Endow. 15(1), 112\u2013126 (2021). https:\/\/doi.org\/10.14778\/3485450.3485461","DOI":"10.14778\/3485450.3485461"},{"issue":"2","key":"876_CR16","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.14778\/1454159.1454229","volume":"1","author":"S Chen","year":"2008","unstructured":"Chen, S., Jensen, C.S., Lin, D.: A benchmark for evaluating moving object indexes. Proc. VLDB Endow. (PVLDB) 1(2), 1574\u20131585 (2008)","journal-title":"Proc. VLDB Endow. (PVLDB)"},{"key":"876_CR17","doi-asserted-by":"publisher","unstructured":"Chen, Y., Lu, Y., Yang, F., Wang, Q., Wang, Y., Shu, J.: Flatstore: an efficient log-structured key-value storage engine for persistent memory. ASPLOS \u201920, pp. 1077\u20131091. ACM, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3373376.3378515","DOI":"10.1145\/3373376.3378515"},{"key":"876_CR18","doi-asserted-by":"crossref","unstructured":"Cho, E., Myers, S.A., Leskovec, J.: Friendship and mobility: user movement in location-based social networks. In: Proceedings of ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), pp. 1082\u20131090. ACM (2011)","DOI":"10.1145\/2020408.2020579"},{"key":"876_CR19","unstructured":"Dai, Y., Xu, Y., Ganesan, A., Alagappan, R., Kroth, B., Arpaci-Dusseau, A.C., Arpaci-Dusseau, R.H.: From Wisckey to bourbon: a learned index for log-structured merge trees. In: Proceedings of the 14th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201920. USENIX Association, USA (2020)"},{"issue":"4","key":"876_CR20","doi-asserted-by":"publisher","first-page":"3276980","DOI":"10.1145\/3276980","volume":"43","author":"N Dayan","year":"2018","unstructured":"Dayan, N., Athanassoulis, M., Idreos, S.: Optimal bloom filters and adaptive merging for lSM-trees. ACM Trans. Database Syst. 43(4), 3276980 (2018). https:\/\/doi.org\/10.1145\/3276980","journal-title":"ACM Trans. Database Syst."},{"key":"876_CR21","doi-asserted-by":"publisher","unstructured":"Dayan, N., Idreos, S.: Dostoevsky: better space-time trade-offs for lSM-tree based key-value stores via adaptive removal of superfluous merging. In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD \u201918, pp. 505\u2013520. ACM, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3183713.3196927","DOI":"10.1145\/3183713.3196927"},{"key":"876_CR22","doi-asserted-by":"publisher","unstructured":"Dayan, N., Idreos, S.: The log-structured merge-bush & the wacky continuum. In: Proceedings of the 2019 International Conference on Management of Data, SIGMOD \u201919, pp. 449\u2013466. ACM, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3299869.3319903","DOI":"10.1145\/3299869.3319903"},{"key":"876_CR23","doi-asserted-by":"publisher","unstructured":"Dayan, N., Twitto, M.: Chucky: a succinct cuckoo filter for lSM-tree. In: Proceedings of the 2021 International Conference on Management of Data, SIGMOD \u201921, pp. 365\u2013378. ACMy, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3448016.3457273","DOI":"10.1145\/3448016.3457273"},{"issue":"6","key":"876_CR24","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/1323293.1294281","volume":"41","author":"G DeCandia","year":"2007","unstructured":"DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: amazon\u2019s highly available key-value store. ACM SIGOPS Oper. Syst. Rev. 41(6), 205\u2013220 (2007)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"issue":"6","key":"876_CR25","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1007\/s00778-009-0142-5","volume":"18","author":"C D\u00fcntgen","year":"2009","unstructured":"D\u00fcntgen, C., Behr, T., G\u00fcting, R.H.: Berlinmod: a benchmark for moving object databases. VLDB J. 18(6), 1335 (2009)","journal-title":"VLDB J."},{"key":"876_CR26","unstructured":"Facebook: Memtable (2021). URL https:\/\/github.com\/facebook\/rocksdb\/wiki\/MemTable"},{"key":"876_CR27","unstructured":"ej-technologies GmbH: Java profiler - jprofiler (2024). URL https:\/\/www.ej-technologies.com\/products\/jprofiler\/overview.html"},{"key":"876_CR28","doi-asserted-by":"publisher","unstructured":"Golan-Gueta, G., Bortnikov, E., Hillel, E., Keidar, I.: Scaling concurrent log-structured data stores. In: Proceedings of the Tenth European Conference on Computer Systems, EuroSys \u201915. ACM, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2741948.2741973","DOI":"10.1145\/2741948.2741973"},{"key":"876_CR29","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD), pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"issue":"4","key":"876_CR30","doi-asserted-by":"publisher","first-page":"15040113","DOI":"10.3390\/a15040113","volume":"15","author":"J He","year":"2022","unstructured":"He, J., Chen, H.: An lSM-tree index for spatial data. Algorithms 15(4), 15040113 (2022). https:\/\/doi.org\/10.3390\/a15040113","journal-title":"Algorithms"},{"key":"876_CR31","unstructured":"HBase. URL http:\/\/hbase.apache.org\/"},{"issue":"1","key":"876_CR32","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. (TOPLAS) 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"876_CR33","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF01199431","volume":"38","author":"D Hilbert","year":"1891","unstructured":"Hilbert, D.: \u00dcber die stetige abbildung einer linie aufein fl\u00e4chenst\u00fcck. Math. Ann. 38, 459\u2013460 (1891)","journal-title":"Math. Ann."},{"key":"876_CR34","doi-asserted-by":"publisher","unstructured":"Huang, G., Cheng, X., Wang, J., Wang, Y., He, D., Zhang, T., Li, F., Wang, S., Cao, W., Li, Q.: X-engine: an optimized storage engine for large-scale e-commerce transaction processing. In: Proceedings of the 2019 International Conference on Management of Data, SIGMOD \u201919, pp. 651\u2013665. ACM, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3299869.3314041","DOI":"10.1145\/3299869.3314041"},{"key":"876_CR35","doi-asserted-by":"publisher","unstructured":"Huang, H., Ghandeharizadeh, S.: Nova-lSM: a distributed, component-based lSM-tree key-value store. In: Proceedings of the 2021 International Conference on Management of Data, SIGMOD \u201921, pp. 749\u2013763. ACM, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3448016.3457297","DOI":"10.1145\/3448016.3457297"},{"key":"876_CR36","doi-asserted-by":"publisher","unstructured":"Huynh, A., Chaudhari, H.A., Terzi, E., Athanassoulis, M.: Endure: a robust tuning paradigm for lSM trees under workload uncertainty. Proc. VLDB Endow. 15(8), 1605\u20131618 (2022). https:\/\/doi.org\/10.14778\/3529337.3529345","DOI":"10.14778\/3529337.3529345"},{"key":"876_CR37","doi-asserted-by":"publisher","unstructured":"Idreos, S., Callaghan, M.: Key-value storage engines. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201920, pp. 2667\u20132672. ACM, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3318464.3383133","DOI":"10.1145\/3318464.3383133"},{"key":"876_CR38","unstructured":"Idreos, S., Dayan, N., Qin, W., Akmanalp, M., Hilgard, S., Ross, A.S., Lennon, J., Jain, V., Gupta, H., Li, D., Zhu, Z.: Design continuums and the path toward self-designing key-value stores that know and learn. In: Conference on Innovative Data Systems Research (2019)"},{"key":"876_CR39","first-page":"64","volume":"41","author":"S Idreos","year":"2018","unstructured":"Idreos, S., Zoumpatianos, K., Athanassoulis, M., Dayan, N., Hentschel, B., Kester, M.S., Guo, D., Maas, L.M., Qin, W., Wasay, A., Sun, Y.: The periodic table of data structures. IEEE Data Eng. Bull. 41, 64\u201375 (2018)","journal-title":"IEEE Data Eng. Bull."},{"key":"876_CR40","doi-asserted-by":"publisher","unstructured":"Idreos, S., Zoumpatianos, K., Hentschel, B., Kester, M.S., Guo, D.: The data calculator: data structure design and cost synthesis from first principles and learned cost models. In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD \u201918, pp. 535\u2013550. ACM, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3183713.3199671","DOI":"10.1145\/3183713.3199671"},{"key":"876_CR41","unstructured":"Influxdata. in-memory indexing and the time-structured merge tree (tsm). (2024). URL https:\/\/docs.influxdata.com\/influxdb\/v1\/concepts\/storage_engine\/"},{"key":"876_CR42","unstructured":"Kamel, I., Faloutsos, C.: Hilbert r-tree: an improved r-tree using fractals. In: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB \u201994, pp. 500\u2013509. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1994)"},{"key":"876_CR43","unstructured":"Kannan, S., Bhat, N., Gavrilovska, A., Arpaci-Dusseau, A., Arpaci-Dusseau, R.: Redesigning lSMs for nonvolatile memory with NovelSM. In: Proceedings of the 2018 USENIX Conference on Usenix Annual Technical Conference, USENIX ATC \u201918, pp. 993\u20131005. USENIX Association, USA (2018)"},{"key":"876_CR44","doi-asserted-by":"crossref","unstructured":"Kim, Y.S., Kim, T., Carey, M.J., Li, C.: A comparative study of log-structured merge-tree-based spatial indexes for big data. In: 33rd International Conference on Data Engineering (ICDE), pp. 147\u2013150. IEEE (2017)","DOI":"10.1109\/ICDE.2017.61"},{"key":"876_CR45","doi-asserted-by":"crossref","unstructured":"Kondylakis, H., Dayan, N., Zoumpatianos, K., Palpanas, T.: Coconut palm: static and streaming data series exploration now in your palm. In: Proceedings of the 2019 International Conference on Management of Data (2019)","DOI":"10.1145\/3299869.3320233"},{"issue":"2","key":"876_CR46","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/253262.253272","volume":"26","author":"M Kornacker","year":"1997","unstructured":"Kornacker, M., Mohan, C., Hellerstein, J.M.: Concurrency and recovery in generalized search trees. ACM SIGMOD Record 26(2), 62\u201372 (1997)","journal-title":"ACM SIGMOD Record"},{"key":"876_CR47","unstructured":"Kwon, D., Lee, S., Lee, S.: Indexing the current positions of moving objects using the lazy update r-tree. In: 3rd International Conference on Mobile Data Management (MDM), pp. 113\u2013120. IEEE (2002)"},{"key":"876_CR48","doi-asserted-by":"crossref","unstructured":"Lee, M.L., Hsu, W., Jensen, C.S., Cui, B., Teo, K.L.: Supporting frequent updates in r-trees: a bottom-up approach. In: Proceedings of the International Conference on Very Large Data Basees (VLDB), pp. 608\u2013619. Elsevier (2003)","DOI":"10.1016\/B978-012722442-8\/50060-4"},{"key":"876_CR49","doi-asserted-by":"publisher","unstructured":"Lepers, B., Balmau, O., Gupta, K., Zwaenepoel, W.: Kvell: the design and implementation of a fast persistent key-value store. In: Proceedings of the 27th ACM Symposium on Operating Systems Principles, SOSP \u201919, pp. 447\u2013461. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3341301.3359628","DOI":"10.1145\/3341301.3359628"},{"key":"876_CR50","unstructured":"Lepers, B., Balmau, O., Gupta, K., Zwaenepoel, W.: Kvell+: snapshot isolation without snapshots. In: Proceedings of the 14th USENIX Conference on Operating Systems Design and Implementation, OSDI\u201920. USENIX Association, USA (2020)"},{"key":"876_CR51","unstructured":"LevelDB. URL https:\/\/github.com\/google\/leveldb\/"},{"key":"876_CR52","unstructured":"LinkedIn: Voldemort. URL https:\/\/www.project-voldemort.com\/voldemort\/"},{"issue":"1","key":"876_CR53","doi-asserted-by":"publisher","first-page":"3033273","DOI":"10.1145\/3033273","volume":"13","author":"L Lu","year":"2017","unstructured":"Lu, L., Pillai, T.S., Gopalakrishnan, H., Arpaci-Dusseau, A.C., Arpaci-Dusseau, R.H.: Wisckey: separating keys from values in ssd-conscious storage. ACM Trans. Storage 13(1), 3033273 (2017). https:\/\/doi.org\/10.1145\/3033273","journal-title":"ACM Trans. Storage"},{"key":"876_CR54","doi-asserted-by":"publisher","unstructured":"Luo, C.: Breaking down memory walls in lSM-based storage systems. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201920, pp. 2817\u20132819. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3318464.3384399","DOI":"10.1145\/3318464.3384399"},{"issue":"5","key":"876_CR55","doi-asserted-by":"publisher","first-page":"531","DOI":"10.14778\/3303753.3303759","volume":"12","author":"C Luo","year":"2019","unstructured":"Luo, C., Carey, M.J.: Efficient data ingestion and query processing for lSM-based storage systems. Proc. VLDB Endow. (PVLDB) 12(5), 531\u2013543 (2019)","journal-title":"Proc. VLDB Endow. (PVLDB)"},{"key":"876_CR56","doi-asserted-by":"publisher","unstructured":"Luo, C., Carey, M.J.: On performance stability in lSM-based storage systems. Proc. VLDB Endow. 13(4), 449\u2013462 (2019). https:\/\/doi.org\/10.14778\/3372716.3372719","DOI":"10.14778\/3372716.3372719"},{"issue":"3","key":"876_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3234941","volume":"4","author":"A Mahmood","year":"2018","unstructured":"Mahmood, A., Aly, A., Kuznetsova, T., Basalamah, S., Aref, W.: Disk-based indexing of recent trajectories. ACM Trans. Spatial Algorithms Syst. (TSAS) 4(3), 1\u201327 (2018)","journal-title":"ACM Trans. Spatial Algorithms Syst. (TSAS)"},{"key":"876_CR58","doi-asserted-by":"publisher","unstructured":"Mao, Q., Qader, M.A., Hristidis, V.: Comprehensive comparison of lSM architectures for spatial data. In: 2020 IEEE International Conference on Big Data (Big Data), pp. 455\u2013460 (2020). https:\/\/doi.org\/10.1109\/BigData50022.2020.9377919","DOI":"10.1109\/BigData50022.2020.9377919"},{"key":"876_CR59","volume-title":"ARIES\/KVL: A key-value locking method for concurrency control of multiaction transactions operating on B-tree indexes","author":"C Mohan","year":"1989","unstructured":"Mohan, C., et al.: ARIES\/KVL: A key-value locking method for concurrency control of multiaction transactions operating on B-tree indexes. IBM Thomas J, Watson Research Division (1989)"},{"issue":"4","key":"876_CR60","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"P O\u2019Neil","year":"1996","unstructured":"O\u2019Neil, P., Cheng, E., Gawlick, D., O\u2019Neil, E.: The log-structured merge-tree (lSM-tree). Acta Inf. 33(4), 351\u2013385 (1996)","journal-title":"Acta Inf."},{"key":"876_CR61","unstructured":"Oracle java 8 concurrenthashmap. URL https:\/\/docs.oracle.com\/javase\/8\/docs\/api\/java\/util\/concurrent\/ConcurrentHashMap.html"},{"key":"876_CR62","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1007\/s10766-016-0472-z","volume":"45","author":"F Pan","year":"2017","unstructured":"Pan, F., Yue, Y., Xiong, J.: dCompaction: delayed compaction for the lSM-tree. Int. J. Parallel Progr. 45, 1310\u20131325 (2017)","journal-title":"Int. J. Parallel Progr."},{"issue":"1","key":"876_CR63","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01199438","volume":"36","author":"G Peano","year":"1890","unstructured":"Peano, G.: Sur une courbe, qui remplit toute une aire plane. Math. Ann. 36(1), 157\u2013160 (1890)","journal-title":"Math. Ann."},{"key":"876_CR64","unstructured":"Portal, C.D.: Taxi Trips - 2019 (2019). URL https:\/\/data.cityofchicago.org\/Transportation\/Taxi-Trips-2019\/h4cq-z3dy"},{"key":"876_CR65","doi-asserted-by":"publisher","unstructured":"Qader, M.A., Cheng, S., Hristidis, V.: A comparative study of secondary indexing techniques in lsm-based nosql databases. In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD \u201918, pp. 551\u2013566. ACM, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3183713.3196900","DOI":"10.1145\/3183713.3196900"},{"key":"876_CR66","doi-asserted-by":"publisher","unstructured":"Raju, P., Kadekodi, R., Chidambaram, V., Abraham, I.: Pebblesdb: building key-value stores using fragmented log-structured merge trees. In: Proceedings of the 26th Symposium on Operating Systems Principles, SOSP \u201917, pp. 497\u2013514. ACM, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3132747.3132765","DOI":"10.1145\/3132747.3132765"},{"key":"876_CR67","unstructured":"RocksDB. URL https:\/\/rocksdb.org\/"},{"key":"876_CR68","doi-asserted-by":"publisher","unstructured":"Sarkar, S., Athanassoulis, M.: Dissecting, designing, and optimizing lSM-based data stores. pp. 2489\u20132497 (2022). https:\/\/doi.org\/10.1145\/3514221.3522563","DOI":"10.1145\/3514221.3522563"},{"key":"876_CR69","doi-asserted-by":"publisher","unstructured":"Sarkar, S., Chen, K., Zhu, Z., Athanassoulis, M.: Compactionary: a dictionary for lSM compactions. In: Proceedings of the 2022 International Conference on Management of Data, SIGMOD \u201922, pp. 2429\u20132432. ACM, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3514221.3520169","DOI":"10.1145\/3514221.3520169"},{"key":"876_CR70","doi-asserted-by":"publisher","unstructured":"Sarkar, S., Papon, T.I., Staratzis, D., Athanassoulis, M.: Lethe: A tunable delete-aware lSM engine. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201920, pp. 893\u2013908. ACM, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3318464.3389757","DOI":"10.1145\/3318464.3389757"},{"key":"876_CR71","doi-asserted-by":"publisher","unstructured":"Sarkar, S., Staratzis, D., Zhu, Z., Athanassoulis, M.: Constructing and analyzing the lSM compaction design space. Proc. VLDB Endow. 14(11), 2216\u20132229 (2021). https:\/\/doi.org\/10.14778\/3476249.3476274","DOI":"10.14778\/3476249.3476274"},{"key":"876_CR72","unstructured":"Scylladb. URL https:\/\/www.scylladb.com\/"},{"key":"876_CR73","doi-asserted-by":"publisher","unstructured":"Sears, R., Ramakrishnan, R.: bLSM: a general purpose log structured merge tree. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201912, pp. 217\u2013228. ACM, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2213836.2213862","DOI":"10.1145\/2213836.2213862"},{"key":"876_CR74","doi-asserted-by":"crossref","unstructured":"Shin, J., Wang, J., Aref, W.G.: The lSM rum-tree: a log structured merge r-tree for update-intensive spatial workloads. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 2285\u20132290. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00238"},{"issue":"3","key":"876_CR75","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s00778-008-0120-3","volume":"18","author":"YN Silva","year":"2009","unstructured":"Silva, Y.N., Xiong, X., Aref, W.G.: The rum-tree: supporting frequent updates in r-trees using memos. VLDB J. 18(3), 719\u2013738 (2009)","journal-title":"VLDB J."},{"issue":"11","key":"876_CR76","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1109\/TKDE.2008.225","volume":"21","author":"M Song","year":"2009","unstructured":"Song, M., Kitagawa, H.: Managing frequent updates in r-trees for update-intensive applications. IEEE Trans. Knowl. Data Eng. 21(11), 1573\u20131589 (2009). https:\/\/doi.org\/10.1109\/TKDE.2008.225","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"876_CR77","doi-asserted-by":"publisher","unstructured":"Thonangi, R., Yang, J.: On log-structured merge for solid-state drives. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 683\u2013694 (2017). https:\/\/doi.org\/10.1109\/ICDE.2017.121","DOI":"10.1109\/ICDE.2017.121"},{"key":"876_CR78","unstructured":"Vin\u00e7on, T., Hardock, S., Riegger, C., Oppermann, J., Koch, A., Petrov, I.: Noftl-kv: Tackling write-amplification on kv-stores with native storage management (2018)"},{"key":"876_CR79","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-319-91635-4_13","volume-title":"Advanced Computing Strategies for Engineering","author":"AV Vo","year":"2018","unstructured":"Vo, A.V., Konda, N., Chauhan, N., Aljumaily, H., Laefer, D.F.: Lessons learned with laser scanning point cloud management in hadoop hbase. In: Smith, I.F.C., Domer, B. (eds.) Advanced Computing Strategies for Engineering, pp. 231\u2013253. Springer International Publishing, Cham (2018)"},{"key":"876_CR80","doi-asserted-by":"publisher","unstructured":"Wang, P., Sun, G., Jiang, S., Ouyang, J., Lin, S., Zhang, C., Cong, J.: An efficient design and implementation of lSM-tree based key-value store on open-channel ssd. In: Proceedings of the Ninth European Conference on Computer Systems, EuroSys \u201914. ACM, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2592798.2592804","DOI":"10.1145\/2592798.2592804"},{"key":"876_CR81","unstructured":"Wu, X., Xu, Y., Shao, Z., Jiang, S.: LSM-trie: an lSM-tree-based ultra-large key-value store for small data. In: Proceedings of the 2015 USENIX Conference on Usenix Annual Technical Conference, USENIX ATC \u201915, p. 71-82. USENIX Association, USA (2015)"},{"key":"876_CR82","doi-asserted-by":"crossref","unstructured":"Xiong, X., Aref, W.G.: R-trees with update memos. In: 22nd International Conference on Data Engineering (ICDE), pp. 22\u201322 (2006)","DOI":"10.1109\/ICDE.2006.125"},{"key":"876_CR83","doi-asserted-by":"crossref","unstructured":"Xiong, X., Mokbel, M.F., Aref, W.G.: Lugrid: Update-tolerant grid-based indexing for moving objects. In: 7th International Conference on Mobile Data Management (MDM), pp. 13\u201313 (2006)","DOI":"10.1109\/MDM.2006.102"},{"key":"876_CR84","doi-asserted-by":"publisher","unstructured":"Yao, T., Wan, J., Huang, P., He, X., Wu, F., Xie, C.: Building efficient key-value stores via a lightweight compaction tree. ACM Trans. Storage 13(4), 1\u201328 (2017). https:\/\/doi.org\/10.1145\/3139922","DOI":"10.1145\/3139922"},{"key":"876_CR85","doi-asserted-by":"publisher","unstructured":"Zhang, W., Xu, Y., Li, Y., Li, D.: Improving write performance of lSMT-based key-value store. pp. 553\u2013560 (2016). https:\/\/doi.org\/10.1109\/ICPADS.2016.0079","DOI":"10.1109\/ICPADS.2016.0079"},{"key":"876_CR86","doi-asserted-by":"publisher","unstructured":"Zhang, W., Zhao, X., Jiang, S., Jiang, H.: Chameleondb: a key-value store for optane persistent memory. In: Proceedings of the 16th European Conference on Computer Systems, EuroSys \u201921, pp. 194\u2013209. ACM, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3447786.3456237","DOI":"10.1145\/3447786.3456237"},{"key":"876_CR87","doi-asserted-by":"publisher","unstructured":"Zhang, Z., Yue, Y., He, B., Xiong, J., Chen, M., Zhang, L., Sun, N.: Pipelined compaction for the lSM-tree. In: 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pp. 777\u2013786 (2014). https:\/\/doi.org\/10.1109\/IPDPS.2014.85","DOI":"10.1109\/IPDPS.2014.85"},{"key":"876_CR88","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Wang, S., Zhou, X., Zhang, Y.: Rum+-tree: a new multidimensional index supporting frequent updates. In: The International Conference on Web-Age Information Management (WAIM), pp. 235\u2013240 (2013)","DOI":"10.1007\/978-3-642-38562-9_24"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00876-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-024-00876-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00876-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T05:52:33Z","timestamp":1737957153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-024-00876-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,10]]},"references-count":88,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["876"],"URL":"https:\/\/doi.org\/10.1007\/s00778-024-00876-7","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,10]]},"assertion":[{"value":"17 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"7"}}