{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,15]],"date-time":"2026-11-15T11:46:21Z","timestamp":1794743181584,"version":"4.9.1"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T00:00:00Z","timestamp":1519948800000},"content-version":"vor","delay-in-days":367,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1421033, CNS-1319405, CNS-1218405, CNS-1419199"],"award-info":[{"award-number":["CNS-1421033, CNS-1319405, CNS-1218405, CNS-1419199"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2017,2,28]]},"abstract":"<jats:p>We present WiscKey, a persistent LSM-tree-based key-value store with a performance-oriented data layout that separates keys from values to minimize I\/O amplification. The design of WiscKey is highly SSD optimized, leveraging both the sequential and random performance characteristics of the device. We demonstrate the advantages of WiscKey with both microbenchmarks and YCSB workloads. Microbenchmark results show that WiscKey is 2.5 \u00d7 to 111 \u00d7 faster than LevelDB for loading a database (with significantly better tail latencies) and 1.6 \u00d7 to 14 \u00d7 faster for random lookups. WiscKey is faster than both LevelDB and RocksDB in all six YCSB workloads.<\/jats:p>","DOI":"10.1145\/3033273","type":"journal-article","created":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T08:56:34Z","timestamp":1488790594000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":267,"title":["WiscKey"],"prefix":"10.1145","volume":"13","author":[{"given":"Lanyue","family":"Lu","sequence":"first","affiliation":[{"name":"University of Wisconsin, Madison, Madison, WI"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thanumalayan Sankaranarayana","family":"Pillai","sequence":"additional","affiliation":[{"name":"University of Wisconsin, Madison, Madison, WI"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hariharan","family":"Gopalakrishnan","sequence":"additional","affiliation":[{"name":"University of Wisconsin, Madison, Madison, WI"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea C.","family":"Arpaci-Dusseau","sequence":"additional","affiliation":[{"name":"University of Wisconsin, Madison, Madison, WI"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Remzi H.","family":"Arpaci-Dusseau","sequence":"additional","affiliation":[{"name":"University of Wisconsin, Madison, Madison, WI"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,3,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2435779"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/3026877.3026890"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855711.1855740"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629577"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465296"},{"key":"e_1_2_1_6_1","volume-title":"Arpaci-Dusseau","author":"Arpaci-Dusseau Remzi H.","year":"2014","unstructured":"Remzi H. Arpaci-Dusseau and Andrea C. Arpaci-Dusseau. 2014. Operating Systems: Three Easy Pieces (0.9 ed.). Arpaci-Dusseau Books."},{"key":"e_1_2_1_7_1","volume-title":"Designing Access Methods: The RUM Conjecture. In The 19th International Conference on Extending Database Technology (EDBT\u201915)","author":"Athanassoulis Manos","year":"2015","unstructured":"Manos Athanassoulis, Michael S. Kester, Lukas M. Maas, Radu Stoica, Stratos Idreos, Anastasia Ailamaki, and Mark Callaghan. 2015. Designing Access Methods: The RUM Conjecture. In The 19th International Conference on Extending Database Technology (EDBT\u201915)."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the USENIX Annual Technical Conference (USENIX ATC\u201915)","author":"Atikoglu Berk","year":"2015","unstructured":"Berk Atikoglu, Yuehai Xu, Eitan Frachtenberg, Song Jiang, and Mike Paleczny. 2015. Workload analysis of a large-scale key-value store. In Proceedings of the USENIX Annual Technical Conference (USENIX ATC\u201915)."},{"key":"e_1_2_1_9_1","unstructured":"Radheshyam Balasundaram Igor Canadi Yueh-Hsuan Chiang Siying Dong Leonidas Galanis Lei Jin Xing Jin Venkatesh Radhakrishnan Dmitri Smirnov Yi Wu and Feng Zhu. 2015. RocksDB Blog. Retrieved from http:\/\/rocksdb.org\/blog\/."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1924943.1924947"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248393"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/338219.338650"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2010.33"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1298455.1298475"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2014698.2014864"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213947"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742798"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454167"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921015"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989327"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"key":"e_1_2_1_23_1","unstructured":"Siying Dong. 2015. RocksDB: Challenges of LSM-Trees in Practice. http:\/\/www.hpts.ws\/papers\/2015\/rocksdb_hpts_website.pdf."},{"key":"e_1_2_1_24_1","unstructured":"Facebook. 2015. RocksDB 2015 H2 Roadmap. http:\/\/rocksdb.org\/blog\/2015\/rocksdb-2015-h2-roadmap\/."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2482626.2482662"},{"key":"e_1_2_1_26_1","unstructured":"Fusion-I. O. 2015. Fusion-I. O. ioDrive2. Retrieved from http:\/\/www.fusionio.com\/products\/iodrive2."},{"key":"e_1_2_1_27_1","unstructured":"Lars George. 2011. HBase: The Definitive Guide. O\u2019Reilly."},{"key":"e_1_2_1_28_1","unstructured":"Sanjay Ghemawat and jeff Dean. 2011. LevelDB. Retrieved from http:\/\/code.google.com\/p\/leveldb."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741973"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2591305.2591325"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2750482.2750505"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2208461.2208478"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2015.7208288"},{"key":"e_1_2_1_34_1","volume-title":"The 3rd ACM SIGOPS International Workshop on Large Scale Distributed Systems and Middleware.","author":"Lakshman Avinash","year":"2009","unstructured":"Avinash Lakshman and Prashant Malik. 2009. Cassandra -- a decentralized structured storage system. In The 3rd ACM SIGOPS International Workshop on Large Scale Distributed Systems and Middleware."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/2750482.2750503"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043558"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2616448.2616488"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/2930583.2930594"},{"key":"e_1_2_1_39_1","volume-title":"The 8th Annual Hadoop Summit.","author":"Mai Haohui","unstructured":"Haohui Mai and Jing Zhao. 2015. Scaling HDFS to manage billions of files with key value stores. In The 8th Annual Hadoop Summit."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2813767.2813783"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/2208461.2208473"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/2482626.2482663"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191884"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/2685048.2685050"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/2685048.2685082"},{"key":"e_1_2_1_48_1","unstructured":"Eric Redmond. 2013. A Little Riak Book. Retrieved from http:\/\/www.littleriakbook.com."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/2535461.2535480"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.25"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/2591272.2591275"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/2208461.2208479"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391237"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592804"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/2813767.2813773"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3033273","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3033273","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3033273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:35:48Z","timestamp":1763458548000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3033273"}},"subtitle":["Separating Keys from Values in SSD-Conscious Storage"],"short-title":[],"issued":{"date-parts":[[2017,2,28]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2,28]]}},"alternative-id":["10.1145\/3033273"],"URL":"https:\/\/doi.org\/10.1145\/3033273","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,28]]},"assertion":[{"value":"2016-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-12-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-03-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}