...
首页> 外文期刊>University of Bucharest. Annals. Mathematical Series >Reducing Conflict Graph Of Multi-step Transactions Accessing Ordered Data With Gaps
【24h】

Reducing Conflict Graph Of Multi-step Transactions Accessing Ordered Data With Gaps

机译:减少多步交易中有间隙访问有序数据的冲突图

获取原文

摘要

Specifying the correctness of concurrent transactions contending to access a database is a crucial work. In this research, we adopt the serializability to be the correctness criterion for concurrent transactions accessing ordered data items. One of the most popular technique uses to test serializability is conflict graph. We add a realistic condition on the data items to show that the? corresponding conflict cyclicity can be reduced, in a way, to use temporal-logic-based verification approach in proving serializability.
机译:指定竞争访问数据库的并发事务的正确性是一项至关重要的工作。在这项研究中,我们采用可序列化性作为并发事务访问有序数据项的正确性标准。用来测试可串行性的最流行技术之一是冲突图。我们在数据项上添加一个现实的条件来表明?在某种程度上,可以使用基于时间逻辑的验证方法来证明可序列化性,从而减少相应的冲突周期。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号