.png){kind=icon}
返回
2 FULLY DISTRIBUTED CONCURRENCY-CONTROL ALGORITHMS
.png){kind=icon}
PRE
AI
DOI：10.1109/69.243515.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Two new concurrency control algorithms are introduced for partially replicated distributed databases. They both maintain two values of a data item, and differ in that one requires all locks to be granted at one time, whereas the,other does not. They are based on locking, and avoid deadlocks by using timestamps to establish an execution order when conflicts arise. Since they both proceed without any communication among schedulers, but only communication between the originating site and all participating sites, we say they are fully distributed.
Keyword:
ALGORITHMS
CONCURRENCY CONTROL
DISTRIBUTED DATABASES
LOCKING
TIMESTAMPS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
暂无机构信息
.png){kind=icon}
