Enhancing concurrency and availability for database systems
Wai Chee Ada Fu · Summit (Simon Fraser University) · 1992
This thesis consists of two parts.In Part I, we study concurrency control of distributed database systems with emphasis on availability, and in Part 11, we study semantically-based concurrency control for a centralized database system.In Part I, we concentrate on concurrency control schemes for replicated database systems.We start with a slight generalization of the virtual partition protocol by El Abbadi and Toueg, which we call Generalized Partition Protocol (GVP).We then show some existing protocols and some new ones that are members of the GVP family.We introduce a mathematical structure, called bi-coterie, to investigate read quorum and write quorum sets.Next, we introduce the Transaction Replication Scheme.Transaction replication eliminates the need for locking remote data as required in some conventional concurrency control schemes for distributed database systems.In Part I1 of this thesis, as an example of a semantically-based concurrency control and a proof technique for such schemes, we study nested transaction accessing B-trees.We employ the 110 automaton model introduced by an MIT research group in the specification and correctness proof of this fairly complicated concurrency control scheme.details of correcting scripts and text processing of the thesis.It has been most enjoyable to work with Tiko because he encourages search for truth and beauty in life; besides, he likes jokes and puzzles.I'd like to thank Prof. Woshun Luk for his encouragement on the writing of the thesis and the publication of a paper from it.Woshun is also one of the most friendly professors I know who cares and acts for the right cause.My heart-felt thanks to the external examiner, Prof. Vasos Hadzilacos, for his patience in diciphering confusing statements in the original version of this thesis, and for providing me with valuable and thoughtful comments.