logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

OBTAINING COTERIES THAT OPTIMIZE THE AVAILABILITY OF REPLICATED DATABASES

delete1993-04-01
delete6
PRE
AI
唐
唐建 (Jian Tang) *
N
Nagarajan Natarajan
DOI：10.1109/69.219738delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
A replicated database system may partition into isolated groups in the presence of node and link failures. When the system has partitioned, a pessimistic scheme maintains availability and consistency of replicated data by ensuring that updates occur in at most one group. A pessimistic scheme is called a static scheme if these distinguished groups are determined only by the membership of different groups in the partitioned system. In the literature, a scheme called the coterie scheme has been introduced as a general static scheme. Although this scheme is more powerful than voting, it has two drawbacks. There is no efficient implementation of this scheme, and no procedure, other than enumeration, has been suggested for obtaining coteries that maximize availability. In this paper, we propose a concept called an acceptance set which is an alternative representation of the same information contained in a coterie. Using this concept, the coterie scheme can be implemented efficiently, and also an optimal coterie for a system can be obtained more directly. The problem of determining an optimal acceptance set is formulated as a sparse 0-1 linear programming problem. Hence, the optimization problem can be handled using the very rich class of existing techniques for solving such problems. Based on our experiments, we feel that this optimization approach is feasible for at least up to 8 nodes (copies). In this paper, we also discuss how the scheme and the optimization approach can be used for systems that distinguish between read and write operations.
Keywords:
ACCEPTANCE SET
AVAILABILITY
COTERIE
PESSIMISTIC SCHEME
REPLICA CONTROL
REPLICATED DATA
VOTING
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Knowledge and Data Engineering cover
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
Papers:
6.8K
Citations:
3.2W

Organization

No organization information available