{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:40:05Z","timestamp":1755880805231,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 210381, CNS-1938709"],"award-info":[{"award-number":["CCF 210381, CNS-1938709"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3660514","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"475-477","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Root-to-Leaf Scheduling in Write-Optimized Trees"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-4152-1059","authenticated-orcid":false,"given":"Christopher","family":"Chung","sequence":"first","affiliation":[{"name":"Independent Researcher, Chicago, IL, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9253-8809","authenticated-orcid":false,"given":"William","family":"Jannen","sequence":"additional","affiliation":[{"name":"Williams College, Williamstown, MA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8196-9662","authenticated-orcid":false,"given":"Samuel","family":"McCauley","sequence":"additional","affiliation":[{"name":"Williams College, Williamstown, MA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2565-1163","authenticated-orcid":false,"given":"Bertrand","family":"Simon","sequence":"additional","affiliation":[{"name":"IN2P3 Computing Center\/CNRS, Lyon - Villeurbanne, France"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323210"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3470635"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.40"},{"key":"e_1_3_2_1_4_1","volume-title":"An Introduction to B$^e$-Trees and Write-Optimization. :login","author":"Bender Michael A.","year":"2015","unstructured":"Michael A. Bender, Martin Farach-Colton, William Jannen, Rob Johnson, Bradley C. Kuszmaul, Donald E. Porter, Jun Yuan, and Yang Zhan. 2015. An Introduction to B$^e$-Trees and Write-Optimization. :login; Magazine, Vol. 40, 5 (10 2015), 22--28."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056117"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. Symposium on Discrete Algorithms (SODA)","volume":"3","author":"Brodal Gerth St\u00f8lting","year":"2003","unstructured":"Gerth St\u00f8lting Brodal and Rolf Fagerberg. 2003. Lower bounds for external memory dictionaries.. In Proc. Symposium on Discrete Algorithms (SODA), Vol. 3. ACM-SIAM, ACM, New York, NY, USA, 546--554."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818376"},{"key":"e_1_3_2_1_8_1","unstructured":"Christopher Chung William Jannen Samuel McCauley and Bertrand Simon. 2024. Root-to-Leaf Scheduling in Write-Optimized Trees. arxiv: 2404.17544 [cs.DS]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276980"},{"key":"e_1_3_2_1_10_1","volume-title":"The TokuFS Streaming File System. In 4th USENIX Workshop on Hot Topics in Storage and File Systems, HotStorage'12","author":"Esmet John","year":"2012","unstructured":"John Esmet, Michael A. Bender, Martin Farach-Colton, and Bradley C. Kuszmaul. 2012. The TokuFS Streaming File System. In 4th USENIX Workshop on Hot Topics in Storage and File Systems, HotStorage'12, Boston, MA, USA, June 13--14, 2012. USENIX Association, Boston, MA."},{"key":"e_1_3_2_1_11_1","volume-title":"Last Accessed","author":"Ghemawat Sanjay","year":"2023","unstructured":"Sanjay Ghemawat and Jeff Dean. 2014. LevelDB: A fast and lightweight key\/value database library by Google. https:\/\/github.com\/google\/leveldb, Last Accessed October 1, 2023."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0123021"},{"volume-title":"Proc. Conference on File and Storage Technologies (FAST). USENIX Association","author":"Jannen William","key":"e_1_3_2_1_13_1","unstructured":"William Jannen, Jun Yuan, Yang Zhan, Amogh Akshintala, John Esmet, Yizheng Jiao, Ankur Mittal, Prashant Pandey, Phaneendra Reddy, Leif Walsh, Michael Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, and Donald E. Porter. 2015a. BetrFS: A Right-Optimized Write-Optimized File System. In Proc. Conference on File and Storage Technologies (FAST). USENIX Association, Boston, MA, 301--315."},{"key":"e_1_3_2_1_14_1","first-page":"1","volume-title":"Porter","author":"Jannen William","year":"2015","unstructured":"William Jannen, Jun Yuan, Yang Zhan, Amogh Akshintala, John Esmet, Yizheng Jiao, Ankur Mittal, Prashant Pandey, Phaneendra Reddy, Leif Walsh, Michael Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, and Donald E. Porter. 2015b. BetrFS: Write-Optimization in a Kernel File System. Transactions on Storage (TOS) , Vol. 11, 4, Article 18 (2015), bibinfonumpages18:1--18:29 pages."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519571"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1156332"},{"volume-title":"Proc. Conference on File and Storage Technologies (FAST). USENIX Association","author":"Lu Lanyue","key":"e_1_3_2_1_17_1","unstructured":"Lanyue Lu, Thanumalayan Sankaranarayana Pillai, Andrea C. Arpaci-Dusseau, and Remzi H. Arpaci-Dusseau. 2016. WiscKey: Separating Keys from Values in SSD-conscious Storage. In Proc. Conference on File and Storage Technologies (FAST). USENIX Association, Boston, MA, 133--148."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380598"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132765"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.28"},{"key":"e_1_3_2_1_22_1","volume-title":"TABLEFS: Enhancing Metadata Efficiency in the Local File System.. In usenixatc","author":"Ren Kai","year":"2013","unstructured":"Kai Ren and Garth A Gibson. 2013. TABLEFS: Enhancing Metadata Efficiency in the Local File System.. In usenixatc. USENIX Association, Boston, MA, 145--156."},{"key":"e_1_3_2_1_23_1","volume-title":"Conference on File and Storage Technologies (FAST). USENIX Association","author":"Shetty Pradeep J","year":"2013","unstructured":"Pradeep J Shetty, Richard P Spillane, Ravikant R Malpani, Binesh Andrews, Justin Seyster, and Erez Zadok. 2013. Building workload-independent storage with VT-trees. In Conference on File and Storage Technologies (FAST). USENIX Association, Boston, MA, 17--30."},{"key":"e_1_3_2_1_24_1","volume-title":"Last Accessed","author":"Engineering Team Facebook Database","year":"2023","unstructured":"Facebook Database Engineering Team. 2014. RocksDB: A Persistent Key-Value Store for Flash and RAM Storage. https:\/\/github.com\/facebook\/rocksdb, Last Accessed October 1, 2023."},{"key":"e_1_3_2_1_25_1","unstructured":"Facebook Database Engineering Team. 2023. RocksDB Compaction. https:\/\/github.com\/facebook\/rocksdb\/wiki\/Compaction. Accessed: 2023--27-09."},{"volume-title":"Proc. Conference on File and Storage Technologies (FAST). USENIX Association","author":"Yuan Jun","key":"e_1_3_2_1_26_1","unstructured":"Jun Yuan, Yang Zhan, William Jannen, Prashant Pandey, Amogh Akshintala, Kanchan Chandnani, Pooja Deo, Zardosht Kasheff, Leif Walsh, Michael Bender, Martin Farach-Colton, Rob Johnson, Bradley C. Kuszmaul, and Donald E. Porter. 2016. Optimizing Every Operation in a Write-optimized File System. In Proc. Conference on File and Storage Technologies (FAST). USENIX Association, Boston, MA, 1--14. io"}],"event":{"name":"SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Nantes France","acronym":"SPAA '24"},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3660514","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3660514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:23:17Z","timestamp":1755879797000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3660514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":26,"alternative-id":["10.1145\/3626183.3660514","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3660514","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}