The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Concurrency Control in Distributed Database Systems
Abstract
article Free Access Share on Concurrency Control in Distributed Database Systems Authors: Philip A. Bernstein Computer Corporation of America, Cambridge, Massachusetts Computer Corporation of America, Cambridge, MassachusettsView Profile , Nathan Goodman Computer Corporation of America, Cambridge, Massachusetts Computer Corporation of America, Cambridge, MassachusettsView Profile Authors Info & Claims ACM Computing SurveysVolume 13Issue 2June 1981 pp 185–221https://doi.org/10.1145/356842.356846Online:01 June 1981Publication History 796citation11,051DownloadsMetricsTotal Citations796Total Downloads11,051Last 12 Months568Last 6 weeks91 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
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
Time, clocks, and the ordering of events in a distributed system
Massachusetts Computer Associates, I., & Lamport, L. (2019) · Concurrency: the Works of Leslie Lamport · doi:10.1145/3335772.3335934 · Cited by 1,979
The notions of consistency and predicate locks in a database system
Eswaran, K. P., Gray, J. N., Lorie, R. A., & Traiger, I. L. (1976) · Communications of the ACM · doi:10.1145/360363.360369 · Cited by 1,956
Notes on data base operating systems
Gray, J. N. (1978) · Lecture Notes in Computer Science · doi:10.1007/3-540-08755-9_9 · Cited by 1,656
Monitors: an operating system structuring concept
Hoare, C. A. R. (1974) · Communications of the ACM · doi:10.1145/355620.361161 · Cited by 1,496
On optimistic methods for concurrency control
Kung, H. T., & Robinson, J. T. (1981) · ACM Transactions on Database Systems · doi:10.1145/319566.319567 · Cited by 1,439
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 serializability of concurrent database updates
Papadimitriou, C. H. (1979) · Journal of the ACM · doi:10.1145/322154.322158 · Cited by 1,021
Hierarchical ordering of sequential processes
Dijkstra, E. (1971) · Acta Informatica · doi:10.1007/bf00289519 · Cited by 797
Cited by
The interdisciplinary study of coordination
Malone, T. W., & Crowston, K. (1994) · ACM Computing Surveys · doi:10.1145/174666.174668 · Cited by 3,504
Jefferson, D. R. (1985) · ACM Transactions on Programming Languages and Systems · doi:10.1145/3916.3988 · Cited by 2,397
Making Smart Contracts Smarter
Luu, L., Chu, D.-H., Olickel, H., Saxena, P., & Hobor, A. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978309 · Cited by 2,249
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
Principles of transaction-oriented database recovery
Haerder, T., & Reuter, A. (1983) · ACM Computing Surveys · doi:10.1145/289.291 · Cited by 1,217
Beyond the chalkboard: computer support for collaboration and problem solving in meetings
Stefik, M., Foster, G., Bobrow, D. G., Kahn, K., Lanning, S., & Suchman, L. (1987) · Communications of the ACM · doi:10.1145/7885.7887 · Cited by 1,031
Reliable communication in the presence of failures
Birman, K. P., & Joseph, T. A. (1987) · ACM Transactions on Computer Systems · doi:10.1145/7351.7478 · Cited by 997
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
A framework for analysis of data quality research
Wang, R. Y., Storey, V. C., & Firth, C. P. (1995) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.404034 · Cited by 685
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
Modeling Data and Process Quality in Multi-Input, Multi-Output Information Systems
Ballou, D. P., & Pazer, H. L. (1985) · Management Science · doi:10.1287/mnsc.31.2.150 · Cited by 545
Concepts and Notations for Concurrent Programming
Andrews, G. R., & Schneider, F. B. (1983) · ACM Computing Surveys · doi:10.1145/356901.356903 · Cited by 520
Multiversion concurrency control—theory and algorithms
Bernstein, P. A., & Goodman, N. (1983) · ACM Transactions on Database Systems · doi:10.1145/319996.319998 · Cited by 497
Self-citationLarge-scale incremental processing using distributed transactions and notifications
Peng, D. N., & Dabek, F. (2010) · doi:10.5555/1924943.1924961 · Cited by 402
Concurrency control performance modeling: alternatives and implications
Agrawal, R., Carey, M. J., & Livny, M. (1987) · ACM Transactions on Database Systems · doi:10.1145/32204.32220 · Cited by 393
Consistent and durable data structures for non-volatile byte-addressable memory
Venkataraman, S., Tolia, N. H., Ranganathan, P., & Campbell, R. H. (2011) · doi:10.5555/1960475.1960480 · Cited by 356
Understanding a Revolutionary and Flawed Grand Experiment in Blockchain: The DAO Attack
Mehar, M. I., Shier, C. L., Giambattista, A., Gong, E., Fletcher, G., Sanayhie, R., Kim, H. M., & Laskowski, M. (2019) · Journal of Cases on Information Technology · doi:10.4018/jcit.2019010102 · Cited by 347
Design and implementation of the LogicBlox system
Aref, M., ten Cate, B., Green, T. J., Kimelfeld, B., Olteanu, D., Pasalic, E., Veldhuizen, T. L., & Washburn, G. (2015) · Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2742796 · Cited by 233
“Row-level locking [6] is a bottleneck when α 1: since most transactions have items in common, they quickly encounter lock conflicts and are put to sleep.”
BackgroundSerializable isolation for snapshot databases
Cahill, M. J., Röhm, U., & Fekete, A. D. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376690 · Cited by 120
Analytic Queueing Network Models for Parallel Processing of Task Systems
Thomasian, & Bay (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676712 · Cited by 104
Metadata
- Authors
- Bernstein, P. A., & Goodman, N.
- Venue
- ACM Computing Surveys
- Published
- 1981-06
- Volume
- 13
- Issue
- 2
- Pages
- 185-221
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W1993505169
- Cited by
- 1,186
- References
- 21
- FWCI
- 49.29
- 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
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.