Optimistic partitioned operation in distributed data base systems

Thesis/Dissertation · Wed Jan 01 04:00:00 EST 1986

OSTI ID:6956554

Ma, A V

Network partitioning is a serious threat to the availability of replicated data in distributed database systems. To provide high data availability during partitioning, an optimistic strategy for transaction processing will allow transactions to be processed in any partition. Conflict detection and resolution will then be performed when partitions are merged. Recently, an automatic conflict detection and resolution methods based on serialization graphs was proposed in the literature. It has been argued that the graph theoretic method can be attractive for certain applications. In this thesis, several problems elated to the design and implementation of fault-tolerant transaction processing mechanisms that employ the graph-theoretic method are studied. A framework for the detection and synchronization of failures and recoveries is proposed. A major component of the framework is a new partition management protocol designed especially for optimistic partitioned operation. Several crash/merge recovery algorithms are developed and their implementation issues are discussed. This thesis also presents a simple validation algorithm that may be suitable for environments where transaction conflicts are rare.

• Research Organization: Illinois Univ., Urbana (USA)
• OSTI ID: 6956554
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
990300 -- Information Handling
ALGORITHMS
AUTOMATION
COMPUTER GRAPHICS
COMPUTERS
DATA BASE MANAGEMENT
DATA PROCESSING
DIGITAL COMPUTERS
DISTRIBUTED DATA PROCESSING
FAULT TOLERANT COMPUTERS
MANAGEMENT
MATHEMATICAL LOGIC
OPTIMIZATION
PROCESSING