.png){kind=icon}
返回
A NONBLOCKING TRANSACTION DATA-FLOW GRAPH-BASED PROTOCOL FOR REPLICATED DATABASES
.png){kind=icon}
PRE
AI
DOI：10.1109/69.469835.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Replicated data management systems adopt the 1-copy serializability criteria for processing transactions. In order to achieve this goal, many approaches rely on obtaining votes from other sites for processing update requests. In the proposed approach, a technique for generation of precedence graphs for each transaction execution is analyzed. The transaction dataflow graph approach is a fully distributed approach. The proposed technique, is free from deadlocks, and avoids resubmission of transactions.
Keyword:
AVAILABILITY
DISTRIBUTED ALGORITHMS
FAULT TOLERANCE
NONBLOCKING PROTOCOLS
RELIABILITY
REPLICATED DATABASES
TIME-CRITICAL TRANSACTIONS
SERIALIZABILITY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
Analysis of rapid manufacturing—using layer manufacturing processes for production快速制造分析-使用层制造工艺进行生产
OAAI
OAAI分享收藏Draft Genome Sequence of
Clostridium
sp. Maddingley, Isolated from Coal-Seam Gas Formation WaterOAAI
OAAI分享收藏分享收藏
查看更多内容