| 摘要: |
| 本文讨论“无用写”给调度的可串行化检验带来的影响,首先,我们定义了写—写、写—读、读—写和读—读约束,证明了在上述约束下,若不存在无用写,调度的可串行化检验的时间复杂性是多项式界的,进而将上述问题推广到多版本系统,得到一系列类似的有用的结论。 |
| 关键词: |
| DOI： |
| 分类号: |
| 基金项目: |
|
| THE INFLUENCE OF USELESS ACTIONS ON TESTING SERIALIZABILITY WITH CONSTRAINTS |
|
Liu Weiyi
|
| Abstract: |
| The influence of useless actions on testing serializability of a schedule is discussed in this paper. At first, we define the write-write^ write-read^ read-write and read-read constraints. It is shown that if there is no useless actions in the schedule, the complexity of testing serializability under the constraints is in polinomial time. We extend the problems to the multiversion systems, then some good conclusions polynomial are obtained. |
| Key words: |
