The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Workload analysis of a large-scale key-value store
Abstract
Key-value stores are a vital component in many scale-out enterprises, including social networks, online retail, and risk analysis. Accordingly, they are receiving increased attention from the research community in an effort to improve their performance, scalability, reliability, cost, and power consumption. To be effective, such efforts require a detailed understanding of realistic key-value workloads. And yet little is known about these workloads outside of the companies that operate them. This paper aims to address this gap.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Web caching and Zipf-like distributions: evidence and implications
Breslau, L., Cao, P., Fan, L., Phillips, G., & Shenker, S. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749260 · Cited by 3,467
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447 · cited 6×
“Examples include: Dynamo at Amazon [15]; Redis at GitHub, Digg, and Blizzard Interactive [27]; Mem cached at Facebook, Zynga and Twitter [18, 26]; and Volde mort at Linkedin [1].”
BackgroundMethodInfluentialInternet Web servers: workload characterization and performance implications
Arlitt, M. F., & Williamson, C. L. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.649565 · Cited by 730
Characteristics of WWW Client-based Traces
Cunha, C. R., Azer Bestavros, C., & Crovella, M. E. (1995) · OpenBU (Boston University) · Cited by 587
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
Jiang, S., & Zhang, X. (2002) · Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/511334.511340 · Cited by 489
Self-citationThe workload on parallel supercomputers: modeling the characteristics of rigid jobs
Lublin, U., & Feitelson, D. G. (2003) · Journal of Parallel and Distributed Computing · doi:10.1016/s0743-7315(03)00108-4 · Cited by 441
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
Distributed caching with memcached
FitzpatrickBrad (2004) · Linux journal · doi:10.5555/1012889.1012894 · Cited by 388
Changes in Web client access patterns: Characteristics and caching implications
Barford, P., Bestavros, A., Bradley, A., & Crovella, M. (1999) · World Wide Web · doi:10.1023/a:1019236319752 · Cited by 373
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
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
Web search using mobile cores: quantifying and mitigating the price of efficiency
Janapa Reddi, V., Lee, B. C., Chilimbi, T., & Vaid, K. (2010) · Proceedings of the 37th annual international symposium on Computer architecture · doi:10.1145/1815961.1816002 · Cited by 194
The Measured Access Characteristics of World-Wide-Web Client Proxy Caches
Duska, B. M., Marwood, D., & Feeley, M. J. (1997) · Cited by 193
Workload Modeling for Performance Evaluation
Feitelson, D. G. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45798-4_6 · Cited by 162
Workload characterization of a Web proxy in a cable modem environment
Arlitt, M. F., Friedrich, R., & Jin, T. (1999) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/332944.332951 · Cited by 120
Berezecki, M., Frachtenberg, E., Paleczny, M., & Steele, K. (2011) · International Green and Sustainable Computing Conference · doi:10.1109/igcc.2011.6008565 · Cited by 91
Self-citationManley, S., & Seltzer, M. (1997) · Cited by 80
Cited by
Inside the Social Network's (Datacenter) Network
Roy, A., Zeng, H., Bagga, J., Porter, G., & Snoeren, A. C. (2015) · Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication · doi:10.1145/2785956.2787472 · Cited by 849
NetCache: Balancing Key-Value Stores with Fast In-Network Caching
Jin, X., Li, X., Zhang, H., Soulé, R., Lee, J., Foster, N., Kim, C., & Stoica, I. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132764 · Cited by 556
Using RDMA efficiently for key-value services
Kalia, A., Kaminsky, M., & Andersen, D. G. (2014) · Proceedings of the 2014 ACM conference on SIGCOMM · doi:10.1145/2619239.2626299 · Cited by 395
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
Metadata
- Authors
- Atikoglu, B., Xu, Y., Frachtenberg, E., Jiang, S., & Paleczny, M.
- Venue
- Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
- Publisher
- ACM
- Published
- 2012-06-11
- Pages
- 53-64
- OpenAlex
- W2125901106
- Cited by
- 901
- References
- 18
- FWCI
- 41.75
- Type
- conference paper
- Language
- en
- Open access
- closed
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.