1) serializability
可串行性
1.
On the basis of this,an XPath-based Locking protocol(XPL),as well as a lock mode,is put forward and then the schedule within the locking protocol mentioned above is proved to be serializability.
在此基础上,提出一种基于XPath的锁协议(XPL)以及锁模型,并验证在此锁协议机制下的调度是可串行性调度,从而实现了XML原型数据库的多用户事务并发控制。
2.
To overcome the drawback of the two concurrency control algorithms proposed in literature〔1〕, where they are used to ensure semantic serializability (The drawback is that they both bring forward special demand on the transactions written by the user and this adds burden on the user.
为了克服文献〔1〕所提出的两种用于实现语义可串行性并发控制算法的缺点 (即都对用户书写的事务提出了特殊的要求 ,从而增加了用户的负担 ) ,本文给出了一种基于乐观方法的并发控制算法 ,并证明了该算法能够保证它所生成的历史具有语义可串行
2) Epsilon serializability(ESR)
E-可串行性
3) layered serializability
层次可串行性
1.
The correctness of the algorithm is proven in the sense of layered serializability.
探讨并行规则事务对于共享数据对象的锁继承和锁剥夺关系 ,提出一个并发控制算法 ,并基于层次可串行性标准证明算法的正确性 。
4) one-copy serializability
单副本可串行性
5) serializability theory
可串行性理论
6) serializability
可串行化
1.
Lock and serializability are two important methods for concurrency control.
加锁与可串行化是并发控制中采取的2个主要措施。
2.
All the transaction-oriented policies of relaxing serializability such as epsilon serializability and similarity serializability and quasi consistent serializability can result in bounded inconsistency of data.
ε-可串行化、Δ-可串行化、准一致性可串行化等现有面向事务的放松可串行化正确性准则虽能帮助更多无线通信事务满足其截止期要求,但会导致数据的受限不一致。
3.
On the basis of this,an Xpath-based locking protocol is put forward and the schedule within the locking protocol mentioned above is proved to be serializability.
通过简化XPath数据模型,定义基于该模型的几种Native XML数据库操作,提出一种新的基于XPath的加锁协议,分析该协议下的调度是可串行化调度,并针对其性能问题进行探讨。
补充资料：连续性与非连续性(见间断性与不间断性)
连续性与非连续性(见间断性与不间断性)
continuity and discontinuity
11an父ux泊g四f“山。麻以角g、.连续性与非连续性(c。nt，n琳t:nuity一)_见间断性与不间断性。and diseo红ti-
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条