The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Principles of transaction-oriented database recovery
Open accessAbstract
In this paper, a terminological framework is provided for describing different transactionoriented recovery schemes for database systems in a conceptual rather than an implementation-dependent way.By introducing the terms materialized database, propagation strategy, and checkpoint, we obtain a means for classifying arbitrary implementations from a unified viewpoint.This is complemented by a classification scheme for logging techniques, which are precisely defined by using the other terms.It is shown that these criteria are related to all relevant questions such as speed and scope of recovery and amount of redundant information required.The primary purpose of this paper, however, is to establish an adequate and precise terminology for a topic in which the confusion of concepts and implementational aspects still imposes a lot of problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Introduction to Database Systems
(2006) · Foundations of Database Design · doi:10.1201/9781420003345.ch1 · Cited by 3,521
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
Concurrency Control in Distributed Database Systems
Bernstein, P. A., & Goodman, N. (1981) · ACM Computing Surveys · doi:10.1145/356842.356846 · Cited by 1,186
The design and implementation of INGRES
Stonebraker, M., Held, G., Wong, E., & Kreps, P. (1976) · ACM Transactions on Database Systems · doi:10.1145/320473.320476 · Cited by 886
The transaction concept: virtues and limitations
Gray, J. (1988) · Cited by 602
Relational database: a practical foundation for productivity
Codd, E. F. (1982) · Communications of the ACM · doi:10.1145/358396.358400 · Cited by 351
A history and evaluation of System R
Chamberlin, D. D., Astrahan, M. M., Blasgen, M. W., Gray, J. N., King, W. F., Lindsay, B. G., Lorie, R., Mehl, J. W., Price, T. G., Putzolu, F., et al. (1981) · Communications of the ACM · doi:10.1145/358769.358784 · Cited by 273
Data structures and accessing in data-base systems, I: Evolution of information systems
Senko, M. E., Altman, E. B., Astrahan, M. M., & Fehder, P. L. (1973) · IBM Systems Journal · doi:10.1147/sj.121.0030 · Cited by 171
Cited by
Query evaluation techniques for large databases
Graefe, G. (1993) · ACM Computing Surveys · doi:10.1145/152610.152611 · Cited by 1,262
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
A high-throughput infrastructure for density functional theory calculations
Jain, A., Hautier, G., Moore, C. J., Ping Ong, S., Fischer, C. C., Mueller, T., Persson, K. A., & Ceder, G. (2011) · Computational Materials Science · doi:10.1016/j.commatsci.2011.02.023 · Cited by 1,041
(2002) · Choice Reviews Online · doi:10.5860/choice.39-2844 · Cited by 613
The case for RAMClouds: scalable high-performance storage entirely in DRAM
Ousterhout, J., Agrawal, P., Erickson, D., Kozyrakis, C., Leverich, J., Mazières, D., Mitra, S., Narayanan, A., Parulkar, G., Rosenblum, M., et al. (2010) · ACM SIGOPS Operating Systems Review · doi:10.1145/1713254.1713276 · Cited by 447
Metadata
- Authors
- Haerder, T., & Reuter, A.
- Venue
- ACM Computing Surveys
- Published
- 1983-12-02
- Volume
- 15
- Issue
- 4
- Pages
- 287-317
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2010042648
- Cited by
- 1,217
- References
- 13
- FWCI
- 14.64
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Principles of transaction-oriented database recovery. https://app.cochat.ai/papers/10.1145/289.291
- The paper
- Haerder, T., & Reuter, A. (1983). Principles of transaction-oriented database recovery. ACM Computing Surveys. https://doi.org/10.1145/289.291
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.