A theory of reliability in database systems
Author:
Open Access
- 1 January 1988
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 35 (1) , 121-145
Abstract
Reliable concurrent processing of transactions in a database system is examined. Since serializability, the conventional concurrency control correctness criterion, is not adequate in the presence of common failures, another theory of correctness is proposed, involving the concepts ofcommit serializability, recoverability,andresiliency.Keywords
This publication has 15 references indexed in Scilit:
- An algorithm for concurrency control and recovery in replicated distributed databasesACM Transactions on Database Systems, 1984
- Principles of transaction-oriented database recoveryACM Computing Surveys, 1983
- Multiversion concurrency control—theory and algorithmsACM Transactions on Database Systems, 1983
- Achieving robustness in distributed database systemsACM Transactions on Database Systems, 1983
- Guardians and Actions: Linguistic Support for Robust, Distributed ProgramsACM Transactions on Programming Languages and Systems, 1983
- The serializability of concurrent database updatesJournal of the ACM, 1979
- Formal Aspects of Serializability in Database Concurrency ControlIEEE Transactions on Software Engineering, 1979
- Notes on data base operating systems1978
- Physical integrity in a large segmented databaseACM Transactions on Database Systems, 1977
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976