{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T05:11:21Z","timestamp":1785042681678,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":74,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"US Department of Energy","award":["DE-SC0020200"],"award-info":[{"award-number":["DE-SC0020200"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3389731","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"2071-2086","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":83,"title":["Rosetta: A Robust Space-Time Optimized Range Filter for Key-Value Stores"],"prefix":"10.1145","author":[{"given":"Siqiang","family":"Luo","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Subarna","family":"Chatterjee","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafael","family":"Ketsetsidis","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niv","family":"Dayan","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wilson","family":"Qin","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stratos","family":"Idreos","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"3","volume":"5","author":"Abadi D. J.","year":"2013","unstructured":"Abadi , D. J. , Boncz , P. A. , Harizopoulos , S. , Idreos , S. , and Madden , S. The Design and Implementation of Modern Column-Oriented Database Systems. Foundations and Trends in Databases 5 , 3 ( 2013 ), 197--280. Abadi, D. J., Boncz, P. A., Harizopoulos, S., Idreos, S., and Madden, S. The Design and Implementation of Modern Column-Oriented Database Systems. Foundations and Trends in Databases 5, 3 (2013), 197--280.","journal-title":"The Design and Implementation of Modern Column-Oriented Database Systems. Foundations and Trends in Databases"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733096"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786006.2786007"},{"key":"e_1_3_2_2_4_1","unstructured":"Apache. Accumulo. https:\/\/accumulo.apache.org\/.  Apache. Accumulo. https:\/\/accumulo.apache.org\/."},{"key":"e_1_3_2_2_5_1","unstructured":"Apache. HBase. http:\/\/hbase.apache.org\/.  Apache. HBase. http:\/\/hbase.apache.org\/."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465296"},{"key":"e_1_3_2_2_7_1","first-page":"461","volume-title":"Designing Access Methods: The RUM Conjecture. In Proceedings of the International Conference on Extending Database Technology (EDBT)","author":"Athanassoulis M.","year":"2016","unstructured":"Athanassoulis , M. , Kester , M. S. , Maas , L. M. , Stoica , R. , Idreos , S. , Ailamaki , A. , and Callaghan , M . Designing Access Methods: The RUM Conjecture. In Proceedings of the International Conference on Extending Database Technology (EDBT) ( 2016 ), pp. 461 -- 466 . Athanassoulis, M., Kester, M. S., Maas, L. M., Stoica, R., Idreos, S., Ailamaki, A., and Callaghan, M. Designing Access Methods: The RUM Conjecture. In Proceedings of the International Conference on Extending Database Technology (EDBT) (2016), pp. 461--466."},{"key":"e_1_3_2_2_8_1","first-page":"363","volume-title":"Disk and Log in Log Structured Key-Value Stores. In Proceedings of the USENIX Annual Technical Conference (ATC)","author":"Balmau O.","year":"2017","unstructured":"Balmau , O. , Didona , D. , Guerraoui , R. , Zwaenepoel , W. , Yuan , H. , Arora , A. , Gupta , K. , and Konka , P . TRIAD: Creating Synergies Between Memory , Disk and Log in Log Structured Key-Value Stores. In Proceedings of the USENIX Annual Technical Conference (ATC) ( 2017 ), pp. 363 -- 375 . Balmau, O., Didona, D., Guerraoui, R., Zwaenepoel, W., Yuan, H., Arora, A., Gupta, K., and Konka, P. TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. In Proceedings of the USENIX Annual Technical Conference (ATC) (2017), pp. 363--375."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229873"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735471.2735477"},{"key":"e_1_3_2_2_13_1","unstructured":"Callaghan M. CPU overheads for RocksDB queries. http:\/\/smalldatum.blogspot.com\/2018\/07\/query-cpu-overheads-in-rocksdb.html July 2018.  Callaghan M. CPU overheads for RocksDB queries. http:\/\/smalldatum.blogspot.com\/2018\/07\/query-cpu-overheads-in-rocksdb.html July 2018."},{"key":"e_1_3_2_2_14_1","volume-title":"Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR)","author":"Cao Z.","year":"2013","unstructured":"Cao , Z. , Chen , S. , Li , F. , Wang , M. , and Wang , X. S . LogKV: Exploiting Key-Value Stores for Log Processing . In Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR) ( 2013 ). Cao, Z., Chen, S., Li, F., Wang, M., and Wang, X. S. LogKV: Exploiting Key-Value Stores for Log Processing. In Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR) (2013)."},{"key":"e_1_3_2_2_15_1","first-page":"205","volume-title":"7th USENIX Symposium on Operating Systems Design and Implementation (OSDI)","author":"Chang F.","year":"2006","unstructured":"Chang , F. , Dean , J. , Ghemawat , S. , Hsieh , W. C. , Wallach , D. A. , Burrows , M. , Chandra , T. , Fikes , A. , and Gruber , R. E . Bigtable: A distributed storage system for structured data . In 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI) ( 2006 ), pp. 205 -- 218 . Chang, F., Dean, J., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., and Gruber, R. E. Bigtable: A distributed storage system for structured data. In 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI) (2006), pp. 205--218."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2904441"},{"key":"e_1_3_2_2_17_1","unstructured":"CockroachLabs. CockroachDB. https:\/\/github.com\/cockroachdb\/cockroach.  CockroachLabs. CockroachDB. https:\/\/github.com\/cockroachdb\/cockroach."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_2_19_1","volume-title":"Foundations and Trends in Databases","author":"Cormode G.","year":"2011","unstructured":"Cormode , G. Sketch techniques for approximate query processing . In Foundations and Trends in Databases ( 2011 ). Cormode, G. Sketch techniques for approximate query processing. In Foundations and Trends in Databases (2011)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000004"},{"key":"e_1_3_2_2_21_1","volume-title":"Answering Range Queries Under Local Differential Privacy. In arXiv:1812.10942","author":"Cormode G.","year":"2018","unstructured":"Cormode , G. , Kulkarni , T. , and Srivastava , D . Answering Range Queries Under Local Differential Privacy. In arXiv:1812.10942 ( 2018 ). Cormode, G., Kulkarni, T., and Srivastava, D. Answering Range Queries Under Local Differential Privacy. In arXiv:1812.10942 (2018)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773182"},{"key":"e_1_3_2_2_23_1","first-page":"29","volume-title":"An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. In LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5--8, 2004","volume":"2976","author":"Cormode G.","year":"2004","unstructured":"Cormode , G. , and Muthukrishnan , S . An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. In LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5--8, 2004 , Proceedings ( 2004 ), vol. 2976 , pp. 29 -- 38 . Cormode, G., and Muthukrishnan, S. An Improved Data Stream Summary: The Count-Min Sketch and Its Applications. In LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5--8, 2004, Proceedings (2004), vol. 2976, pp. 29--38."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_3_2_2_25_1","volume-title":"Optimal Bloom Filters and Adaptive Merging for LSM-Trees. ACM Transactions on Database Systems (TODS) 43, 4","author":"Dayan N.","year":"2018","unstructured":"Dayan , N. , Athanassoulis , M. , and Idreos , S . Optimal Bloom Filters and Adaptive Merging for LSM-Trees. ACM Transactions on Database Systems (TODS) 43, 4 ( 2018 ), 16:1--16:48. Dayan, N., Athanassoulis, M., and Idreos, S. Optimal Bloom Filters and Adaptive Merging for LSM-Trees. ACM Transactions on Database Systems (TODS) 43, 4 (2018), 16:1--16:48."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915219"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196927"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319903"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8_10"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294281"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882911"},{"key":"e_1_3_2_2_32_1","unstructured":"Dgraph. Badger Key-value DB in Go. https:\/\/github.com\/dgraph-io\/badger.  Dgraph. Badger Key-value DB in Go. https:\/\/github.com\/dgraph-io\/badger."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863979"},{"key":"e_1_3_2_2_34_1","volume-title":"Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR)","author":"Dong S.","year":"2017","unstructured":"Dong , S. , Callaghan , M. , Galanis , L. , Borthakur , D. , Savor , T. , and Strum , M . Optimizing Space Amplification in RocksDB . In Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR) ( 2017 ). Dong, S., Callaghan, M., Galanis, L., Borthakur, D., Savor, T., and Strum, M. Optimizing Space Amplification in RocksDB. In Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR) (2017)."},{"key":"e_1_3_2_2_35_1","unstructured":"Facebook. MyRocks. http:\/\/myrocks.io\/.  Facebook. MyRocks. http:\/\/myrocks.io\/."},{"key":"e_1_3_2_2_36_1","unstructured":"Facebook. RocksDB. https:\/\/github.com\/facebook\/rocksdb.  Facebook. RocksDB. https:\/\/github.com\/facebook\/rocksdb."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_2_38_1","volume-title":"Datenbanksysteme fur Business, Technologie und Web (BTW'17)","author":"Gembalczyk D.","year":"2017","unstructured":"Gembalczyk , D. , Schuhknecht , F. M. , and Dittrich , J . An Experimental Analysis of Different Key-Value Stores and Relational Databases . In Datenbanksysteme fur Business, Technologie und Web (BTW'17) ( 2017 ). Gembalczyk, D., Schuhknecht, F. M., and Dittrich, J. An Experimental Analysis of Different Key-Value Stores and Relational Databases. In Datenbanksysteme fur Business, Technologie und Web (BTW'17) (2017)."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509966"},{"key":"e_1_3_2_2_40_1","volume-title":"Proceedings of International Conference on Very Large Data Bases","author":"Gilbert A.","year":"2003","unstructured":"Gilbert , A. , Kotidis , Y. , Muthukrishnan , S. , and Strauss , M . Surfing wavelets on streams: One-pass summaries for approximate aggregate queries . In Proceedings of International Conference on Very Large Data Bases ( 2003 ). Gilbert, A., Kotidis, Y., Muthukrishnan, S., and Strauss, M. Surfing wavelets on streams: One-pass summaries for approximate aggregate queries. In Proceedings of International Conference on Very Large Data Bases (2003)."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50047-0"},{"key":"e_1_3_2_2_42_1","first-page":"1","volume-title":"Scaling Concurrent Log-Structured Data Stores. In Proceedings of the ACM European Conference on Computer Systems (EuroSys)","author":"Golan-Gueta G.","year":"2015","unstructured":"Golan-Gueta , G. , Bortnikov , E. , Hillel , E. , and Keidar , I . Scaling Concurrent Log-Structured Data Stores. In Proceedings of the ACM European Conference on Computer Systems (EuroSys) ( 2015 ), pp. 32: 1 -- 32 :14. Golan-Gueta, G., Bortnikov, E., Hillel, E., and Keidar, I. Scaling Concurrent Log-Structured Data Stores. In Proceedings of the ACM European Conference on Computer Systems (EuroSys) (2015), pp. 32:1--32:14."},{"key":"e_1_3_2_2_43_1","unstructured":"Google. LevelDB. https:\/\/github.com\/google\/leveldb\/.  Google. LevelDB. https:\/\/github.com\/google\/leveldb\/."},{"key":"e_1_3_2_2_44_1","first-page":"769","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms","author":"Goswami M.","year":"2014","unstructured":"Goswami , M. , Gr\u00f8nlund , A. , Larsen , K. G. , and Pagh , R . Approximate range emptiness in constant time and optimal space . In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms ( 2014 ), pp. 769 -- 775 . Goswami, M., Gr\u00f8nlund, A., Larsen, K. G., and Pagh, R. Approximate range emptiness in constant time and optimal space. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms (2014), pp. 769--775."},{"key":"e_1_3_2_2_45_1","volume-title":"Biennial Conference on Innovative Data Systems Research (CIDR)","author":"Idreos S.","year":"2019","unstructured":"Idreos , S. , Dayan , N. , Qin , W. , Akmanalp , M. , Hilgard , S. , Ross , A. , Lennon , J. , Jain , V. , Gupta , H. , Li , D. , and Zhu , Z . Design continuums and the path toward self-designing key-value stores that know and learn . In Biennial Conference on Innovative Data Systems Research (CIDR) ( 2019 ). Idreos, S., Dayan, N., Qin, W., Akmanalp, M., Hilgard, S., Ross, A., Lennon, J., Jain, V., Gupta, H., Li, D., and Zhu, Z. Design continuums and the path toward self-designing key-value stores that know and learn. In Biennial Conference on Innovative Data Systems Research (CIDR) (2019)."},{"key":"e_1_3_2_2_46_1","first-page":"16","volume-title":"Incremental Organization for Data Recording and Warehousing. In Proceedings of the International Conference on Very Large Data Bases (VLDB)","author":"Jagadish H. V.","year":"1997","unstructured":"Jagadish , H. V. , Narayan , P. P. S. , Seshadri , S. , Sudarshan , S. , and Kanneganti , R . Incremental Organization for Data Recording and Warehousing. In Proceedings of the International Conference on Very Large Data Bases (VLDB) ( 1997 ), pp. 16 -- 25 . Jagadish, H. V., Narayan, P. P. S., Seshadri, S., Sudarshan, S., and Kanneganti, R. Incremental Organization for Data Recording and Warehousing. In Proceedings of the International Conference on Very Large Data Bases (VLDB) (1997), pp. 16--25."},{"key":"e_1_3_2_2_47_1","first-page":"301","volume-title":"BetrFS: A Right-optimized Write-optimized File System. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST)","author":"Jannen W.","year":"2015","unstructured":"Jannen , W. , Yuan , J. , Zhan , Y. , Akshintala , A. , Esmet , J. , Jiao , Y. , Mittal , A. , Pandey , P. , Reddy , P. , Walsh , L. , Bender , M. A. , Farach-Colton , M. , Johnson , R. , Kuszmaul , B. C. , and Porter , D. E . BetrFS: A Right-optimized Write-optimized File System. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST) ( 2015 ), pp. 301 -- 315 . Jannen, W., Yuan, J., Zhan, Y., Akshintala, A., Esmet, J., Jiao, Y., Mittal, A., Pandey, P., Reddy, P., Walsh, L., Bender, M. A., Farach-Colton, M., Johnson, R., Kuszmaul, B. C., and Porter, D. E. BetrFS: A Right-optimized Write-optimized File System. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST) (2015), pp. 301--315."},{"key":"e_1_3_2_2_48_1","first-page":"4","volume":"16","author":"Jermaine C.","year":"2007","unstructured":"Jermaine , C. , Omiecinski , E. , and Yee , W. G. The Partitioned Exponential File for Database Storage Management. The VLDB Journal 16 , 4 ( 2007 ), 417--437. Jermaine, C., Omiecinski, E., and Yee, W. G. The Partitioned Exponential File for Database Storage Management. The VLDB Journal 16, 4 (2007), 417--437.","journal-title":"The Partitioned Exponential File for Database Storage Management. The VLDB Journal"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656234"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320233"},{"key":"e_1_3_2_2_51_1","author":"Kondylakis H.","year":"2019","unstructured":"Kondylakis , H. , Dayan , N. , Zoumpatianos , K. , and Palpanas , T. Coconut : sortable summarizations for scalable indexes over static and streaming data series. The VLDB Journal (09 2019 ). Kondylakis, H., Dayan, N., Zoumpatianos, K., and Palpanas, T. Coconut: sortable summarizations for scalable indexes over static and streaming data series. The VLDB Journal (09 2019).","journal-title":"The VLDB Journal (09"},{"key":"e_1_3_2_2_52_1","volume-title":"Graphchi-db: Simple design for a scalable graph database system--on just a pc. arXiv preprint arXiv:1403.0701","author":"Kyrola A.","year":"2014","unstructured":"Kyrola , A. , and Guestrin , C . Graphchi-db: Simple design for a scalable graph database system--on just a pc. arXiv preprint arXiv:1403.0701 ( 2014 ). Kyrola, A., and Guestrin, C. Graphchi-db: Simple design for a scalable graph database system--on just a pc. arXiv preprint arXiv:1403.0701 (2014)."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_2_54_1","first-page":"1","volume":"3","author":"Li Y.","year":"2010","unstructured":"Li , Y. , He , B. , Yang , J. , Luo , Q. , Yi , K. , and Yang , R. J. Tree Indexing on Solid State Drives. Proceedings of the VLDB Endowment 3 , 1 -- 2 ( 2010 ), 1195--1206. Li, Y., He, B., Yang, J., Luo, Q., Yi, K., and Yang, R. J. Tree Indexing on Solid State Drives. Proceedings of the VLDB Endowment 3, 1--2 (2010), 1195--1206.","journal-title":"J. Tree Indexing on Solid State Drives. Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_2_55_1","unstructured":"LinkedIn. Voldemort. http:\/\/www.project-voldemort.com.  LinkedIn. Voldemort. http:\/\/www.project-voldemort.com."},{"key":"e_1_3_2_2_56_1","first-page":"133","volume-title":"Proceedings of the USENIX Conference on File and Storage Technologies (FAST)","author":"Lu L.","year":"2016","unstructured":"Lu , L. , Pillai , T. S. , Arpaci-Dusseau , A. C. , and Arpaci-Dusseau , R. H . WiscKey: Separating Keys from Values in SSD-conscious Storage . In Proceedings of the USENIX Conference on File and Storage Technologies (FAST) ( 2016 ), pp. 133 -- 148 . Lu, L., Pillai, T. S., Arpaci-Dusseau, A. C., and Arpaci-Dusseau, R. H. WiscKey: Separating Keys from Values in SSD-conscious Storage. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST) (2016), pp. 133--148."},{"key":"e_1_3_2_2_57_1","volume-title":"LSM-based Storage Techniques: A Survey. arXiv:1812.07527v3","author":"Luo C.","year":"2019","unstructured":"Luo , C. , and Carey , M. J . LSM-based Storage Techniques: A Survey. arXiv:1812.07527v3 ( 2019 ). Luo, C., and Carey, M. J. LSM-based Storage Techniques: A Survey. arXiv:1812.07527v3 (2019)."},{"key":"e_1_3_2_2_58_1","first-page":"4","volume":"33","author":"O'Neil P. E.","year":"1996","unstructured":"O'Neil , P. E. , Cheng , E. , Gawlick , D. , and O'Neil , E. J. The log-structured merge-tree (LSM-tree). Acta Informatica 33 , 4 ( 1996 ), 351--385. O'Neil, P. E., Cheng, E., Gawlick, D., and O'Neil, E. J. The log-structured merge-tree (LSM-tree). Acta Informatica 33, 4 (1996), 351--385.","journal-title":"Acta Informatica"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183737"},{"key":"e_1_3_2_2_60_1","volume-title":"Performance Evaluation of Range Queries in Key Value Stores. J Grid Computing","author":"Pirza P.","year":"2012","unstructured":"Pirza , P. , Tatemura , J. , Po , O. , and Hacigumus , H . Performance Evaluation of Range Queries in Key Value Stores. J Grid Computing ( 2012 ). Pirza, P., Tatemura, J., Po, O., and Hacigumus, H. Performance Evaluation of Range Queries in Key Value Stores. J Grid Computing (2012)."},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_3_2_2_62_1","first-page":"13","volume":"10","author":"Ren K.","year":"2017","unstructured":"Ren , K. , Zheng , Q. , Arulraj , J. , and Gibson , G. SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data. Proceedings of the VLDB Endowment 10 , 13 ( 2017 ), 2037--2048. Ren, K., Zheng, Q., Arulraj, J., and Gibson, G. SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data. Proceedings of the VLDB Endowment 10, 13 (2017), 2037--2048.","journal-title":"SlimDB: A Space-Efficient Key-Value Storage Engine For Semi-Sorted Data. Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_2_63_1","unstructured":"Sears R. Callaghan M. and Brewer E. Rose: Compressed log-structured replication. 526--537.  Sears R. Callaghan M. and Brewer E. Rose: Compressed log-structured replication. 526--537."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_3_2_2_65_1","first-page":"17","volume-title":"Building Workload-Independent Storage with VT-trees. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST)","author":"Shetty P.","year":"2013","unstructured":"Shetty , P. , Spillane , R. P. , Malpani , R. , Andrews , B. , Seyster , J. , and Zadok , E . Building Workload-Independent Storage with VT-trees. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST) ( 2013 ), pp. 17 -- 30 . Shetty, P., Spillane, R. P., Malpani, R., Andrews, B., Seyster, J., and Zadok, E. Building Workload-Independent Storage with VT-trees. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST) (2013), pp. 17--30."},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139871495"},{"key":"e_1_3_2_2_67_1","first-page":"683","volume-title":"On Log-Structured Merge for Solid-State Drives. In Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Thonangi R.","year":"2017","unstructured":"Thonangi , R. , and Yang , J . On Log-Structured Merge for Solid-State Drives. In Proceedings of the IEEE International Conference on Data Engineering (ICDE) ( 2017 ), pp. 683 -- 694 . Thonangi, R., and Yang, J. On Log-Structured Merge for Solid-State Drives. In Proceedings of the IEEE International Conference on Data Engineering (ICDE) (2017), pp. 683--694."},{"key":"e_1_3_2_2_68_1","volume-title":"Computational geometry algorithms and applications","author":"Van Kreveld M.","year":"2000","unstructured":"Van Kreveld , M. , Schwarzkopf , O. , de Berg , M. , and Overmars , M . Computational geometry algorithms and applications . Springer , 2000 . Van Kreveld, M., Schwarzkopf, O., de Berg, M., and Overmars, M. Computational geometry algorithms and applications. Springer, 2000."},{"key":"e_1_3_2_2_69_1","unstructured":"Vincon T. Hardock S. Riegger C. Oppermann J. Koch A. and Petrov I. Noftl-kv: Tackling write-amplification on kv-stores with native storage management.  Vincon T. Hardock S. Riegger C. Oppermann J. Koch A. and Petrov I. Noftl-kv: Tackling write-amplification on kv-stores with native storage management."},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749443"},{"key":"e_1_3_2_2_71_1","unstructured":"WiredTiger. Source Code. https:\/\/github.com\/wiredtiger\/wiredtiger.  WiredTiger. Source Code. https:\/\/github.com\/wiredtiger\/wiredtiger."},{"key":"e_1_3_2_2_72_1","first-page":"71","volume-title":"LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items. In Proceedings of the USENIX Annual Technical Conference (ATC)","author":"Wu X.","year":"2015","unstructured":"Wu , X. , Xu , Y. , Shao , Z. , and Jiang , S . LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items. In Proceedings of the USENIX Annual Technical Conference (ATC) ( 2015 ), pp. 71 -- 82 . Wu, X., Xu, Y., Shao, Z., and Jiang, S. LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data Items. In Proceedings of the USENIX Annual Technical Conference (ATC) (2015), pp. 71--82."},{"key":"e_1_3_2_2_73_1","volume-title":"bLSM: Read-and latency-optimized log structured merge tree. https:\/\/github.com\/sears\/bLSM","author":"Yahoo","year":"2016","unstructured":"Yahoo . bLSM: Read-and latency-optimized log structured merge tree. https:\/\/github.com\/sears\/bLSM ( 2016 ). Yahoo. bLSM: Read-and latency-optimized log structured merge tree. https:\/\/github.com\/sears\/bLSM (2016)."},{"key":"e_1_3_2_2_74_1","volume-title":"Proceedings of the USENIX Conference on Hot Topics in Storage and File Systems (HotStorage)","author":"Zhang Y.","year":"2018","unstructured":"Zhang , Y. , Li , Y. , Guo , F. , Li , C. , and Xu , Y . ElasticBF: Fine-grained and Elastic Bloom Filter Towards Efficient Read for LSM-tree-based KV Stores . In Proceedings of the USENIX Conference on Hot Topics in Storage and File Systems (HotStorage) ( 2018 ). Zhang, Y., Li, Y., Guo, F., Li, C., and Xu, Y. ElasticBF: Fine-grained and Elastic Bloom Filter Towards Efficient Read for LSM-tree-based KV Stores. In Proceedings of the USENIX Conference on Hot Topics in Storage and File Systems (HotStorage) (2018)."}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389731","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3389731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:44Z","timestamp":1750199924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":74,"alternative-id":["10.1145\/3318464.3389731","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3389731","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}