The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
WiscKey: Separating Keys from Values in SSD-Conscious Storage
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Benchmarking cloud serving systems with YCSB
Cooper, B. F., Silberstein, A., Tam, E., Ramakrishnan, R., & Sears, R. (2010) · Proceedings of the 1st ACM symposium on Cloud computing · doi:10.1145/1807128.1807152 · Cited by 3,716
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447
Cassandra: a decentralized structured storage system
Lakshman, A., & Malik, P. (2010) · ACM SIGOPS Operating Systems Review · doi:10.1145/1773912.1773922 · Cited by 2,664
Bigtable: a distributed storage system for structured data
Chang, F. W., Dean, J. B., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., & Gruber, R. E. (2006) · doi:10.5555/1298455.1298475 · Cited by 1,928
The log-structured merge-tree (LSM-tree)
O’Neil, P., Cheng, E., Gawlick, D., & O’Neil, E. (1996) · Acta Informatica · doi:10.1007/s002360050048 · Cited by 1,317
PNUTS: Yahoo!'s hosted data serving platform
Cooper, B. F., Ramakrishnan, R., Srivastava, U., Silberstein, A., Bohannon, P., Jacobsen, H.-A., Puz, N., Weaver, D., & Yerneni, R. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1454159.1454167 · Cited by 958
Workload analysis of a large-scale key-value store
Atikoglu, B., Xu, Y., Frachtenberg, E., Jiang, S., & Paleczny, M. (2012) · Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems · doi:10.1145/2254756.2254766 · Cited by 901
Nishtala, R., Fugal, H., Grimm, S., Kwiatkowski, M., Lee, H., Li, H. C., McElroy, R., Paleczny, M., Peek, D., Saab, P., et al. (2013) · Networked Systems Design and Implementation · Cited by 663
Proceedings of the 2017 USENIX Annual Technical Conference (USENIX ATC ’17)
Quoc, D. L., Beck, M. S., Bhatotia, P., Chen, R., Fetzer, C. W., & Strufe, T. (2017) · Cited by 611
FAWN: a fast array of wimpy nodes
Andersen, D. G., Franklin, J., Kaminsky, M., Phanishayee, A., Tan, L., & Vasudevan, V. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629577 · Cited by 561
Cache craftiness for fast multicore key-value storage
Mao, Y., Kohler, E., & Morris, R. T. (2012) · Proceedings of the 7th ACM european conference on Computer Systems · doi:10.1145/2168836.2168855 · Cited by 467
Finding a needle in Haystack: facebook's photo storage
Beaver, D., Kumar, S., Li, H. C., Sobel, J., & Vajgel, P. (2010) · doi:10.5555/1924943.1924947 · Cited by 419
George, L. (2011) · Cited by 382
MICA: A Holistic Approach to Fast In-Memory Key-Value Storage
Lim, H., Han, D., Andersen, D. G., & Kaminsky, M. (2018) · Figshare · doi:10.1184/r1/6607280 · Cited by 361
LinkBench: a database benchmark based on the Facebook social graph
Armstrong, T. G., Ponnekanti, V., Borthakur, D., & Callaghan, M. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2465296 · Cited by 313
MemC3: Compact and Concurrent MemCache with Dumber Caching and Smarter Hashing
Fan, B., Andersen, D. G., & Kaminsky, M. (2018) · doi:10.1184/r1/6607223 · Cited by 296
SILT: a memory-efficient, high-performance key-value store
Lim, H., Fan, B., Andersen, D. G., & Kaminsky, M. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043558 · Cited by 294
Chen, F., Lee, R., & Zhang, X. (2011) · 2011 IEEE 17th International Symposium on High Performance Computer Architecture · doi:10.1109/hpca.2011.5749735 · Cited by 283
Operating Systems: Three Easy Pieces
Arpaci-Dusseau, R. H., & Arpaci-Dusseau, A. C. (2015) · Cited by 253
Self-citationArrakis: The Operating System is the Control Plane
Peter, S., Li, J., Zhang, I. Y., Ports, D. R. K., Woos, D., Krishnamurthy, A., Anderson, T. E., & Roscoe, T. (n.d.) · Cited by 239
FlashStore: high throughput persistent key-value store
Debnath, B. K., Sengupta, S., & Li, J. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1921015 · Cited by 237
An efficient design and implementation of LSM-tree based key-value store on open-channel SSD
Wang, P., Sun, G., Jiang, S., Ouyang, J., Lin, S., Zhang, C., & Cong, J. (2014) · European Conference on Computer Systems · doi:10.1145/2592798.2592804 · Cited by 193
Serving large-scale batch computed data with project Voldemort
Sumbaly, R., Kreps, J., Gao, L., Feinberg, A., Soman, C., & Shah, S. (2012) · doi:10.5555/2208461.2208479 · Cited by 167
WiscKey: separating keys from values in SSD-conscious storage
Lu, L., Pillai, T. S., Arpaci-Dusseau, A. C., & Arpaci-Dusseau, R. H. (2016) · File and Storage Technologies · Cited by 155
Self-citationLSM-trie: an LSM-tree-based ultra-large key-value store for small data
Wu, X., Xu, Y., Shao, Z., & Jiang, S. (2015) · Cited by 126
Atlas: Baidu's key-value storage system for cloud data
Lai, C., Jiang, S., Yang, L., Lin, S., Sun, G., Hou, Z., Cui, C., & Cong, J. (2015) · Digest of papers - IEEE Symposium on Mass Storage Systems · doi:10.1109/msst.2015.7208288 · Cited by 123
All file systems are not created equal: on the complexity of crafting crash-consistent applications
Pillai, T. S., Chidambaram, V., V, Alagappan, R., et al. (2014) · doi:10.5555/2685048.2685082 · Cited by 100
Self-citationRevisiting storage for smartphones
Kim, H., Agrawal, N., & Ungureanu, C. (2012) · File and Storage Technologies · doi:10.5555/2208461.2208478 · Cited by 95
Scaling concurrent log-structured data stores
Golan-Gueta, G., Bortnikov, E., Hillel, E., & Keidar, I. (2015) · European Conference on Computer Systems · doi:10.1145/2741948.2741973 · Cited by 94
Purity: Building Fast, Highly-Available Enterprise Flash Storage from Commodity Components
Colgrove, J., Davis, J. D., Hayes, J., Miller, E. L., Sandvig, C., Sears, R., Tamches, A., Vachharajani, N., & Wang, F. (2015) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2723372.2742798 · Cited by 61
NVMKV: a scalable, lightweight, FTL-aware key-value store
Mármol, L., Swaminathan, S., Talagala, N., & Rangaswami, R. (2015) · USENIX Annual Technical Conference · Cited by 60
ForestDB: A Fast Key-Value Storage System for Variable-Length String Keys
Ahn, J.-S., Seo, C., Mayuram, R., Yaseen, R., Kim, J., & Maeng, S. (2015) · IEEE Transactions on Computers · doi:10.1109/tc.2015.2435779 · Cited by 47
Walnut: a unified cloud object store
Chen, J., Douglas, C., Mutsuzaki, M., Quaid, P., Ramakrishnan, R., Rao, S., & Sears, R. (2012) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2213836.2213947 · Cited by 44
Correlated crash vulnerabilities
Alagappan, R., Ganesan, A., Patel, Y., Pillai, T. S., Arpaci-Dusseau, A. C., & Arpaci-Dusseau, R. H. (2016) · Operating Systems Design and Implementation · doi:10.5555/3026877.3026890 · Cited by 34
Self-citation
Cited by
Data Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures
Koukaras, P., & Tjortjis, C. (2025) · Big Data and Cognitive Computing · doi:10.3390/bdcc9100258 · Cited by 3
Metadata
- Authors
- Lu, L., Pillai, T. S., Gopalakrishnan, H., Arpaci-Dusseau, A. C., & Arpaci-Dusseau, R. H.
- Venue
- ACM Transactions on Storage
- Published
- 2017-02-28
- Volume
- 13
- Issue
- 1
- Pages
- 1-28
- ISSN
- 1553-3077 (ISSN-L)
- 1553-3093
- OpenAlex
- W2594680891
- Cited by
- 301
- References
- 35
- FWCI
- 12.11
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.