{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69576"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69576","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"A Network Surveillance Mechanism to Support Partitioned Operation in Distributed Database Systems","abstract":"Data replication in distributed database systems is designed to achieve high reliability and availability. In case of network partitioning, the mutual consistency of data may become doubtful unless the transaction processing mechanism puts appropriate limits on its operation.","abstract_html":"Data replication in distributed database systems is designed to achieve high reliability and availability. In case of network partitioning, the mutual consistency of data may become doubtful unless the transaction processing mechanism puts appropriate limits on its operation.","abstract_has_math":false,"creators":["Kim, Junguk Lawrence"],"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:55Z","date_published":"2014-12-15T19:25:55Z","updated_at":"2026-07-22T22:26:01Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8721678"],"render_values":[{"text":"(UMI)AAI8721678","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69576","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Kim, Junguk Lawrence"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:25:55Z","10000-01-01","1987"]},{"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/69576","(UMI)AAI8721678"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Data replication in distributed database systems is designed to achieve high reliability and availability. In case of network partitioning, the mutual consistency of data may become doubtful unless the transaction processing mechanism puts appropriate limits on its operation.","To achieve high availability, transactions must be processed despite failures. There are two basic approaches to network partitioning problems, conservative and optimistic. In a conservative approach, no update is allowed unless mutual consistency is guaranteed. An optimistic approach allows transactions to be executed in each partition and the database is reconciled when the partitions are merged. To coordinate the partition merge process correctly, the system must know the partitioning and merging points.","In this thesis, we present a new protocol that correctly supports partitioned operation. Basically, the status change surveillance mechanism detects changes in the status of the network and the system reconfiguration mechanism constructs a new network view after a status change is detected and distributes it to all sites in a reliable way. Proofs of correctness, including finite state analysis, are provided for the protocols.","Made available in DSpace on 2014-12-15T19:25:55Z (GMT). No. of bitstreams: 1 8721678.pdf: 3642454 bytes, checksum: 8307ef5b6a4c9e16442092addf780a6c (MD5) Previous issue date: 1987","Embargo set by: Seth Robbins for item 69742 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","110 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987."]},{"key":"dc:title","label":"Title","values":["A Network Surveillance Mechanism to Support Partitioned Operation in Distributed Database Systems"]}]}],"canonical_facts":{"dc:creator":["Kim, Junguk Lawrence"],"dc:date":["2014-12-15T19:25:55Z","10000-01-01","1987"],"dc:description":["Data replication in distributed database systems is designed to achieve high reliability and availability. In case of network partitioning, the mutual consistency of data may become doubtful unless the transaction processing mechanism puts appropriate limits on its operation.","To achieve high availability, transactions must be processed despite failures. There are two basic approaches to network partitioning problems, conservative and optimistic. In a conservative approach, no update is allowed unless mutual consistency is guaranteed. An optimistic approach allows transactions to be executed in each partition and the database is reconciled when the partitions are merged. To coordinate the partition merge process correctly, the system must know the partitioning and merging points.","In this thesis, we present a new protocol that correctly supports partitioned operation. Basically, the status change surveillance mechanism detects changes in the status of the network and the system reconfiguration mechanism constructs a new network view after a status change is detected and distributes it to all sites in a reliable way. Proofs of correctness, including finite state analysis, are provided for the protocols.","Made available in DSpace on 2014-12-15T19:25:55Z (GMT). No. of bitstreams: 1 8721678.pdf: 3642454 bytes, checksum: 8307ef5b6a4c9e16442092addf780a6c (MD5) Previous issue date: 1987","Embargo set by: Seth Robbins for item 69742 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","110 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987."],"dc:identifier":["http://hdl.handle.net/2142/69576","(UMI)AAI8721678"],"dc:subject":["Computer Science"],"dc:title":["A Network Surveillance Mechanism to Support Partitioned Operation in Distributed Database Systems"],"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"}