A New Dynamic Voting Algorithm for Distributed Database Systems

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

We consider the problem of keeping a distributed database system that has been partitioned because of site or communication link failures partially operable while ensuring data consistency. A dynamic-voting-consistency algorithm is proposed, and its correctness is demonstrated. The proposed algorithm results in improved efficiency in executing read requests by not requiring a read quorum. This algorithm is effective in environments where the majority of user requests are “read” types of requests. Furthermore, the proposed algorithm results in efficient recovery by avoiding updating those data objects that are still current. Under the proposed algorithm, the majority partition would be available even if changes in the network topology take place at a higher rate than the update rate, as long as only simple partitioning takes place.

Original languageEnglish (US)
Pages (from-to)470-478
Number of pages9
JournalIEEE Transactions on Knowledge and Data Engineering
Volume6
Issue number3
DOIs
StatePublished - Jun 1994

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Keywords

  • Distributed databases
  • data availability
  • dynamic voting
  • network partitioning
  • replicated data

Fingerprint

Dive into the research topics of 'A New Dynamic Voting Algorithm for Distributed Database Systems'. Together they form a unique fingerprint.

Cite this