Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

WiscKey

WiscKey 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 to 111 faster than LevelDB for loading a database (with significantly better tail latencies) and 1.6 to 14 faster for random lookups. WiscKey is faster than both LevelDB and RocksDB in all six YCSB workloads. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Storage (TOS) Association for Computing Machinery

WiscKey

Download PDF
28 pages

Loading next page...
 
/lp/association-for-computing-machinery/wisckey-8DUIifP59M

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2017 ACM
ISSN
1553-3077
eISSN
1553-3093
DOI
10.1145/3033273
Publisher site
See Article on Publisher Site

Abstract

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 to 111 faster than LevelDB for loading a database (with significantly better tail latencies) and 1.6 to 14 faster for random lookups. WiscKey is faster than both LevelDB and RocksDB in all six YCSB workloads.

Journal

ACM Transactions on Storage (TOS) – Association for Computing Machinery

Published: Mar 2, 2017

Keywords: LevelDB

References

  • ForestDB: A fast key-value storage system for variable-length string keys
    Ahn, Jung-Sang; Seo, Chiyoung; Mayuram, Ravi; Yaseen, Rahim; Kim, Jin-Soo; Maeng, Seungryoul
  • Correlated crash vulnerabilities
    Alagappan, Ramnatthan; Ganesan, Aishwarya; Patel, Yuvraj; Pillai, Thanumalayan Sankaranarayana; Arpaci-Dusseau, Andrea C.; Arpaci-Dusseau, Remzi H.
  • Cheap and large cams for high-performance data-intensive networked systems
    Anand, Ashok; Muthukrishnan, Chitra; Kappes, Steven; Akella, Aditya; Nath, Suman
  • FAWN: A fast array of wimpy nodes
    Andersen, David; Franklin, Jason; Kaminsky, Michael; Phanishayee, Amar; Tan, Lawrence; Vasudevan, Vijay
  • LinkBench: A database benchmark based on the Facebook social graph
    Armstrong, Timothy G.; Ponnekanti, Vamsi; Borthakur, Dhruba; Callaghan, Mark
  • Operating Systems: Three Easy Pieces (0
    Arpaci-Dusseau, Remzi H.; Arpaci-Dusseau, Andrea C.
  • Designing Access Methods: The RUM Conjecture
    Athanassoulis, Manos; Kester, Michael S.; Maas, Lukas M.; Stoica, Radu; Idreos, Stratos; Ailamaki, Anastasia; Callaghan, Mark
  • Workload analysis of a large-scale key-value store
    Atikoglu, Berk; Xu, Yuehai; Frachtenberg, Eitan; Jiang, Song; Paleczny, Mike
  • RocksDB Blog
    Balasundaram, Radheshyam; Canadi, Igor; Chiang, Yueh-Hsuan; Dong, Siying; Galanis, Leonidas; Jin, Lei; Jin, Xing; Radhakrishnan, Venkatesh; Smirnov, Dmitri; Wu, Yi; Zhu, Feng
  • Finding a needle in haystack: Facebook’s photo storage
    Beaver, Doug; Kumar, Sanjeev; Li, Harry C.; Sobel, Jason; Vajgel, Peter
  • Cache-oblivious streaming b-trees
    Bender, Michael A.; Farach-Colton, Martin; Fineman, Jeremy T.; Fogel, Yonatan; Kuszmaul, Bradley; Nelson, Jelani
  • On external memory graph traversal
    Buchsbaum, Adam L.; Goldwasser, Michael; Venkatasubramanian, Suresh; Westbrook, Jeffery R.
  • Moneta: A high-performance storage array architecture for next-generation, non-volatile memories
    Caulfield, Adrian M.; De, Arup; Coburn, Joel; Mollow, Todor I.; Gupta, Rajesh K.; Swanson, Steven
  • Bigtable: A distributed storage system for structured data
    Chang, Fay; Dean, Jeffrey; Ghemawat, Sanjay; Hsieh, Wilson C.; Wallach, Deborah A.; Burrows, Michael; Chandra, Tushar; Fikes, Andrew; Gruber, Robert
  • Essential roles of exploiting internal parallelism of flash memory based solid state drives in high-speed data processing
    Chen, Feng; Lee, Rubao; Zhang, Xiaodong
  • Walnut: A unified cloud object store
    Chen, Jianjun; Douglas, Chris; Mutsuzaki, Michi; Quaid, Patrick; Ramakrishnan, Raghu; Rao, Sriram; Sears, Russell
  • Purity: Building fast, highly-available enterprise flash storage from commodity components
    Colgrove, John; Davis, John D.; Hayes, John; Miller, Ethan L.; Sandvig, Cary; Sears, Russell; Tamches, Ari; Vachharajani, Neil; Wang, Feng
  • PNUTS: Yahoo!s hosted data serving platform
    Cooper, Brian F.; Ramakrishnan, Raghu; Srivastava, Utkarsh; Silberstein, Adam; Bohannon, Philip; Jacobsen, Hans-Arno; Puz, Nick; Weaver, Daniel; Yerneni, Ramana
  • Benchmarking cloud serving systems with YCSB
    Cooper, Brian F.; Silberstein, Adam; Tam, Erwin; Ramakrishnan, Raghu; Sears, Russell
  • FlashStore: High throughput persistent key-value store
    Debnath, Biplob; Sengupta, Sudipta; Li, Jin
  • SkimpyStash: RAM space skimpy key-value store on flash-based storage
    Debnath, Biplob; Sengupta, Sudipta; Li, Jin
  • Dynamo: Amazon’s highly available key-value store
    DeCandia, Guiseppe; Hastorun, Deniz; Jampani, Madan; Kakulapati, Gunavardhan; Lakshman, Avinash; Pilchin, Alex; Sivasubramanian, Swami; Vosshall, Peter; Vogels, Werner
  • RocksDB: Challenges of LSM-Trees in Practice
    Dong, Siying
  • RocksDB 2015 H2 Roadmap
    Facebook,
  • MemC3: Compact and concurrent MemCache with dumber caching and smarter hashing
    Fan, Bin; Andersen, David G.; Kaminsky, Michael
  • Fusion-I
    O., Fusion-I.
  • HBase: The Definitive Guide
    George, Lars
  • LevelDB
    Ghemawat, Sanjay; Dean, jeff
  • Scaling concurrent log-structured data stores
    Golan-Gueta, Guy; Bortnikov, Edward; Hillel, Eshcar; Keidar, Idit
  • Analysis of HDFS under HBase: A Facebook messages case study
    Harter, Tyler; Borthakur, Dhruba; Dong, Siying; Aiyer, Amitanand; Tang, Liyin; Arpaci-Dusseau, Andrea C.; Arpaci-Dusseau, Remzi H.
  • BetrFS: A right-optimized write-optimized file system
    Jannen, William; Yuan, Jun; Zhan, Yang; Akshintala, Amogh; Esmet, John; Jiao, Yizheng; Mittal, Ankur; Pandey, Prashant; Reddy, Phaneendra; Walsh, Leif; Bender, Michael; Farach-Colton, Martin; Johnson, Rob; Kuszmaul, Bradley C.; Porter, Donald E.
  • Revisiting storage for smartphones
    Kim, Hyojun; Agrawal, Nitin; Ungureanu, Cristian
  • Atlas: Baidus key-value storage system for cloud data
    Lai, Chunbo; Jiang, Song; Yang, Liqiong; Lin, Shiding; Sun, Guangyu; Hou, Zhenyu; Cui, Can; Cong, Jason
  • Cassandra -- a decentralized structured storage system
    Lakshman, Avinash; Malik, Prashant
  • F2FS: A new file system for flash storage
    Lee, Changman; Sim, Dongho; Hwang, Jooyoung; Cho, Sangyeun
  • SILT: A memory-efficient, high-performance key-value store
    Lim, Hyeontaek; Fan, Bin; Andersen, David G.; Kaminsky, Michael
  • MICA: A holistic approach to fast in-memory key-value storage
    Lim, Hyeontaek; Han, Dongsu; Andersen, David G.; Kaminsky, Michael
  • WiscKey: Separating keys from values in SSD-conscious storage
    Lu, Lanyue; Pillai, Thanumalayan Sankaranarayana; Arpaci-Dusseau, Andrea C.; Arpaci-Dusseau, Remzi H.
  • Scaling HDFS to manage billions of files with key value stores
    Mai, Haohui; Zhao, Jing
  • Cache craftiness for fast multicore key-value storage
    Mao, Yandong; Kohler, Eddie; Morris, Robert
  • NVMKV: A scalable, lightweight, ftl-aware key-value store
    Marmol, Leonardo; Sundararaman, Swaminathan; Talagala, Nisha; Rangaswami, Raju
  • SFS: Random write considered harmful in solid state drives
    Min, Changwoo; Kim, Kangnyeon; Cho, Hyunjin; Lee, Sang-Won; Eom, Young Ik
  • Scaling memcache at facebook
    Nishtala, Rajesh; Fugal, Hans; Grimm, Steven; Kwiatkowski, Marc; Lee, Herman; Li, Harry C.; McElroy, Ryan; Paleczny, Mike; Peek, Daniel; Saab, Paul; Stafford, David; Tung, Tony; Venkataramani, Venkateshwaran
  • AlphaSort: A RISC machine sort
    Nyberg, Chris; Barclay, Tom; Cvetanovic, Zarka; Gray, Jim; Lomet, Dave
  • The log-structured merge-tree (LSM-tree)
    ONeil, Patrick; Cheng, Edward; Gawlick, Dieter; ONeil, Elizabeth
  • Arrakis: The operating system is the control plane
    Peter, Simon; Li, Jialin; Zhang, Irene; Ports, Dan R. K.; Woos, Doug; Krishnamurthy, Arvind; Anderson, Thomas
  • All file systems are not created equal: On the complexity of crafting crash-consistent applications
    Pillai, Thanumalayan Sankaranarayana; Chidambaram, Vijay; Alagappan, Ramnatthan; Al-Kiswany, Samer; Arpaci-Dusseau, Andrea C.; Arpaci-Dusseau, Remzi H.
  • A Little Riak Book
    Redmond, Eric
  • TABLEFS: Enhancing metadata efciency in the local file system
    Ren, Kai; Gibson, Garth
  • IndexFS: Scaling file system metadata performance with stateless caching and bulk insertion
    Ren, Kai; Zheng, Qing; Patil, Swapnil; Gibson, Garth
  • bLSM: A general purpose log structured merge tree
    Sears, Russell; Ramakrishnan, Raghu
  • Building workload-independent storage with VT-trees
    Shetty, Pradeep; Spillane, Richard; Malpani, Ravikant; Andrews, Binesh; Seyster, Justin; Zadok, Erez
  • Serving large-scale batch computed data with project Voldemort
    Sumbaly, Roshan; Kreps, Jay; Gao, Lei; Feinberg, Alex; Soman, Chinmay; Shah, Sam
  • Using vector interfaces to deliver millions of iops from a networked key-value storage server
    Vasudevan, Vijay; Kaminsky, Michael; Andersen, David G.
  • An efficient design and implementation of LSM-tree based key-value store on open-channel SSD
    Wang, Peng; Sun, Guangyu; Jiang, Song; Ouyang, Jian; Lin, Shiding; Zhang, Chen; Cong, Jason
  • LSM-trie: An LSM-tree-based ultra-large key-value store for small data
    Wu, Xingbo; Xu, Yuehai; Shao, Zili; Jiang, Song