.png){kind=icon}
返回
A NEW DYNAMIC VOTING ALGORITHM FOR DISTRIBUTED DATABASE-SYSTEMS
.png){kind=icon}
PRE
AI
DOI：10.1109/69.334856.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of keeping a distributed database system that has been partitioned because of site or communication link failures partially operable while ensuring data consistency. A dynamic-voting-consistency algorithm is proposed, and its correctness is demonstrated. The proposed algorithm results in improved efficiency in executing read requests by not requiring a read quorum. This algorithm is effective in environments where the majority of user requests are ''read'' types of requests. Furthermore, the proposed algorithm results in efficient recovery by avoiding updating those data objects that are still current. Under the proposed algorithm, the majority partition would be available even if changes in the network topology take place at a higher rate than the update rate, as long as only simple partitioning takes place.
Keyword:
DISTRIBUTED DATABASES
DYNAMIC VOTING
REPLICATED DATA
NETWORK PARTITIONING
DATA VARIABILITY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
Draft Genome Sequence of
Clostridium
sp. Maddingley, Isolated from Coal-Seam Gas Formation Water
OAAI
OAAI分享收藏
查看更多内容