The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Calvin: fast distributed transactions for partitioned database systems
Abstract
Many distributed storage systems achieve high data access throughput via partitioning and replication, each system with its own advantages and tradeoffs. In order to achieve high scalability, however, today's systems generally reduce transactional support, disallowing single transactions from spanning multiple partitions. Calvin is a practical transaction scheduling and data replication layer that uses a deterministic ordering guarantee to significantly reduce the normally prohibitive contention costs associated with distributed transactions. Unlike previous deterministic database system prototypes, Calvin supports disk-based storage, scales near-linearly on a cluster of commodity machines, and has no single point of failure. By replicating transaction inputs rather than effects, Calvin is also able to support multiple consistency levels---including Paxos-based strong consistency across geographically distant replicas---at no cost to transactional throughput.
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
Bigtable: A Distributed Storage System for Structured Data
Chang, F., Dean, J., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., & Gruber, R. E. (2008) · ACM Transactions on Computer Systems · doi:10.1145/1365815.1365816 · Cited by 3,460
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447 · cited 2×
“Systems such as Dynamo, SimpleDB, Cassandra, Voldemort, Riak, and PNUTS all lessen the consistency guarantees for replicated data [13, 1, 17, 2, 3, 12].”
BackgroundLamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
ZooKeeper: wait-free coordination for internet-scale systems
Hunt, P. G., Konar, M., Junqueira, F., & Reed, B. C. (2010) · USENIX Annual Technical Conference · Cited by 1,968
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
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
Gilbert, S., & Lynch, N. (2002) · ACM SIGACT News · doi:10.1145/564585.564601 · Cited by 1,727
Lamport, L. (2001) · Cited by 1,325
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
Megastore: Providing Scalable, Highly Available Storage for Interactive Services
Baker, J. D., Bond, C. T., Corbett, J. C., Furman, J. J., Khorlin, A., Larson, J. A., Leon, J.-M., Li, Y., Lloyd, A., & Yushprakh, V. (2011) · Cited by 645
The 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
Self-citationTransaction management in the R* distributed database management system
Mohan, C., Lindsay, B., & Obermarck, R. (1986) · ACM Transactions on Database Systems · doi:10.1145/7239.7266 · Cited by 359
CouchDB: The Definitive Guide: Time to Relax
Anderson, J., Lehnardt, J., & Slater, N. (2010) · Cited by 288
Cassandra: structured storage system on a P2P network
Lakshman, A., & Malik, P. (2009) · Proceedings of the 28th ACM symposium on Principles of distributed computing · doi:10.1145/1582716.1582722 · Cited by 231
The Definitive Guide to MongoDB
Plugge, E., Membrey, P., & Hawkins, T. (2010) · Apress eBooks · doi:10.1007/978-1-4302-3052-6 · Cited by 213
Anderson, J., Lehnardt, J., & Slater, N. (2010) · Cited by 177
Using Paxos to build a scalable, consistent, and highly available datastore
Rao, J., Shekita, E. J., & Tata, S. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/1938545.1938549 · Cited by 152
Low overhead concurrency control for partitioned main memory databases
Jones, E. P. C., Abadi, D. J., & Madden, S. R. (2010) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/1807167.1807233 · Cited by 146
Self-citationHyder - A Transactional Record Manager for Shared Flash
Bernstein, P. A., Reid, C. W., & Das, S. (2011) · Cited by 127
Unbundling Transaction Services in the CloudPreprint
Lomet, D., Fekete, A. D., Weikum, G., & Zwilling, M. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0909.1768 · Cited by 81
Extreme scale with full SQL language support in microsoft SQL Azure
Campbell, D. G., Kakivaya, G., & Ellis, N. (2010) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1807167.1807280 · Cited by 70
Cited by
Untangling Blockchain: A Data Processing View of Blockchain Systems
Dinh, T. T. A., Liu, R., Zhang, M., Chen, G., Ooi, B. C., & Wang, J. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2781227 · Cited by 1,186
BLOCKBENCH: A Framework for Analyzing Private Blockchains
Dinh, T. T. A., Wang, J., Chen, G., Liu, R., Ooi, B. C., & Tan, K.-L. (2017) · Proceedings of the 2017 ACM International Conference on Management of Data · doi:10.1145/3035918.3064033 · Cited by 814
Spanner: Google's globally-distributed database
Corbett, J. C., Dean, J. B., Epstein, M., Fikes, A., Frost, C., Furman, J. J., Ghemawat, S., Gubarev, A., Heiser, C., Hochschild, P., et al. (2012) · doi:10.5555/2387880.2387905 · Cited by 807
Spanner: Google’s Globally Distributed Database
Corbett, J. C., Dean, J., Epstein, M., Fikes, A., Frost, C., Furman, J. J., Ghemawat, S., Gubarev, A., Heiser, C., Hochschild, P., et al. (2013) · ACM Transactions on Computer Systems · doi:10.1145/2491245 · Cited by 729
CockroachDB: The Resilient Geo-Distributed SQL Database
Taft, R., Sharif, I., Matei, A., VanBenschoten, N., Lewis, J., Grieger, T., Niemi, K., Woods, A., Birzin, A., Poss, R., et al. (2020) · Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data · doi:10.1145/3318464.3386134 · Cited by 254
Metadata
- Authors
- Thomson, A., Diamond, T., Weng, S.-C., Ren, K., Shao, P., & Abadi, D. J.
- Venue
- Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
- Publisher
- ACM
- Published
- 2012-05-20
- Pages
- 1-12
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2060440895
- Cited by
- 533
- References
- 20
- FWCI
- 33.40
- 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.