The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Highly available transactions: virtues and limitations
Abstract
To minimize network latency and remain online during server failures and network partitions, many modern distributed data storage systems eschew transactional functionality, which provides strong semantic guarantees for groups of multiple operations over multiple data items. In this work, we consider the problem of providing Highly Available Transactions (HATs): transactional guarantees that do not suffer unavailability during system partitions or incur high network latency. We introduce a taxonomy of highly available systems and analyze existing ACID isolation and distributed data consistency guarantees to identify which can and cannot be achieved in HAT systems. This unifies the literature on weak transactional isolation, replica consistency, and highly available systems. We analytically and experimentally quantify the availability and performance benefits of HATs---often two to three orders of magnitude over wide-area networks---and discuss their necessary semantic compromises.
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
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447 · cited 4×
“[30] G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, et al. Dynamo: Amazon’s highly available key-value store.”
BackgroundMethodInfluentialCalifornia fault lines: understanding the causes and impact of network failures
Turner, D., Levchenko, K., Snoeren, A. C., & Savage, S. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851220 · Cited by 164 · cited 1×
“0 failures per link per year with an average annual downtime of 24–497 minutes per link per year (95th percentile at least 34 hours) [63].”
Background
Cited by
Amazon Aurora: Design Considerations for High Throughput Cloud-Native Relational Databases
Verbitski, A., Gupta, A., Saha, D., Brahmadesam, M., Gupta, K., Mittal, R., Krishnamurthy, S., Maurice, S., Kharatishvili, T., & Bao, X. (2017) · Proceedings of the 2017 ACM International Conference on Management of Data · doi:10.1145/3035918.3056101 · Cited by 290
Local-first software: you own your data, in spite of the cloud
Kleppmann, M., Wiggins, A., van Hardenberg, P., & McGranaghan, M. (2019) · Proceedings of the 2019 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software · doi:10.1145/3359591.3359737 · Cited by 112
Metadata
- Authors
- Bailis, P., Davidson, A., Fekete, A., Ghodsi, A., Hellerstein, J. M., & Stoica, I.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2013-11
- Volume
- 7
- Issue
- 3
- Pages
- 181-192
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W1601925768
- Cited by
- 204
- References
- 3
- FWCI
- 26.43
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Highly available transactions: virtues and limitations. https://app.cochat.ai/papers/10.14778/2732232.2732237
- The paper
- Bailis, P., Davidson, A., Fekete, A., Ghodsi, A., Hellerstein, J. M., & Stoica, I. (2013). Highly available transactions: virtues and limitations. Proceedings of the VLDB Endowment. https://doi.org/10.14778/2732232.2732237
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.