The DOI matches its OpenAlex record; 26 of the 26 references it cites were found in a registry or an index.
MICA: A Holistic Approach to Fast In-Memory Key-Value Storage
Open accessOverview
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
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
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
Odeh, R. E., & Knuth, D. E. (1969) · Journal of the American Statistical Association · doi:10.2307/2283757 · Cited by 2,525
Dean, J., & Barroso, L. A. (2013) · Communications of the ACM · doi:10.1145/2408776.2408794 · Cited by 1,852
Pagh, R., & Rodler, F. F. (2004) · Journal of Algorithms · doi:10.1016/j.jalgor.2003.12.002 · Cited by 1,045
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 959
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
Evaluating associativity in CPU caches
Hill, M. D., & Smith, A. J. (1989) · IEEE Transactions on Computers · doi:10.1109/12.40842 · Cited by 606
PacketShader: a GPU-accelerated software router
Han, S., Jang, K., Park, K., & Moon, S. B. (2010) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1851182.1851207 · Cited by 599
Dynamic storage allocation: A survey and critical review
Wilson, P. R., Johnstone, M. S., Neely, M., & Boles, D. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60368-9_19 · Cited by 594
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
Self-citationThe end of an architectural era: (it's time for a complete rewrite)
Stonebraker, M. R., Madden, S. R., Abadi, D. J., Harizopoulos, S., Hachem, N. I., & Helland, P. (2007) · Cited by 558
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
High performance dynamic lock-free hash tables and list-based sets
Michael, M. M. (2002) · Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures · doi:10.1145/564870.564881 · Cited by 413
Fast crash recovery in RAMCloud
Ongaro, D., Rumble, S. M., Stutsman, R., Ousterhout, J., & Rosenblum, M. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043560 · Cited by 360
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
Self-citationSILT: 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
Self-citationSkew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
Pavlo, A., Curino, C., & Zdonik, S. (2012) · Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213844 · Cited by 291
mTCP: a highly scalable user-level TCP stack for multicore systems
Jeong, E. Y., Woo, S., Jamshed, M. A., Jeong, H., Ihm, S., Han, D., & Park, K. (2014) · doi:10.5555/2616448.2616493 · Cited by 271
Self-citationScalable inference in latent variable models
Ahmed, A., Aly, M., Gonzalez, J., Narayanamurthy, S., & Smola, A. J. (2012) · Proceedings of the fifth ACM international conference on Web search and data mining · doi:10.1145/2124295.2124312 · Cited by 235
Chronos: predictable low latency for data center applications
Kapoor, R., Porter, G., Tewari, M., Voelker, G. M., & Vahdat, A. M. (2012) · ACM Symposium on Cloud Computing (SoCC) · doi:10.1145/2391229.2391238 · Cited by 213
HyperDex: a distributed, searchable key-value store
Escriva, R., Wong, B., & Sirer, E. G. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342360 · Cited by 177
Thin servers with smart pipes: designing SoC accelerators for memcached
Lim, K., Meisner, D., Saidi, A. G., Ranganathan, P., & Wenisch, T. F. (2013) · Proceedings of the 40th Annual International Symposium on Computer Architecture · doi:10.1145/2485922.2485926 · Cited by 175
MegaPipe: a new programming interface for scalable network I/O
Han, S., Marshall, S., Chun, B.-G., & Ratnasamy, S. (2012) · doi:10.5555/2387880.2387894 · Cited by 139
Scalable, high performance ethernet forwarding with CuckooSwitch
Zhou, D., Fan, B., Lim, H., et al. (2013) · doi:10.1145/2535372.2535379 · Cited by 138
Self-citationBerezecki, M., Frachtenberg, E., Paleczny, M., & Steele, K. (2011) · International Green and Sustainable Computing Conference · doi:10.1109/igcc.2011.6008565 · Cited by 91
Cited by
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
In-Memory Big Data Management and Processing: A Survey
Zhang, H., Chen, G., Ooi, B. C., Tan, K.-L., & Zhang, M. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2427795 · Cited by 414
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
Self-citationWiscKey: Separating Keys from Values in SSD-Conscious Storage
Lu, L., Pillai, T. S., Gopalakrishnan, H., Arpaci-Dusseau, A. C., & Arpaci-Dusseau, R. H. (2017) · ACM Transactions on Storage · doi:10.1145/3033273 · Cited by 301
Tactical Provenance Analysis for Endpoint Detection and Response Systems
Hassan, W. U., Bates, A., & Marino, D. (2020) · 2020 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40000.2020.00096 · Cited by 284
Metadata
- Authors
- Lim, H., Han, D., Andersen, D. G., & Kaminsky, M.
- Venue
- Figshare
- Publisher
- Figshare (United Kingdom)
- Published
- 2018-01-01
- Volume
- 2014
- Pages
- 429-444
- OpenAlex
- W982826035
- Cited by
- 361
- References
- 26
- FWCI
- 26.76
- Type
- journal article
- Language
- en
- Open access
- green
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.