Using reconfiguration for efficient management of replicated data

被引:14
作者
Agrawal, D
ElAbbadi, A
机构
[1] Department of Computer Science, University of California, Santa Barbara
基金
美国国家科学基金会;
关键词
distributed databases; fault-tolerance; reconfiguration; replicated data;
D O I
10.1109/69.542030
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Replicated data management protocols have been proposed that exploit a logically structured set of copies. These protocols have the advantage that they provide limited fault-tolerance at low communication cost. The proposed protocols can be viewed as analogues of the read-one write-all protocol in the context of logical structures. In this paper, we start by generalizing these protocols in two ways for logical structures. First, the quorum based approach is applied to develop protocols that use structured read and write quorums, thus attaining a high degree of data availability for both read and write operations. Next, the reconfiguration or views approach is developed for these structures resulting in protocols that attain high degrees of availability at significantly low communication cost for read operations. In this sense, the proposed protocols have the advantages of the read-one write-all protocol for low cost read operations as well as the majority quorum protocol for high data availability. Finally, we generalize the reconfiguration approach to allow for the dynamic reconfiguration of the database system from one replica management protocol to another. This allows database systems to adapt to an evolving and dynamic application environment.
引用
收藏
页码:786 / 801
页数:16
相关论文
共 27 条
[1]   THE GENERALIZED TREE QUORUM PROTOCOL - AN EFFICIENT APPROACH FOR MANAGING REPLICATED DATA [J].
AGRAWAL, D ;
ELABBADI, A .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1992, 17 (04) :689-717
[2]  
AGRAWAL D, 1990, 16 INT C VER LARG DA, P243
[3]  
AGRAWAL D, 1991, ACM T COMPUT SYST, P1
[4]   PERFORMANCE CHARACTERIZATION OF QUORUM-CONSENSUS ALGORITHMS FOR REPLICATED DATA [J].
AHAMAD, M ;
AMMAR, MH .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1989, 15 (04) :492-496
[5]  
[Anonymous], ACM COMPUTING SURVEY, DOI [10.1145/5505.5508, DOI 10.1145/5505.5508]
[6]   A PROOF TECHNIQUE FOR CONCURRENCY-CONTROL AND RECOVERY ALGORITHMS FOR REPLICATED DATABASES [J].
BERNSTEIN, PA ;
GOODMAN, N .
DISTRIBUTED COMPUTING, 1987, 2 (01) :32-44
[7]   AN ALGORITHM FOR CONCURRENCY-CONTROL AND RECOVERY IN REPLICATED DISTRIBUTED DATABASES [J].
BERNSTEIN, PA ;
GOODMAN, N .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1984, 9 (04) :596-615
[8]   THE GRID PROTOCOL - A HIGH-PERFORMANCE SCHEME FOR MAINTAINING REPLICATED DATA [J].
CHEUNG, SY ;
AMMAR, MH ;
AHAMAD, M .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1992, 4 (06) :582-592
[9]  
ELABBADI A, 1989, ACM T DATABASE SYST, V14, P264, DOI 10.1145/63500.63501
[10]  
ELABBADI A, 1985, 4TH P ACM SIGACT SIG, P215