Date of Publication

1991

Document Type

Master's Thesis

Degree Name

Master of Science in Computer Science

Subject Categories

Computer Sciences

College

College of Computer Studies

Department/Unit

Computer Science

Thesis Adviser

Marilou Jopillo

Defense Panel Chair

Rene Saquing

Defense Panel Member

David Huang
Patricia Claudio

Abstract/Summary

A number of sites are interconnected in a distributed database system (DDBS) to provide a convenient access to data via some kind of communication network. In a distributed system it is highly desirable to keep the system functioning even in the situation of one or more node failure or in network partitioning. Supporting some redundant copies of files and maintaining consistency in those copies in such a situation is one of the serious problem of DDB system. Network partition in a distributed database system may lead to inconsistency among redundant copies of database files residing in two or more partitions, accessed separately. Detecting network partition and merge, detecting inconsistency, and mechanisms for recovering from these inconsistencies are discussed in this study. Network information is maintained to detect the network partition and merge. Flags are used in the log of transaction to record the updates made in each sites. Those flags from each log (associated with each file) are checked to detect the mutual inconsistency of the data tuples in the database files, and the log information are used to recover the unupdated tuples of newly merged sites. All these mechanisms are kept transparent to the user.

Abstract Format

html

Language

English

Format

Print

Accession Number

TG01857

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

118, [16] leaves, 28 cm.

Keywords

Distributed databases

Upload Full Text

wf_yes

Download

Share

COinS