Abstract

Data replication, which has the benefits of improving system availability and read performance, proved to be indispensable to many database applications. In a replicated database, the one-copy serializability of transaction executions can be ensured by employing a replica control mechanism on top of the traditional concurrency control mechanism. This work contains two replica control algorithms and a read-only transaction processing algorithm. Both replica control algorithms handle multiple site, communication and partitioning failures. The replica control algorithms achieve read operation efficiency by always translating a logical read operation into one local physical read operation and by taking advantage of the locality of references. The replica control algorithms improve system availability by adapting dynamically to the system configuration and by speeding up the recovery process with the embedded recovery mechanism. While the first replica control algorithm is strictly pessimistic, the second one takes a more optimistic view. For processing read-only transactions, two consistency criteria are defined and their properties explored. Based on these findings, a read-only transaction processing algorithm is carefully designed to efficiently check the consistency of an arbitrary set of physical copies. The correctness of all algorithms are formally proved.

Department(s)

Computer Science

Second Department

Mathematics and Statistics

Third Department

Engineering Management and Systems Engineering

Comments

The first Author is a Graduate Student.This report is substantially the Ph.D. dissertation of the first author, completed Fall 1992.

Report Number

CSc-92-23

Document Type

Technical Report

Document Version

Final Version

File Type

text

Language(s)

English

Rights

© 1992 University of Missouri - Rolla, All rights reserved

Publication Date

15 September, 1992

Download

Share

 
COinS