DocumentCode
273757
Title
Missing-partition dynamic voting scheme for replicated database systems
Author
Huang, Ching-Liang ; Li, Victor O K
Author_Institution
Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
fYear
1989
fDate
5-9 Jun 1989
Firstpage
579
Lastpage
586
Abstract
A replication control protocol utilizing dynamic voting is presented for ensuring database correctness so that the system behaves like a one-copy database to the users. The protocol dynamically adjusts vote assignment of data items in response to failures and recoveries, thus maintaining higher data availability than static voting schemes in the event of network partitioning. Unlike existing dynamic voting schemes, it supports inexpensive read operations which access one copy, rather than all copies, of each data item read. Since read operations outnumber write operations in most applications, this protocol enjoys better performance. With this protocol, transactions run in one of three modes: normal mode, missing-partition mode, or pseudo-normal mode. Because a partition number and a last current copy cardinality are associated with each copy, read operations only require one copy of a data item when run in the normal mode
Keywords
database management systems; protocols; data availability; missing-partition dynamic voting scheme; missing-partition mode; network partitioning; normal mode; one-copy database; pseudonormal mode; replicated database systems; replication control protocol; vote assignment; Access protocols; Availability; Communication system control; Concurrency control; Control systems; Database systems; Distributed databases; Partitioning algorithms; Transaction databases; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 1989., 9th International Conference on
Conference_Location
Newport Beach, CA
Print_ISBN
0-8186-1953-8
Type
conf
DOI
10.1109/ICDCS.1989.37991
Filename
37991
Link To Document