Modular concurrency control and failure recovery

Journal Article · Mon Feb 01 00:00:00 EST 1988 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/12.2144· OSTI ID:5288949

Sha, L; Lehoczky, J P; Jensen, E D

This paper presents an approach to concurrency control based on the decomposition of both the database and the individual transactions. This approach is a generalization of serializability theory in that the set of permissible transaction schedules contains all the serializable schedules. In addition to providing a higher degree of concurrency than that provided by serializability theory, this approach retains three important properties associated with serializability: the consistency of the database is preserved, the individual transactions are executed correctly, and the concurrency control approach is modular, a concept formalized in this paper. The associated failure recovery procedure is also presented as is the concept of failure safety.

• Research Organization: Dept. of Computer Science, Carnegie-Mellon Univ., Pittsburgh, PA 15213 (USA)
• OSTI ID: 5288949
• Journal Information: IEEE Trans. Comput.; (United States), Vol. 37:2
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
SUPERCOMPUTERS
CONTROL THEORY
DATA BASE MANAGEMENT
COMPUTER ARCHITECTURE
PARALLEL PROCESSING
SCHEDULES
SYSTEM FAILURE ANALYSIS
COMPUTERS
DIGITAL COMPUTERS
MANAGEMENT
PROGRAMMING
SYSTEMS ANALYSIS
990210* - Supercomputers- (1987-1989)