Optimistic Partitioned Operation in Distributed Database Systems (Network Partitioning, Replicated Data, Consistency, Recovery, Fault-Tolerance)

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 method based on serialization graphs has been proposed in the literature. It has been argued that the graph-theoretic method can be attractive for certain applications.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2014

Author dc:creator

• Ma, Anthony Vu

• Computer Science

Identifier

(UMI)AAI8623361

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/69553