{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/106349"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/106349","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"OpenKV: LSM-tree-based key-value store for open-channel SSD","abstract":"Log-structured merge (LSM) tree-based key-value stores, such as LevelDB and RocksDB, have seen great adoption in industry due to their high write speed. However, one major issue with LSM-based databases is the high write amplification. The root cause of this problem is the LSM tree structure that demands each level to be completely sorted. In this work, we propose OpenKV, a novel key-value store for open-channel SSD that achieves very low write amplification with good read performance. We propose a design with partially sorted levels with lazy compaction to reduce write amplification, and we have designed a central lookup table based on the cuckoo filter to utilize the open-channel SSD's direct page-level access. In our evaluation we show that compared to LevelDB, our design can reduce write traffic by 2.6x to 3.5x while improving random read performance by up to 1.8x.","abstract_html":"Log-structured merge (LSM) tree-based key-value stores, such as LevelDB and RocksDB, have seen great adoption in industry due to their high write speed. However, one major issue with LSM-based databases is the high write amplification. The root cause of this problem is the LSM tree structure that demands each level to be completely sorted. In this work, we propose OpenKV, a novel key-value store for open-channel SSD that achieves very low write amplification with good read performance. We propose a design with partially sorted levels with lazy compaction to reduce write amplification, and we have designed a central lookup table based on the cuckoo filter to utilize the open-channel SSD's direct page-level access. In our evaluation we show that compared to LevelDB, our design can reduce write traffic by 2.6x to 3.5x while improving random read performance by up to 1.8x.","abstract_has_math":false,"creators":["Wang, Xiaohao"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Huang, Jian"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2020,"date_issued":"2020-03-02T22:12:19Z","date_published":"2020-03-02T22:12:19Z","updated_at":"2026-07-22T22:24:45Z","subjects":["Key-Value Store, Cuckoo Filter, Open-Channel SSD"],"languages":["en"],"rights":["Copyright 2019 Xiaohao Wang"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/106349","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Huang, Jian"]},{"key":"dc:creator","label":"Author","values":["Wang, Xiaohao"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2020-03-02T22:12:19Z","2022-03-03T10:15:08Z","2019-11-19","2019-12"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Key-Value Store, Cuckoo Filter, Open-Channel SSD"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2019 Xiaohao Wang"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/106349"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Log-structured merge (LSM) tree-based key-value stores, such as LevelDB and RocksDB, have seen great adoption in industry due to their high write speed. However, one major issue with LSM-based databases is the high write amplification. The root cause of this problem is the LSM tree structure that demands each level to be completely sorted. In this work, we propose OpenKV, a novel key-value store for open-channel SSD that achieves very low write amplification with good read performance. We propose a design with partially sorted levels with lazy compaction to reduce write amplification, and we have designed a central lookup table based on the cuckoo filter to utilize the open-channel SSD's direct page-level access. In our evaluation we show that compared to LevelDB, our design can reduce write traffic by 2.6x to 3.5x while improving random read performance by up to 1.8x.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2021-12-01","The student, Xiaohao Wang, accepted the attached license on 2019-11-19 at 14:35.","The student, Xiaohao Wang, submitted this Thesis for approval on 2019-11-19 at 14:51.","This Thesis was approved for publication on 2019-11-19 at 16:03.","DSpace SAF Submission Ingestion Package generated from Vireo submission #14566 on 2020-02-28 at 17:22:25","Made available in DSpace on 2020-03-02T22:12:19Z (GMT). No. of bitstreams: 3 WANG-THESIS-2019.pdf: 988208 bytes, checksum: e0f934a9b5fd42ca5c4b5e498e44f68c (MD5) Master Thesis.zip: 1031677 bytes, checksum: 069c09f13858e68ba0a6f7c3a69f3123 (MD5) LICENSE.txt: 4209 bytes, checksum: 9ff8f45ee449fb9b76319fa72af5c558 (MD5) Previous issue date: 2019-11-19","Embargo set by: Seth Robbins for item 113890 Lift date: 2022-03-02T22:12:26Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","Embargo set by: Seth Robbins for item 113890 Lift date: 2022-03-02T22:15:21Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","Embargo set by: Seth Robbins for item 113890 Lift date: 2022-03-02T22:18:25Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 113890 on 2022-03-03T10:15:08Z."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["OpenKV: LSM-tree-based key-value store for open-channel SSD"]}]}],"canonical_facts":{"dc:contributor":["Huang, Jian"],"dc:creator":["Wang, Xiaohao"],"dc:date":["2020-03-02T22:12:19Z","2022-03-03T10:15:08Z","2019-11-19","2019-12"],"dc:description":["Log-structured merge (LSM) tree-based key-value stores, such as LevelDB and RocksDB, have seen great adoption in industry due to their high write speed. However, one major issue with LSM-based databases is the high write amplification. The root cause of this problem is the LSM tree structure that demands each level to be completely sorted. In this work, we propose OpenKV, a novel key-value store for open-channel SSD that achieves very low write amplification with good read performance. We propose a design with partially sorted levels with lazy compaction to reduce write amplification, and we have designed a central lookup table based on the cuckoo filter to utilize the open-channel SSD's direct page-level access. In our evaluation we show that compared to LevelDB, our design can reduce write traffic by 2.6x to 3.5x while improving random read performance by up to 1.8x.","Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2021-12-01","The student, Xiaohao Wang, accepted the attached license on 2019-11-19 at 14:35.","The student, Xiaohao Wang, submitted this Thesis for approval on 2019-11-19 at 14:51.","This Thesis was approved for publication on 2019-11-19 at 16:03.","DSpace SAF Submission Ingestion Package generated from Vireo submission #14566 on 2020-02-28 at 17:22:25","Made available in DSpace on 2020-03-02T22:12:19Z (GMT). No. of bitstreams: 3 WANG-THESIS-2019.pdf: 988208 bytes, checksum: e0f934a9b5fd42ca5c4b5e498e44f68c (MD5) Master Thesis.zip: 1031677 bytes, checksum: 069c09f13858e68ba0a6f7c3a69f3123 (MD5) LICENSE.txt: 4209 bytes, checksum: 9ff8f45ee449fb9b76319fa72af5c558 (MD5) Previous issue date: 2019-11-19","Embargo set by: Seth Robbins for item 113890 Lift date: 2022-03-02T22:12:26Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","Embargo set by: Seth Robbins for item 113890 Lift date: 2022-03-02T22:15:21Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","Embargo set by: Seth Robbins for item 113890 Lift date: 2022-03-02T22:18:25Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 113890 on 2022-03-03T10:15:08Z."],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/106349"],"dc:language":["en"],"dc:rights":["Copyright 2019 Xiaohao Wang"],"dc:subject":["Key-Value Store, Cuckoo Filter, Open-Channel SSD"],"dc:title":["OpenKV: LSM-tree-based key-value store for open-channel SSD"],"dc:type":["text"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:24:45Z"}