Obtaining coteries that optimize the availability of replicated databases
- 1 April 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 5 (2) , 309-321
- https://doi.org/10.1109/69.219738
Abstract
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 indicatedKeywords
This publication has 15 references indexed in Scilit:
- A scheme for maintaining consistency and availability of replicated files in a partitioned distributed systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Vote assignments in weighted voting mechanismsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Multidimensional voting: a general method for implementing synchronization in distributed systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Voting as the optimal static pessimistic scheme for managing replicated dataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A static pessimistic scheme for handling replicated databasesPublished by Association for Computing Machinery (ACM) ,1989
- Dynamic votingPublished by Association for Computing Machinery (ACM) ,1987
- Consistency in a partitioned network: a surveyACM Computing Surveys, 1985
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- A Majority consensus approach to concurrency control for multiple copy databasesACM Transactions on Database Systems, 1979
- Covering, Packing and Knapsack ProblemsAnnals of Discrete Mathematics, 1979