Detection of mutual inconsistency in distributed databases

Journal Article · Thu Jun 01 04:00:00 EDT 1989 · Journal of Parallel and Distributed Computing; (USA)

DOI:https://doi.org/10.1016/0743-7315(89)90003-8· OSTI ID:5280431

Ramarao, K V.S. ^[1]

---

1. SBC Technology Resources, St. Louis, MO (US)

A Distributed Database Management System should guarantee the consistency of databases at all sites in the system. In particular when the databases are replicated, mutual consistency among all copies of an item should be maintained. Network partitioning is a difficult kind of failure to deal with. A strategy known as the optimistic approach allows transactions to be run independently in different parts of the distributed system formed due to a partition. The mutual consistency among the copies of an item cannot be taken for granted in this scenario. Thus a natural requirement of the system then is that it determines whether or not the database is consistent and tries to resolve any inconsistencies. A simple scheme is presented in this paper to detect mutual inconsistency when partitioned databases merge.

• OSTI ID: 5280431
• Journal Information: Journal of Parallel and Distributed Computing; (USA), Journal Name: Journal of Parallel and Distributed Computing; (USA) Vol. 6:3; ISSN JPDCE; ISSN 0743-7315
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
990300 -- Information Handling
DATA BASE MANAGEMENT
DATA PROCESSING
DISTRIBUTED DATA PROCESSING
MANAGEMENT
OPTIMIZATION
PERFORMANCE
PROCESSING