{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T13:40:07Z","timestamp":1750858807047,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,18]]},"DOI":"10.1145\/3703323.3703707","type":"proceedings-article","created":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T12:03:28Z","timestamp":1750853008000},"page":"332-334","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["On Designing a Compaction Strategy for Enhanced LevelDB Read Performance"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-9614-8935","authenticated-orcid":false,"given":"Umesh","family":"Bhatt","sequence":"first","affiliation":[{"name":"Data Science and Applications, Indian Institute of Technology, Madras, Chennai, Tamil Nadu, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3014-9792","authenticated-orcid":false,"given":"Sarvesh","family":"Pandey","sequence":"additional","affiliation":[{"name":"Computer Science - MMV, Banaras Hindu University, Varanasi, Uttar Pradesh, India"}]}],"member":"320","published-online":{"date-parts":[[2025,6,25]]},"reference":[{"key":"e_1_3_3_2_2_2","unstructured":"The\u00a0Gonum Authors. 2024. Gonum Optimizer. Retrieved October 31 2024 from https:\/\/github.com\/gonum\/gonum\/tree\/master\/optimize"},{"key":"e_1_3_3_2_3_2","unstructured":"Umesh Bhatt. 2024. Detailed LevelDB statistics for all experiments. Retrieved October 31 2024 from https:\/\/github.com\/me-hem\/PL-LevelDB\/blob\/master\/LevelDB_Stats.txt"},{"key":"e_1_3_3_2_4_2","unstructured":"Umesh Bhatt. 2024. Power Law implementation - LevelDB. Retrieved October 31 2024 from https:\/\/github.com\/me-hem\/PL-LevelDB\/blob\/master\/leveldb\/opt\/options.go#L446"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_3_2_6_2","unstructured":"Brian\u00a0F. Cooper Adam Silberstein Erwin Tam Raghu Ramakrishnan and Russell Sears. 2024. Workload C a read-only workload from YCSB. Retrieved October 31 2024 from https:\/\/github.com\/brianfrankcooper\/YCSB\/blob\/master\/workloads\/workloadc"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196927"},{"key":"e_1_3_3_2_8_2","unstructured":"Alan Drummer. 2020. Extracting insights from complex unstructured big data. Retrieved October 31 2024 from https:\/\/www.ibm.com\/blog\/managing-unstructured-data\/"},{"key":"e_1_3_3_2_9_2","unstructured":"Google. 2023. LevelDB. Retrieved October 31 2024 from https:\/\/github.com\/google\/leveldb\/"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","unstructured":"Andy Huynh Harshal\u00a0A. Chaudhari Evimaria Terzi and Manos Athanassoulis. 2022. Endure: A Robust Tuning Paradigm for LSM Trees Under Workload Uncertainty. Proc. VLDB Endow. 15 8 (2022) 1605\u20131618. 10.14778\/3529337.3529345","DOI":"10.14778\/3529337.3529345"},{"key":"e_1_3_3_2_11_2","unstructured":"IDC. 2024. IDC: The premier global market intelligence firm.Retrieved October 31 2024 from https:\/\/www.idc.com\/"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS47774.2020.00113"},{"key":"e_1_3_3_2_13_2","first-page":"191","volume-title":"17th USENIX Conference on File and Storage Technologies, FAST 2019, Boston, MA, February 25-28, 2019","author":"Kaiyrakhmet Olzhas","year":"2019","unstructured":"Olzhas Kaiyrakhmet, Songyi Lee, Beomseok Nam, Sam\u00a0H. Noh, and Young-ri Choi. 2019. SLM-DB: Single-Level Key-Value Store with Persistent Memory. In 17th USENIX Conference on File and Storage Technologies, FAST 2019, Boston, MA, February 25-28, 2019. USENIX Association, 191\u2013205. https:\/\/www.usenix.org\/conference\/fast19\/presentation\/kaiyrakhmet"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC\/SMARTCITY\/DSS.2019.00123"},{"key":"e_1_3_3_2_15_2","first-page":"149","volume-title":"14th USENIX Conference on File and Storage Technologies, FAST 2016, Santa Clara, CA, USA, February 22-25, 2016","author":"Lim Hyeontaek","year":"2016","unstructured":"Hyeontaek Lim, David\u00a0G. Andersen, and Michael Kaminsky. 2016. Towards Accurate and Fast Evaluation of Multi-Stage Log-structured Designs. In 14th USENIX Conference on File and Storage Technologies, FAST 2016, Santa Clara, CA, USA, February 22-25, 2016. USENIX Association, 149\u2013166. https:\/\/www.usenix.org\/conference\/fast16\/technical-sessions\/presentation\/lim"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","unstructured":"Chen Luo and Michael\u00a0J. Carey. 2020. LSM-based storage techniques: a survey. VLDB J. 29 1 (2020) 393\u2013418. 10.1007\/S00778-019-00555-Y","DOI":"10.1007\/S00778-019-00555-Y"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","unstructured":"Patrick\u00a0E. O\u2019Neil Edward Cheng Dieter Gawlick and Elizabeth\u00a0J. O\u2019Neil. 1996. The Log-Structured Merge-Tree (LSM-Tree). Acta Informatica 33 4 (1996) 351\u2013385. 10.1007\/S002360050048","DOI":"10.1007\/S002360050048"},{"key":"e_1_3_3_2_18_2","unstructured":"Michael O\u2019Reilly. 2022. The Unseen Data Conundrum. Retrieved October 31 2024 from https:\/\/www.forbes.com\/councils\/forbestechcouncil\/2022\/02\/03\/the-unseen-data-conundrum\/"},{"key":"e_1_3_3_2_19_2","unstructured":"Meta Platforms. 2024. RocksDB. Retrieved October 31 2024 from https:\/\/github.com\/facebook\/rocksdb"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_3_3_2_21_2","unstructured":"syndtr. 2019. Geometric Progression implementation - LevelDB. Retrieved October 31 2024 from https:\/\/github.com\/syndtr\/goleveldb\/blob\/v1\/leveldb\/opt\/options.go#L445"},{"key":"e_1_3_3_2_22_2","series-title":"Dagstuhl Seminar Proceedings","volume-title":"Combinatorial Scientific Computing, 01.02. - 06.02.2009","volume":"09061","author":"W\u00e4chter Andreas","year":"2009","unstructured":"Andreas W\u00e4chter. 2009. Short Tutorial: Getting Started With Ipopt in 90 Minutes. In Combinatorial Scientific Computing, 01.02. - 06.02.2009(Dagstuhl Seminar Proceedings, Vol.\u00a009061). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Germany. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2009\/2089\/"},{"key":"e_1_3_3_2_23_2","first-page":"51","volume-title":"19th USENIX Conference on File and Storage Technologies, FAST 2021, February 23-25, 2021","author":"Zhong Wenshao","year":"2021","unstructured":"Wenshao Zhong, Chen Chen, Xingbo Wu, and Song Jiang. 2021. REMIX: Efficient Range Query for LSM-trees. In 19th USENIX Conference on File and Storage Technologies, FAST 2021, February 23-25, 2021. USENIX Association, 51\u201364. https:\/\/www.usenix.org\/conference\/fast21\/presentation\/zhong"}],"event":{"name":"CODS-COMAD 2024: 8th International Conference on Data Science and Management of Data (12th ACM IKDD CODS and 30th COMAD)","location":"Jodhpur India","acronym":"CODS-COMAD Dec '24"},"container-title":["Proceedings of the 8th International Conference on Data Science and Management of Data (12th ACM IKDD CODS and 30th COMAD)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3703323.3703707","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T13:03:19Z","timestamp":1750856599000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3703323.3703707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,18]]},"references-count":22,"alternative-id":["10.1145\/3703323.3703707","10.1145\/3703323"],"URL":"https:\/\/doi.org\/10.1145\/3703323.3703707","relation":{},"subject":[],"published":{"date-parts":[[2024,12,18]]},"assertion":[{"value":"2025-06-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}