The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Amazon Aurora: Design Considerations for High Throughput Cloud-Native Relational Databases
Abstract
Amazon Aurora is a relational database service for OLTP workloads offered as part of Amazon Web Services (AWS). In this paper, we describe the architecture of Aurora and the design considerations leading to that architecture. We believe the central constraint in high throughput data processing has moved from compute and storage to the network. Aurora brings a novel architecture to the relational database to address this constraint, most notably by pushing redo processing to a multi-tenant scale-out storage service, purpose-built for Aurora. We describe how doing so not only reduces network traffic, but also allows for fast crash recovery, failovers to replicas without loss of data, and fault-tolerant, self-healing storage. We then describe how Aurora achieves consensus on durable state across numerous storage nodes using an efficient asynchronous scheme, avoiding expensive and chatty recovery protocols. Finally, having operated Aurora as a production service for over 18 months, we share the lessons we have learnt from our customers on what modern cloud applications expect from databases.
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
Dean, J., & Barroso, L. A. (2013) · Communications of the ACM · doi:10.1145/2408776.2408794 · Cited by 1,852 · cited 1×
“We observe that a failure in durability can be modeled as a long-lasting availability event, and an availability event can be modeled as a long-lasting performance variation – a well-designed system can treat each of these uniformly [42].”
BackgroundBrewer'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
Weighted voting for replicated data
Gifford, D. K. (1979) · Proceedings of the seventh symposium on Operating systems principles - SOSP '79 · doi:10.1145/800215.806583 · Cited by 1,323
The design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146943 · Cited by 1,268
MapReduce: a flexible data processing tool
Dean, J., & Ghemawat, S. (2010) · Communications of the ACM · doi:10.1145/1629175.1629198 · Cited by 1,182
Mohan, C., Haderle, D., Lindsay, B., Pirahesh, H., & Schwarz, P. (1992) · ACM Transactions on Database Systems · doi:10.1145/128765.128770 · Cited by 1,043
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
A critique of ANSI SQL isolation levels
Berenson, H., Bernstein, P., Gray, J., Melton, J., O'Neil, E., & O'Neil, P. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223785 · Cited by 856
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
Windows Azure Storage: a highly available cloud storage service with strong consistency
Calder, B., Wang, J., Ogus, A., Nilakantan, N., Skjolsvold, A., McKelvie, S., Xu, Y., Srivastav, S., Wu, J., Simitci, H., et al. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043571 · Cited by 796
Saito, Y., & Shapiro, M. (2005) · ACM Computing Surveys · doi:10.1145/1057977.1057980 · Cited by 739
Consistency in a partitioned network: a survey
Davidson, S. B., Garcia-Molina, H., & Skeen, D. (1985) · ACM Computing Surveys · doi:10.1145/5505.5508 · Cited by 550
Chain replication for supporting high throughput and availability
van Renesse, R., & Schneider, F. B. (2004) · Operating Systems Design and Implementation · Cited by 495
Consistency Tradeoffs in Modern Distributed Database System Design: CAP is Only Part of the Story
Abadi, D. J. (2012) · Computer · doi:10.1109/mc.2012.33 · Cited by 471
Transaction 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
Architecture of a Database System
Hellerstein, J. M., Stonebraker, M., & Hamilton, J. (2007) · Foundations and Trends in Databases · doi:10.1561/1900000002 · Cited by 245
Stonebraker, M. R., & Weisberg, A. (2013) · Cited by 221
Highly available transactions: virtues and limitations
Bailis, P., Davidson, A., Fekete, A., Ghodsi, A., Hellerstein, J. M., & Stoica, I. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2732232.2732237 · Cited by 204
Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed Transactions
Adya, A., & Liskov, B. H. (1999) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 183
Hyder - A Transactional Record Manager for Shared Flash
Bernstein, P. A., Reid, C. W., & Das, S. (2011) · Cited by 127
Scalable atomic visibility with RAMP transactions
Bailis, P. D., Fekete, A. D., Hellerstein, J. M., Ghodsi, A., & Stoica, I. G. (2014) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2588555.2588562 · Cited by 97
Information storage in a decentralized computer system
Gifford, D. K. (1981) · CERN Document Server (European Organization for Nuclear Research) · Cited by 61
Rethinking eventual consistency
Bernstein, P. A., & Das, S. (2013) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2463676.2465339 · Cited by 49
Cited by
(2021) · doi:10.1145/3448016.3457550 · Cited by 416
Delta lake: high-performance ACID table storage over cloud object stores
Armbrust, M., Das, T., Sun, L., Yavuz, B., Zhu, S., Murthy, M., Torres, J., van Hovell, H., Ionescu, A., Łuszczak, A., et al. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3415478.3415560 · Cited by 257
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
- Verbitski, A., Gupta, A., Saha, D., Brahmadesam, M., Gupta, K., Mittal, R., Krishnamurthy, S., Maurice, S., Kharatishvili, T., & Bao, X.
- Venue
- Proceedings of the 2017 ACM International Conference on Management of Data
- Publisher
- ACM
- Published
- 2017-05-09
- Pages
- 1041-1052
- OpenAlex
- W2612759782
- Cited by
- 290
- References
- 23
- FWCI
- 13.81
- 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.