This Article 
 Bibliographic References 
 Add to: 
Obtaining Coteries That Optimize the Availability of Replicated Databases
April 1993 (vol. 5 no. 2)
pp. 309-321

Techniques for implementing the coterie scheme and for obtaining optimal coteries for a system are presented. Central to the techniques is the notion of an acceptance set, which is an alternative representation of the information contained in a coterie. Using this concept, the coterie scheme can be implemented efficiently, and an optimal coterie for a system can be obtained more directly. The problem of determining an optimal acceptance set is formulated as a sparse zero-one linear programming problem. Hence, the optimization problem can be handled using the very rich class of existing techniques for solving such problems. Experimental results indicate that the optimization approach is feasible for up to eight nodes at least. The ways in which the scheme and the optimization approach can be used for systems that distinguish between read and write operations are indicated.

[1] D. Barbara and H. Garcia-Molina, "The reliability of voting mechanisms,"IEEE Trans. Comput., vol. C-36, no. 10, pp. 1197-1208, Oct. 1987.
[2] S. Y. Cheung, M. Ahamad, and M. H. Ammar, "Optimizing vote and quorum assignments for reading and writing replicated data,"IEEE Trans. Knowl. Data Eng., vol. 1, pp. 387-397, Sept. 1989.
[3] S. Y. Cheunget al., "Multi-dimensional voting: A general method for implementing synchronization in distributed systems," inProc. Tenth Int. Conf. Distributed Comput. Syst., Paris, June 1990.
[4] H. Crowder, E. L. Johnson, and M. Padberg, "Solving large-scale zero-one linear programming problems,"Operations R., vol. 31, no. 5, pp. 803-834, Sept.-Oct. 1983.
[5] 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.
[6] H. Garcia-Molina and D. Barbara, "Optimizing the reliability provided by voting mechanisms," inProc. Fourth Int. Conf. on Distributed Computing Systems, June 1984, pp. 340-346.
[7] 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.
[8] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[9] E. L. Johnson, M. M. Kostreva, and U. H. Suhl, "Solving 0 - 1 integer programming problems arising from large scale planning models,"Operations Res., vol. 33, no. 4, pp. 803-819, 1985.
[10] S. Jajodia and D. Mutchler, "Dynamic voting," inProc. 1987 ACM SIGMOD, San Francisco, CA, May 1987, pp. 227-238.
[11] M. Obradovic and P. Berman, "Voting as the optimal static pessimistic scheme for managing replicated data," inProc. 9th Symp. Reliable Distributed Syst., 1990, pp. 126-135.
[12] M. W. Padberg, "Covering, Packing and Knapsack Problems,"Ann. Discrete Math., vol. 4, pp. 265-287, 1979.
[13] R. Thomas, "A majority consensus approach to concurrency control,"ACM Trans. Database Syst., vol. 4, pp. 180-209, June 1979.
[14] Z. Tong and R. Kain, "Vote assignments in weighted voting mechanisms," inProc. 7th Symp. Reliable Distributed Syst., 1988, pp. 138-143.
[15] J. Tang and N. Natarajan, "A scheme for maintaining consistency and availability of replicated files in a partitioned distributed system," inProc. Fifth Int. Conf. on Data Engineering, Feb. 1989, pp. 530-537.
[16] 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.

Index Terms:
availability; replicated databases; coterie scheme; optimal coteries; optimal acceptance set; sparse zero-one linear programming problem; optimization problem; distributed databases; linear programming
J. Tang, N. Natarajan, "Obtaining Coteries That Optimize the Availability of Replicated Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 2, pp. 309-321, April 1993, doi:10.1109/69.219738
Usage of this product signifies your acceptance of the Terms of Use.