Issue No. 02 - April (1993 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.219738
<p>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.</p>
availability; replicated databases; coterie scheme; optimal coteries; optimal acceptance set; sparse zero-one linear programming problem; optimization problem; distributed databases; linear programming
J. Tang and N. Natarajan, "Obtaining Coteries That Optimize the Availability of Replicated Databases," in IEEE Transactions on Knowledge & Data Engineering, vol. 5, no. , pp. 309-321, 1993.