Enhancing concurrency and availability for database systems / by Wai Chee Ada Fu.

205 Pages·2005·3.67 MB·English

Enhancing Concurrency and Availability for Database Systems
by
Wai Chee Ada Fu
B.Sc., Chinese University of Hong Kong, 1983
M.Sc., Simon Fraser University, 1985
A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF
THE REQUIREMENTS FOR THE DEGREE OF
DOCTOR OF PHILOSOPHY
in the School
of
Computing Science
O Wai Chee Ada Fu 1990
SIMON FRASER UNIVERSITY
April 1990
All rights resewed. This thesis may not be
reproduced in whole or in part, by photocopy
or other means, without the permission of the author.
Approval
Name: Wai Chee Ada Fu
Degree: Doctor of Philosophy
Title of Thesis: Enhancing Concurrency and Availability for Database Systems
Examining Committee:
Dr. Joseph G.P eters, Chairman
Dr. Tiko Kameda
Senior Supervisor
Dr. Stella Atkins
Supewjsor
~moSh1.&5uk
Supervisor
Examiner
Dr. Vassoi Badzilkos
Department of Computer Science
University of Toronto
External Examiner
dm&
17%
Date Approved
PARTIAL COPYRIGHT LICENSE
I hereby grant to Sfmon Fraser Universlty the right to lend
my thesis, proJect or extended essay (the t i t l e of which is shown below)
to users of the Simon Fraser University Library, and to make partial or
single copies only for such users or In response to a request from the
library of any other university, or other educational institution, on
its own behalf or for one of Its users. t further agree that permission
for multiple copying of thls work for scholarly purposes may be granted
by me or the Dean of Graduate Studies. It is understood that copying
or publication of this work for financlat gain shall not be allowed
without my written permission.
Title of Thes i s/Project/Extended Essay
Enhancing Concurrency and Availability for Database Systems.
Author:
(s ignature)
Ms. Ada Fu
March 28. 1990
(date)
Abstract
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.
Acknowledgements
I'd like to thank my supervisor, Prof. Tiko Kameda for keeping my spirits up during some of
my weary moments. In addition to being a superb scholar in aiding me with the technical contents
of the thesis, Prof. Kameda has helped me all the way from the search for a thesis topic to the
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. Thanks are also due to the other committee
members, Prof. Stella Akins, Prof. Jai-wai Han, and Prof. Slawomir Pilarski for their support in the
thesis research.
I am most grateful to my good friends Frank Tong and Mirni Kao for helping me to finish the
final draft. My kind friend Sanjeev Mahajan has been one of my constant sources of intellectual
and ethical stimulations. Thanks to all my friends for filling my life with happy memories, so that I
see meaningful things other than the thesis. Thanks to Kersti and the office of the School of
Computing Science for helping me to meet the official requirements.
My husband Steven has been almost the sole collector of my complaints and his concern and
care were alwajs available when I needed them. All of my worthwhile accomplishments, if any,
have been motivated by the philosophy of my parents and my family, who, I am lucky to be able to
-
say, are the greatest persons I know.
Finally, thanks to Simon Fraser University, Advanced Systems Foundation of British
Columbia, and the Natural Sciences and Engineering Research Council of Canada for providing me
with the environment and means to pursue my research.
TABLE OF CONTENTS
.............................................................................................................................................
Approval ii
...............................................................................................................................................
Abstract iii
Acknowledgments ............................................................................................................................ iv
Table of Contents ............................................................................................................................. v
List of Figures .................................................................................................................................. ix
CHAPTER 1: INTRODUCT .I.......O.............N............ .......
..............................................................
CHAPTER 2: THEORY OF SERIALIZABILITY
...................................................................................................
2.1 CONCURRENCY CONTROL
.......................................
2.2 SERI.4LIZABILITY IN A SINGLE-SITE DATABASE SYSTEM
................................................................................................
2.2.1 Read-From Graphs and DITS
............................................................
2.2.2 Serialization under Conflict-Preserving Constraints
2.3 SERIALIZABILITY IN A REPLICATED DATABASE SYSTEM ........................................
..............................................................................................
CHAPTER 3: RELATED WORK
...................................................................................................
3.1 CONCURRENCY CONTROL
..........................................................................................................
3.1.1 2-Phase Locking (2PL)
.....................................................................................................
3.1.2 Timestamp Ordering (TO)
.................................................................................
3.2 COPING WITH FAILURES: A REVIEW
CHAPTER 4: A FAMILY OF VIRTUAL PARTITION PROTOCOLS ......................
4.1 INTRODUCTION ...................................................................................................................
. 4.2 REVIEW OF VIRTUAL PARTITION PROTOCOL (VP) ...........................................
4.3 THE GENERALIZED VIRTUAL PARTITION PROTOCOL (GVP) ......................
................................................................................
4.4 CORRECTNESS PROOF FOR GVP
.......................................................................................................
4.5 OPTIONS UNDER GVP
............................................... ................................
4.6 MEMBERS OF THE GVP FAMILY
;
4.6.1 The Vote Assignment Protocol (VAP) ........................................................................
4.6.2 The Virtual Partition Protocol (VP) .............................................................................
4.6.3 The Small Partition Protocol (SP) ................................................................................
4.6.4 The Finite Projective Plane Based Protocol (FP) ......................................................
4.7 IMPLEMENTATION DETAILS ........................................................................................
4.7.1 Logical Read ......................................................................................................................
4.7.2 Logical Write .....................................................................................................................
.............................................................................................
4.7.3 View-Update Transactions
4.8 REVIEW OF DYNAMIC QUORUM ADJUSTMENT (DQA) ...................................
4.8.1 Relation between Levels and Views .............................................................................
4.8.2 Improvement on DQA .....................................................................................................
4.8.3 Comparison of GVP and DQA ......................................................................................
4.8.4 Combining GVP and DQA .............................................................................................
4.8.5 Correctness of the GVP-DQA Combination ..............................................................
4.9 SEQUENCE VECTORS AND GLOBAL VIEWS .........................................................
4.9.1 Total Ordering of Sequence Vectors ............................................................................
4.10 UNIFYING GVP AND DQA ..............................................................................................
4.10.1 Common Features of GVP and DQA ........................................................................
4.10.2 Paradigm for General Quorum-Based Protocols .....................................................
4.1 1 CONCLUDING REMARKS ..............................................................................................
CHAPTER 5: BICOTERIES ...................................................................................................
5.1 MOTIVATION ........................................................................................................................
5.2 DEFINITION AND PROPERTIES OF BICOTERIES ..................................................
5.2.1 Modeling by Boolean Functions ...................................................................................
5.3 FPP BICOTERIES ..................................................................................................................
5.4 VOTE ASSIGNMENTS ........................................................................................................
........................................................................................
5.5 RECTANGULAR BICOTERIES
5.6 COUNTING BICOTERIES AND VOTE ASSIGNMENTS ........................................
5.7 COMPLEXITY OF RECOGNIZING BICOTEFUE DOMINATION .........................
5.8 APPLICATION TO GVP ......................................................................................................
CHAPTER 6: THE TRANSACTION REPLICATION SCHEME (TRS) .........
6.1 INTRODUCTION ...................................................................................................................
6.2 THE NETWORK MODEL ...................................................................................................
6.3 THE DATA AND TRANSACTION MODELS ..............................................................
6.3.1 Data Model: Two Types of Fully Replicated Data ...................................................
6.3.2 Transaction Model: Local Transactions and Global Transactions ........................
6.4 SYNCHRONOUS BROADCASTING SCHEME ...........................................................
6.4.1 Basic Protocol ....................................................................................................................
6.4.1.1 Broadcasting ................................................................................................................
6.4.1.2 Transaction Scheduling and Execution ..................................................................
............................
6.4.2 Timestamp Ordering Algorithm without Transaction Abortion
6.4.3 Large Transactions and Long Transactions ................................................................
.....................................................................................................
6.4.3.1 Large Transactions
6.4.3.2 Handling Overdue Global Transactions .................................................................
6.5 CORRECTNESS OF THE PROPOSED SCHEME ........................................................
6.6 COMMENTS ON THE SCHEME ......................................................................................
CHAPTER 7: CONCURRENT NESTED TRANSACTIONS ACCESSING
B-TREES .................................................................................................................................
7.1 INTRODUCTION ...................................................................................................................
7.2 THE MODEL ...........................................................................................................................
7.2.1 Nested Transaction ...........................................................................................................
7.2.2 VO Automaton Model .....................................................................................................
7.2.3 Nested Transaction Systems ..........................................................................................
7.3 SERIAL SYSTEM ..................................................................................................................
7.3.1 Transactions .......................................................................................................................
7.3.2 Basic Objects .....................................................................................................................
7.3.3 Serial Scheduler ................................................................................................................
7.3.4 Serial Systems and Serial Schedules ............................................................................
7.4 FLAT FILE LOCKING (FFL) SYSTEM ..........................................................................
7.4.1 FFL Objects .......................................................................................................................
7.4.2 Generic Scheduler .............................................................................................................
7.4.3 FFL Systems ......................................................................................................................
7.5 B-TREE LOCKING SYSTEM ............................................................................................
7.5.1 B-link-tree ..........................................................................................................................
7 S.2 B-link-tree Algorithm ......................................................................................................
7.5.2.1 Concurrent Searches and Insertions ........................................................................
7.5.2.2 Concurrent Deletion ...................................................................................................
7.5.3 Automaton Model of the B-link Tree Algorithm ......................................................
7.5.3.1 Transactions .................................................................................................................
7.5.3.2 Read Access Manager ................................................................................................
7.5.3.3 Write Access Manager ...............................................................................................
7.5.3.4 B-tree Locking Objects (Vertex Managers) ..........................................................
7.5.3.4.1 Transitions of VM(v) ...........................................................................................
vii
7 S.3.4.2 Splitting ...................................................................................................................
.....................................................................................................
7.5.3.4.3 Vertex Merging
7.5.3.5 Scheduler ......................................................................................................................
7.6 PROOFS OF STRONGLY- SERIAL CORRECTNESS .................................................
7.6.1 Strong1y -Serially Correct Schedules ............................................................................
7.6.2 Strongly-Serial Correctness of FFL System ...............................................................
7.6.3 St rongly-Serial Correctness of BTL System ............................. . ...........................
........................................................................................................................
7.7 CONCLuSIoN
CHAPTER 8: CONCLUSIONS .............................................................................................
REFERENCES .................................................................................................................................
viii
LIST OF FIGURES
.................................
Figure 6.1: Transaction broadcast and multiple versions of private data
Figure 6.2: Preprocessing .............................................i ..............................................................
...............................................................................................
Figure 6.3: Overdue Transactions
.....................................................................................
Figure 6.4: Long Overdue Transactions
.....................................................................................
Figure 6.5: Type 2 Global Transactions
Figure 7.1: Part of a link tree ....................................................................................................
..................................................................................
Figure 7.2: Procedure for a Search (Read)
..................................................................................................
Figure 7.3: Procedure for Write
...............................................................................................
Figure 7.4: Three cases in writing
...................................................................
Figure 7.5: Procedure for the compression process
Figure 7.6: (a) Transaction tree of a BTL system
......................................................................
(b) Transaction tree of a FFL system
..............................................................
Figure 7.7: Procedure Commit-Depth-First-Traversal
.............................................................................
Figure 7.8: Cases in the proof of Lemma 7.5