Iowa State University Capstones, Theses and Retrospective Theses and Dissertations Dissertations 1984 A categorization scheme for concurrency control protocols in distributed databases Yunyong Teng-amnuay Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/rtd Part of the Computer Sciences Commons Recommended Citation Teng-amnuay, Yunyong, "A categorization scheme for concurrency control protocols in distributed databases " (1984). Retrospective Theses and Dissertations. 7734. https://lib.dr.iastate.edu/rtd/7734 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Retrospective Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. INFORMATION TO USERS This reproduction was made from a copy of a document sent to us for microfilming. While the most advanced technology has been used to photograph and reproduce this document, the quality of the reproduction is heavily dependent upon the quaUty of the material submitted. The following explanation of techniques is provided to help clarify markings or notations which may appear on this reproduction. 1.The sign or "target" for pages apparently lacking from the document photographed is "Missing Page(s)". If it was possible to obtain the missing page(s) or section, they are spliced into the film along with adjacent pages. This may have necessitated cutting througli an image and duplicating adjacent pages to assure complete continuity. 2. When an image on the film is obhterated with a round black mark, it is an indication of either blurred copy because of movement during exposure, duplicate copy, or copyrighted materials that should not have been filmed. For blurred pages, a good image of the page can be found in the adjacent frame. If copyrighted materials were deleted, a target note will appear listing the pages in the adjacent frame. 3. When a map, drawing or chart, etc., is part of the material being photographed, a definite method of "sectioning" the material has been followed. It is customary to begin filming at the upper left hand comer of a large sheet and to continue from left to right in equal sections with small overlaps. If necessary, sectioning is continued again—beginning below the first row and continuing on until complete. 4. For illustrations that cannot be satisfactorily reproduced by xerographic means, photographic prints can be purchased at additional cost and inserted into your xerographic copy. These prints are available upon request from the Dissertations Customer Services Department. 5. Some pages in any document may have indistinct print. In all cases the best available copy has been filmed. UniversiV Micr^lms International 300 N. Zeeb Road Ann Arbor, Ml 48106 8423680 Teng-Amnuay, Yunyong A CATEGORIZATION SCHEME FC CONCURRENCY CONTROL PROTOCOLS IN DISTRIBUTED DATABASES Iowa State University PH.D. 1984 University Microfilms Internâtionsl 300 N. zeeb Road, Ann -, Ml 48106 A categorization scheme for concurrency control protocols in distributed databases by Yunyong Teng-amnuay A Dissertation Submitted to the Graduate Faculty in Partial Fulfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY Major: Computer Science Approved: Signature was redacted for privacy. In Charge of Major Wor Signature was redacted for privacy. For the Major Department Signature was redacted for privacy. For yha arjaduate College Iowa State University Ames, Iowa 1984 TABLE OF CONTENTS PAGE INTRODUCTION 1 A. Concurrency Control Problem 1 1. Consistency of shared resources 2 2. Concurrency control in a centralized database 6 a. Definition 5 b. Philosophy of concurrency control 9 3. Concurrency control in a distributed database 12 a. Definition 12 b. Advantages of a distributed database .... 14 c. Difficulties inherent in a distributed database 15 d. Common synchronization techniques 17 1) Locking 17 2) Timestamping 18 e. Mutual consistency 19 B. Essence of Research 19 1. Problem statement 19 2. Review of previous categorization schemes ... 21 3. Purpose of the research 24 a. Development of categorization scheme .... 24 b. Synthesis of concurrency control algorithms 25 4. Benefits of the research 26 a. Benefit due to the categorization scheme . 26 b. Benefit due to synthesis of algorithms ... 28 5. Research outline 29 SURVEY OF EXISTING CONCURRENCY CONTROL METHODS ... 31 A. Description of Methods 31 1. Unanimous consensus with full redundancy ... 33 2. Action processing in timestamp order 34 3. SDD-1 concurrency control scheme 35 4. Distributed data-sharing system using tickets 38 5. Distributed locking 40 6. Inconsistency avoidance in daisy-chained system 42 7. Primary-copy locking scheme 43 8. Majority consensus with full redundancy .... 45 9. Distributed precedence-relation analysis ... 47 10. Centralized control with full redundancy ... 48 11. Distributed request queue with full iii redundancy 50 12. Closely synchronized distributed clock .... 51 13. Reversible unanimous consensus 52 14. Migrating central control by unanimous consensus 53 15. Distributed waiting queue with full redundancy 54 15. Centralized serializability controller .... 55 17. Distributed reservation list with full redundancy 55 18. Migrating control on virtual ring 58 19. Deadlock-free resource management with ordered locking of data 59 20. Multiversion database 50 B. Summary 61 III. FRAMEWORK ON PROBLEM OF CONCURRENCY CONTROL .... 62 A. Causes of Inconsistency 52 1. Cause of inconsistency due to erroneous inputs 54 2. Cause of inconsistency due to concurrent execution 64 3. Cause of inconsistency due to hardware .... 65 B. Environment for the Control of Concurrency .... 65 1. Organization of data 66 2. Data dictionary 68 3. Physical network architecture 70 4. Transaction model 70 a. Collapsing the complex transaction 71 b. Multi-traced transaction 74 c. Intra-dependent transaction 76 C. Basic Distributed Database Model 78 1. Components of the BDD model 79 2. Logical components 79 a. Transaction manager 79 b. Data manager 81 c. Data network 82 d. Control network 82 3. Transaction life-cycle 83 D. Summary 85 IV. DISCUSSION ON SERIALIZABLE EXECUTION SEQUENCES AND THEORETICAL BASIS FOR THE CATEGORIZATION SCHEME . .87 A. Serializability Concept 88 iv B. Aspects of Classes of Serializable Execution Sequences 95 1. Equivalence of DSR, CPSR, and CG-secure .... 97 2. SDD-l-secure is a subset of P3 99 3. Equivalence of classes Q and W2PL 100 4. Implications of the classes CPSR and SSR . 103 a. Notions of liveness, deadness and detailed transactions 104 b. Subclasses of SR concerning live actions . 108 c. On the possibly inefficient recognition of members of SSR 110 5. CPSR class as a basis for categorization . 113 C. Summary 113 V. THE CATEGORIZATION SCHEME 114 A. A Pragmatic Reason for Selecting CPSR Class . 114 B. Philosophy of Primary Categories 118 1. Logical approaches to concurrency control problem 119 a. Prevention of nonserializability 119 b. Correction of nonserializability 120 2. The role of transaction rejection 120 3. Distinction between subcategories and components 121 C. Subcategorization of Prevention 122 1. Preanalyzer 122 a. Organization of simplified preanalyzer . 123 1) Centralized simplified preanalyzer . 124 2) Distributed simplified preanalyzer . 125 b. Provision for concurrency 125 1) Dynamic conflict-analysis 125 2) Static conflict-analysis 127 2. Enforcer 127 a. OAS with consecutive timestamps 128 b. OAS with nonconsecutive timestamps .... 129 1) OAS for read actions 130 2) OAS for write actions 130 3) Reservation of write 131 4) Provision for local concurrency .... 132 3. Categorization tree for prevention 133 D. Subcategorization of Correction 133 1. Integrity of conflict-analysis 135 a. Integral conflict-analysis 135 1) Multiplicity of integral analyzer . 135 V 2) Forwarding of conflict-information . 136 3) Precedence selection 137 b. Fractional conflict-analysis 139 1) Dimensionality of conflict 139 2 ) Degree of data redundancy 141 2. Waiting constraint 142 3. Provision for local concurrency 143 4. Categorization tree for correction 144 E. Categorization of Some Existing Concurrency Control Algorithms 145 F. Summary 153 VI. SYNTHESIS OF CONCURRENCY CONTROL ALGORITHMS ... 155 A. Selection of Classes 155 1. CPSR class 155 2. Class Q 155 3. Class 2PL 157 4. Other classes 157 B. Synthesis of Centralized Concurrency Control Algorithms 158 1. Three-level precedence graph 159 a. Shortcomings of a conflict-graph and a precedence relation 159 b. Definition of the 3PG 163 2. Synthesis of centralized concurrency control algorithms producing the class CPSR . 166 a. Centralized preventive CPSR algorithm . 167 b. Centralized corrective CPSR algorithm . 171 3. Synthesis of centralized concurrency control algorithms producing the class Q ... 174 a. Centralized preventive Q algorithm .... 180 b. Centralized corrective Q algorithm .... 181 4. Synthesis of centralized concurrency control algorithm producing the class 2PL . 182 C. Synthesis of Distributed Concurrency Control Algorithms 184 1. A distributed preventive CPSR algorithm . 185 a. Sequencer 185 b. TM • 186 c. DM 188 d. The complex waiting queue 188 1) Subqueues 189 2) Batch of data dependencies 189 3) Detailed action handling 192 e. Algorithm for the complex waiting queue . 193 vi f. An example of the complex waiting queue . 196 2. Distributed preventive