Binary vote assignment on a grid for efficient access of replicated data

被引:13
作者
Deris, MM [1 ]
Evans, DJ
Saman, MY
Noraziah, A
机构
[1] Univ Coll Sci & Technol Malaysia, Fac Sci & Technol, Dept Comp Sci, Mengabang Telipot 21030, Kuala Terenggan, Malaysia
[2] Nottingham Trent Univ, Dept Comp, Nottingham NG1 4BU, England
关键词
distributed database; replicated data; binary grid assignment; communication cost; data availability;
D O I
10.1080/00207160310001620777
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Data replication can be used to improve the availability of data in a distributed database system. In such a system, a mechanism is required to maintain the consistency of the replicated data. Grid structure (GS) technique based on quorum is one of the latest solutions for performing this while providing a high availability of the system. It was shown in the previous study, that it still requires a bigger number of copies be made available to construct a quorum. So it is not suitable for the large systems. In this paper, we propose a technique called the binary vote assignment on grid (BVAG) technique by considering only neighbors have the replicated data. In comparison to the GS technique, BVAG requires lower communication cost for an operation, while providing higher data availability, which is preferred for large systems.
引用
收藏
页码:1489 / 1498
页数:10
相关论文
共 15 条
[11]   DYNAMIC VOTING ALGORITHMS FOR MAINTAINING THE CONSISTENCY OF A REPLICATED DATABASE [J].
JAJODIA, S ;
MUTCHLER, D .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1990, 15 (02) :230-280
[12]   A SQUARE-ROOT-N ALGORITHM FOR MUTUAL EXCLUSION IN DECENTRALIZED SYSTEMS [J].
MAEKAWA, M .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1985, 3 (02) :145-159
[13]  
Ozsu M.T., 1999, PRINCIPLES DISTRIBUT, V2nd
[14]  
Paris J.-F., 1988, Proceedings Fourth International Conference on Data Engineering (Cat. No.88CH2550-2), P268, DOI 10.1109/ICDE.1988.105469
[15]   An adaptive data replication algorithm [J].
Wolfson, O ;
Jajodia, S ;
Huang, YX .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1997, 22 (02) :255-314