This Article 
 Bibliographic References 
 Add to: 
A New Dynamic Voting Algorithm for Distributed Database Systems
June 1994 (vol. 6 no. 3)
pp. 470-478

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.

[1] N. R. Adam and R. Tewari, "Dynamic voting with virtual copies," working paper, Rutgers University, Graduate School of Management, 1988.
[2] N. R. Adam and R. Tewari, "Regeneration with virtual copies for distributed company," submitted toIEEE Trans. Software Eng., June 1993.
[3] N. R. Adam and R. Tewari, "Regeneration with virtual copies for replicated databases," inProc. 11th IEEE Int. Conf. Distributed Comput. Syst., May 1991, pp. 429-436.
[4] D. Barbara and H. Garcia-Molina, "Optimizing the reliability provided by voting mechanisms," in4th Int. Conf. Distrib. Computing Syst., 1984, pp. 340-346.
[5] P. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems,"ACM Computing Surveys, Vol. 13, No. 2, June 1981, pp. 185-221.
[6] P. A. Bernstein and N. Goodman, "An algorithm for concurrency control and recovery in replicated distributed databases,"ACM Trans. Database Syst., vol. 9, no. 4, pp. 596-615, Dec. 1984.
[7] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[8] B. Bhargava, "Transaction processing and consistency control of replicated copies during failures"J. Management Inform. Syst., vol. 4, pp. 93- 112, Oct. 1987.
[9] B. Bhargava and P. L. Ng, "A dynamic majority determination algorithm for reconfiguration of network partition,"Inform. Sci., vol. 46, pp. 27-45, 1988.
[10] B. Bhargava and Z. Ruan, "Site recovery in replicated distributed database systems," in6th IEEE Conf. Distrib. Computing Syst., 1986, pp. 621-627.
[11] D. Davcev, "A dynamic voting scheme in distributed systems,"IEEE Trans. Software Eng., vol. 15, pp. 93-97, Jan 1989.
[12] D. Davcev and W. Burkhard, "Consistency and recovery control for replicated files," inProc. 10th Symp. Operating System Principles, Orcas Island, WA, Dec. 1985, pp. 87-96.
[13] S.B. Davidson, H. Garcia-Molina, and D. Skeen, "Consistency in a Partitioned Network,"ACM Computing Surveys, Vol. 17, No. 3, Sept. 1985, pp. 341-370.
[14] D. L. Eager and K. C. Sevcik, "Achieving robustness in distributed data-base systems,"ACM Trans. Database Syst., vol. 8, no. 3, pp. 354-381, Sept. 1983.
[15] A. El-Abbadi, "A paradigm for concurrency control protocols for distributed databases," Ph.D. dissertation, Cornell Univ., Ithaca, NY, 1987.
[16] H. Garcia-Molina and D. Barbara, "How to assign votes in a distributed systems,"J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
[17] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[18] C. L. Huang and V. O. Li, "Missing-partition dynamic voting scheme for replicated database systems, " inInt. Conf. Distrib. Computing Syst., 1989, pp. 579-585.
[19] J. Tang and N. Natarajan, "A static pessimistic scheme for handling replicated databases," inProc. 1989 ACM SIGMOD Int. Conf. Management Data, June 1989, pp. 389-398.
[20] S. Jajodia and D. Mutchler, "Dynamic voting," inProc. 1987 ACM SIGMOD, San Francisco, CA, May 1987, pp. 227-238.
[21] S. Jajodia and D. Mutchler, "Integrating static and dynamic voting protocols to enhance file availability," inProc. 4th IEEE Int. Conf. Data Eng., 1988, pp. 144-153.
[22] S. Jajodia and D. Mutchler, "A pessimistic consistency control algorithm for replicated files which achieves high availability,"IEEE Trans. Software Eng., vol. 15, pp. 39-45, Jan. 1989.
[23] S. Jajodia and D. Mutchler, "Dynamic voting algorithms for maintaining consistency of a replicated database,"ACM Trans. Database Syst., vol. 15, no. 2, June 1990.
[24] J. F. Paris, "Voting with witnesses: A consistency scheme for replicated files," in6th IEEE Conf. Distrib. Computing Syst., 1986, pp. 606-612.
[25] J. F. Paris and D. Long, "Efficient dynamic voting," inProc. Fourth IEEE Int. Conf. Data Eng., Los Angeles, CA, Jan. 1988.
[26] R. V. Renesse and A. S. Tanenbaum, "Voting with ghosts," inProc. 8th IEEE Conf. Distributed Comput. Syst., 1988, pp. 456-462.
[27] R. Thomas, "A majority consensus approach to concurrency control,"ACM Trans. Database Syst., vol. 4, pp. 180-209, June 1979.

Index Terms:
data integrity; distributed databases; software reliability; fault tolerant computing; database theory; system recovery; dynamic voting algorithm; distributed database systems; communication link failure; data consistency; dynamic-voting-consistency algorithm; algorithm correctness; read requests; read quorum; user requests; recovery; data object updating; majority partition; network topology; update rate; simple partitioning
N.R. Adam, "A New Dynamic Voting Algorithm for Distributed Database Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 3, pp. 470-478, June 1994, doi:10.1109/69.334856
Usage of this product signifies your acceptance of the Terms of Use.