{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69553"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69553","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Optimistic Partitioned Operation in Distributed Database Systems (Network Partitioning, Replicated Data, Consistency, Recovery, Fault-Tolerance)","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Ma, Anthony Vu"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T19:25:44Z","date_published":"2014-12-15T19:25:44Z","updated_at":"2026-07-22T22:26:01Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8623361"],"render_values":[{"text":"(UMI)AAI8623361","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69553","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Ma, Anthony Vu"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:25:44Z","10000-01-01","1986"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/69553","(UMI)AAI8623361"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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.","In this thesis, several problems related 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.","Made available in DSpace on 2014-12-15T19:25:44Z (GMT). No. of bitstreams: 1 8623361.pdf: 5308798 bytes, checksum: 8abc02d746f6c0959ef9eed9557aaa8e (MD5) Previous issue date: 1986","Embargo set by: Seth Robbins for item 69719 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","147 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986."]},{"key":"dc:title","label":"Title","values":["Optimistic Partitioned Operation in Distributed Database Systems (Network Partitioning, Replicated Data, Consistency, Recovery, Fault-Tolerance)"]}]}],"canonical_facts":{"dc:creator":["Ma, Anthony Vu"],"dc:date":["2014-12-15T19:25:44Z","10000-01-01","1986"],"dc:description":["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.","In this thesis, several problems related 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.","Made available in DSpace on 2014-12-15T19:25:44Z (GMT). No. of bitstreams: 1 8623361.pdf: 5308798 bytes, checksum: 8abc02d746f6c0959ef9eed9557aaa8e (MD5) Previous issue date: 1986","Embargo set by: Seth Robbins for item 69719 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","147 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986."],"dc:identifier":["http://hdl.handle.net/2142/69553","(UMI)AAI8623361"],"dc:subject":["Computer Science"],"dc:title":["Optimistic Partitioned Operation in Distributed Database Systems (Network Partitioning, Replicated Data, Consistency, Recovery, Fault-Tolerance)"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:01Z"}