The DOI matches its Crossref record; 99 of the 99 references it cites were found in a registry or an index.
Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery
Abstract
Transactional Information Systems is the long-awaited, comprehensive work from leading scientists in the transaction processing field. Weikum and Vossen begin with a broad look at the role of transactional technology in today's economic and scientific endeavors, then delve into critical issues faced by all practitioners, presenting today's most effective techniques for controlling concurrent access by multiple clients, recovering from system failures, and coordinating distributed transactions. The authors emphasize formal models that are easily applied across fields, that promise to remain valid as current technologies evolve, and that lend themselves to generalization and extension in the development of new classes of network-centric, functionally rich applications. This book's purpose and achievement is the presentation of the foundations of transactional systems as well as the practical aspects of the field what will help you meet today's challenges. * Provides the most advanced coverage of the topic available anywhere--along with the database background required for you to make full use of this material. * Explores transaction processing both generically as a broadly applicable set of information technology practices and specifically as a group of techniques for meeting the goals of your enterprise. * Contains information essential to developers of Web-based e-Commerce functionality--and a wide range of more traditional applications. * Details the algorithms underlying core transaction processing functionality. Table of Contents PART ONE - BACKGROUND AND MOTIVATION Chapter 1 What Is It All About? Chapter 2 Computational Models PART TWO - CONCURRENCY CONTROL Chapter 3 Concurrency Control: Notions of Correctness for the Page Model Chapter 4 Concurrency Control Algorithms Chapter 5 Multiversion Concurrency Control Chapter 6 Concurrency Control on Objects: Notions of Correctness Chapter 7 Concurrency Control Algorithms on Objects Chapter 8 Concurrency Control on Relational Databases Chapter 9 Concurrency Control on Search Structures Chapter 10 Implementation and Pragmatic Issues PART THREE - RECOVERY Chapter 11 Transaction Recovery Chapter 12 Crash Recovery: Notion of Correctness Chapter 13 Page Model Crash Recovery Algorithms Chapter 14 Object Model Crash Recovery Chapter 15 Special Issues of Recovery Chapter 16 Media Recovery Chapter 17 Application Recovery PART FOUR - COORDINATION OF DISTRIBUTED TRANSACTIONS Chapter 18 Distributed Concurrency Control Chapter 19 Distributed Transaction Recovery PART FIVE - APPLICATIONS AND FUTURE PERSPECTIVES Chapter 20 What Is Next?
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
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
Statecharts: a visual formalism for complex systems
Harel, D. (1987) · Science of Computer Programming · doi:10.1016/0167-6423(87)90035-9 · Cited by 6,751
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Fundamentals of Database Systems
Elmasri, R. A., & Navathe, S. B. (1989) · Cited by 3,141
Transaction Processing: Concepts and Techniques
Gray, J., & Reuter, A. (1992) · Cited by 3,000
Federated database systems for managing distributed, heterogeneous, and autonomous databases
Sheth, A. P., & Larson, J. A. (1990) · ACM Computing Surveys · doi:10.1145/96602.96604 · Cited by 2,476
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · ACM SIGMOD Record · doi:10.1145/971701.50214 · Cited by 2,281
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
Epidemic algorithms for replicated database maintenance
Demers, A., Greene, D., Hauser, C., Irish, W., & Larson, J. (1987) · Proceedings of the sixth annual ACM Symposium on Principles of distributed computing - PODC '87 · doi:10.1145/41840.41841 · Cited by 1,673
Cited by
Business Process Management: A Comprehensive Survey
van der Aalst, W. M. P. (2013) · ISRN Software Engineering · doi:10.1155/2013/507984 · Cited by 828
Transactional storage for geo-replicated systems
Sovran, Y., Power, R., Aguilera, M. K., & Li, J. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043592 · Cited by 390
F1: a distributed SQL database that scales
Shute, J., Vingralek, R., Samwel, B., Handy, B., Whipkey, C., Rollins, E., Oancea, M., Littlefield, K., Menestrina, D., Ellner, S., et al. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2536222.2536232 · Cited by 258
Serializable 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
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 2002-01-01
- Volume
- 39
- Issue
- 05
- Pages
- 39-2844-39-2844
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W2018464987
- Cited by
- 613
- References
- 99
- Type
- book review
- 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: Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery. https://app.cochat.ai/papers/10.5860/choice.39-2844
- The paper
- Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery. (2002). Choice Reviews Online. https://doi.org/10.5860/choice.39-2844
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.