{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:18Z","timestamp":1750220358815,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"This work is supported by National Science Foundation under grants NSF ICER-1639759, ICER- 1661918.","award":["ICER-1639759, ICER-1661918"],"award-info":[{"award-number":["ICER-1639759, ICER-1661918"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3468791.3468820","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T01:03:56Z","timestamp":1628730236000},"page":"253-258","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["On Lowering Merge Costs of an LSM Tree"],"prefix":"10.1145","author":[{"given":"Dai Hai","family":"Ton That","sequence":"first","affiliation":[{"name":"University of Alabama in Huntsville"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammadsaleh","family":"Gharehdaghi","sequence":"additional","affiliation":[{"name":"DePaul University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Rasin","sequence":"additional","affiliation":[{"name":"DePaul University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanu","family":"Malik","sequence":"additional","affiliation":[{"name":"DePaul University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00176-Y"},{"volume-title":"https:\/\/github.com\/google\/leveldb. [Online","year":"2019","key":"e_1_3_2_1_2_1","unstructured":"Apache. [n.d.]. HBase. https:\/\/github.com\/google\/leveldb. [Online ; accessed 25- Mar- 2019 ]. Apache. [n.d.]. HBase. https:\/\/github.com\/google\/leveldb. [Online; accessed 25-Mar-2019]."},{"volume-title":"USENIX ATC 17","author":"Balmau Oana","key":"e_1_3_2_1_3_1","unstructured":"Oana Balmau and et. al.2017. TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores . In USENIX ATC 17 . USENIX Association , Santa Clara, CA . Oana Balmau and et. al.2017. TRIAD: Creating Synergies Between Memory, Disk and Log in Log Structured Key-Value Stores. In USENIX ATC 17. USENIX Association, Santa Clara, CA."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229873"},{"volume-title":"OSDI\u201906 (Seattle, WA)","author":"Chang Fay","key":"e_1_3_2_1_5_1","unstructured":"Fay Chang and et. al.2006. Bigtable: A Distributed Storage System for Structured Data . In OSDI\u201906 (Seattle, WA) . USENIX Association , Berkeley, CA, USA , 1\u00a0pages. Fay Chang and et. al.2006. Bigtable: A Distributed Storage System for Structured Data. In OSDI\u201906 (Seattle, WA). USENIX Association, Berkeley, CA, USA, 1\u00a0pages."},{"key":"e_1_3_2_1_6_1","volume-title":"Columnar Database: A Smart choice for data warehouses. https:\/\/www.columnardatabase.com\/. [Online","author":"Database Columnar","year":"2019","unstructured":"Columnar Database . 2019 . Columnar Database: A Smart choice for data warehouses. https:\/\/www.columnardatabase.com\/. [Online ; accessed 25-Mar-2019]. Columnar Database. 2019. Columnar Database: A Smart choice for data warehouses. https:\/\/www.columnardatabase.com\/. [Online; accessed 25-Mar-2019]."},{"volume-title":"Introduction to Algorithms","author":"Cormen H.","key":"e_1_3_2_1_7_1","unstructured":"Thomas\u00a0 H. Cormen , Charles\u00a0 E. Leiserson , Ronald\u00a0 L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms , Third Edition(3rd ed.). The MIT Press . Thomas\u00a0H. Cormen, Charles\u00a0E. Leiserson, Ronald\u00a0L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, Third Edition(3rd ed.). The MIT Press."},{"key":"e_1_3_2_1_8_1","volume-title":"https:\/\/sqlite.org\/src4\/doc\/trunk\/www\/index.wiki. [Online","author":"Hipp D. Richard","year":"2019","unstructured":"D. Richard Hipp . [n.d.]. SQLite4. https:\/\/sqlite.org\/src4\/doc\/trunk\/www\/index.wiki. [Online ; accessed 25- Mar- 2019 ]. D. Richard Hipp. [n.d.]. SQLite4. https:\/\/sqlite.org\/src4\/doc\/trunk\/www\/index.wiki. [Online; accessed 25-Mar-2019]."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064054"},{"key":"e_1_3_2_1_10_1","volume-title":"Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging. In SIGMOD \u201918 (Houston, TX, USA)","author":"Dayan Niv","year":"2018","unstructured":"Niv Dayan and Stratos Idreos . 2018 . Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging. In SIGMOD \u201918 (Houston, TX, USA) . ACM , New York, NY, USA , 16\u00a0pages. Niv Dayan and Stratos Idreos. 2018. Dostoevsky: Better Space-Time Trade-Offs for LSM-Tree Based Key-Value Stores via Adaptive Removal of Superfluous Merging. In SIGMOD \u201918 (Houston, TX, USA). ACM, New York, NY, USA, 16\u00a0pages."},{"key":"e_1_3_2_1_11_1","volume-title":"https:\/\/github.com\/google\/leveldb. [Online","author":"DB.","year":"2019","unstructured":"Google. [n.d.]. Level DB. https:\/\/github.com\/google\/leveldb. [Online ; accessed 25- Mar- 2019 ]. Google. [n.d.]. LevelDB. https:\/\/github.com\/google\/leveldb. [Online; accessed 25-Mar-2019]."},{"key":"e_1_3_2_1_12_1","volume-title":"Indexing implementation. https:\/\/github.com\/TonHai1111\/DB_Implementation\/tree\/hai-data-distribution\/Simulation\/Distribution\/tools. [Online","author":"DePaul\u00a0Database Group","year":"2021","unstructured":"DePaul\u00a0Database Group . 2021. Indexing implementation. https:\/\/github.com\/TonHai1111\/DB_Implementation\/tree\/hai-data-distribution\/Simulation\/Distribution\/tools. [Online ; accessed 8- Jun- 2021 ]. DePaul\u00a0Database Group. 2021. Indexing implementation. https:\/\/github.com\/TonHai1111\/DB_Implementation\/tree\/hai-data-distribution\/Simulation\/Distribution\/tools. [Online; accessed 8-Jun-2021]."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367518"},{"key":"e_1_3_2_1_15_1","first-page":"4","article-title":"The Log-structured Merge-tree (LSM-tree)","volume":"33","author":"O\u2019Neil Patrick","year":"1996","unstructured":"Patrick O\u2019Neil , Edward Cheng , Dieter Gawlick , and Elizabeth O\u2019Neil . 1996 . The Log-structured Merge-tree (LSM-tree) . Acta Inf. 33 , 4 (June 1996), 351\u2013385. https:\/\/doi.org\/10.1007\/s002360050048 Patrick O\u2019Neil, Edward Cheng, Dieter Gawlick, and Elizabeth O\u2019Neil. 1996. The Log-structured Merge-tree (LSM-tree). Acta Inf. 33, 4 (June 1996), 351\u2013385. https:\/\/doi.org\/10.1007\/s002360050048","journal-title":"Acta Inf."},{"key":"e_1_3_2_1_16_1","volume-title":"https:\/\/github.com\/mysql\/mysql-server. [Online","author":"SQL.","year":"2019","unstructured":"Oracle. [n.d.]. My SQL. https:\/\/github.com\/mysql\/mysql-server. [Online ; accessed 25- Mar- 2019 ]. Oracle. [n.d.]. MySQL. https:\/\/github.com\/mysql\/mysql-server. [Online; accessed 25-Mar-2019]."},{"key":"e_1_3_2_1_17_1","volume-title":"Unified New York City Taxi and Uber data. https:\/\/github.com\/toddwschneider\/nyc-taxi-data. [Online","author":"Schneider W.","year":"2017","unstructured":"Todd\u00a0 W. Schneider . 2016. Unified New York City Taxi and Uber data. https:\/\/github.com\/toddwschneider\/nyc-taxi-data. [Online ; accessed 18- Aug- 2017 ]. Todd\u00a0W. Schneider. 2016. Unified New York City Taxi and Uber data. https:\/\/github.com\/toddwschneider\/nyc-taxi-data. [Online; accessed 18-Aug-2017]."},{"volume-title":"SIGMOD \u201912 (Scottsdale, Arizona, USA)","author":"Sears Russell","key":"e_1_3_2_1_18_1","unstructured":"Russell Sears and Raghu Ramakrishnan . 2012. bLSM: A General Purpose Log Structured Merge Tree . In SIGMOD \u201912 (Scottsdale, Arizona, USA) . ACM , New York, NY, USA , 12\u00a0pages. Russell Sears and Raghu Ramakrishnan. 2012. bLSM: A General Purpose Log Structured Merge Tree. In SIGMOD \u201912 (Scottsdale, Arizona, USA). ACM, New York, NY, USA, 12\u00a0pages."},{"key":"e_1_3_2_1_19_1","unstructured":"Mike Stonebraker and et. al.2005. C-store: A Column-oriented DBMS. In VLDB\u201905 (Trondheim Norway). 12\u00a0pages.  Mike Stonebraker and et. al.2005. C-store: A Column-oriented DBMS. In VLDB\u201905 (Trondheim Norway). 12\u00a0pages."},{"key":"e_1_3_2_1_20_1","unstructured":"Dai\u00a0Hai Ton\u00a0That James Wagner Alexander Rasin and Tanu Malik. 2018. PLI+: Efficient Clustering of Cloud Databases. Distributed and Parallel Databases(2018). in the third round of DAPD.  Dai\u00a0Hai Ton\u00a0That James Wagner Alexander Rasin and Tanu Malik. 2018. PLI+: Efficient Clustering of Cloud Databases. Distributed and Parallel Databases(2018). in the third round of DAPD."},{"key":"e_1_3_2_1_21_1","volume-title":"Dai Hai\u00a0Ton That, and Tanu Malik","author":"Wagner James","year":"2017","unstructured":"James Wagner , Alexander Rasin , Dai Hai\u00a0Ton That, and Tanu Malik . 2017 . PLI : Augmenting Live Databases with Custom Clustered Indexes. In SSDBM\u201917 (Chicago, IL, USA). ACM, New York, NY, USA, Article 36, 6\u00a0pages. https:\/\/doi.org\/10.1145\/3085504.3085582 James Wagner, Alexander Rasin, Dai Hai\u00a0Ton That, and Tanu Malik. 2017. PLI: Augmenting Live Databases with Custom Clustered Indexes. In SSDBM\u201917 (Chicago, IL, USA). ACM, New York, NY, USA, Article 36, 6\u00a0pages. https:\/\/doi.org\/10.1145\/3085504.3085582"},{"key":"e_1_3_2_1_22_1","volume-title":"https:\/\/en.wikipedia.org\/wiki\/Business_intelligence. [Online","author":"Intelligence Business","year":"2019","unstructured":"Wikipedia. 2019. Business Intelligence . https:\/\/en.wikipedia.org\/wiki\/Business_intelligence. [Online ; accessed 25- June - 2019 ]. Wikipedia. 2019. Business Intelligence. https:\/\/en.wikipedia.org\/wiki\/Business_intelligence. [Online; accessed 25-June-2019]."}],"event":{"name":"SSDBM 2021: 33rd International Conference on Scientific and Statistical Database Management","acronym":"SSDBM 2021","location":"Tampa FL USA"},"container-title":["33rd International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3468791.3468820","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3468791.3468820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:21Z","timestamp":1750191441000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3468791.3468820"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":22,"alternative-id":["10.1145\/3468791.3468820","10.1145\/3468791"],"URL":"https:\/\/doi.org\/10.1145\/3468791.3468820","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}