在面向逻辑的对象基础中基于依赖的并发控制

Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92 Pub Date : 1992-11-10 DOI:10.1109/TAI.1992.246413

L. Yang, P. Sheu

{"title":"在面向逻辑的对象基础中基于依赖的并发控制","authors":"L. Yang, P. Sheu","doi":"10.1109/TAI.1992.246413","DOIUrl":null,"url":null,"abstract":"A policy for scheduling concurrent transactions in which the preconditions and effects associated with the transactions can be specified is described. Also proposed is a recovery procedure for when transaction failures are detected. The advantages of the scheduling algorithm can be summarized as follows: for conventional transaction models, it is less constrained than the two-phased protocol, particularly for short transactions; and it can perform concurrency control based on semantic dependencies.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"117 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dependency-based concurrency control in logic-oriented object bases\",\"authors\":\"L. Yang, P. Sheu\",\"doi\":\"10.1109/TAI.1992.246413\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A policy for scheduling concurrent transactions in which the preconditions and effects associated with the transactions can be specified is described. Also proposed is a recovery procedure for when transaction failures are detected. The advantages of the scheduling algorithm can be summarized as follows: for conventional transaction models, it is less constrained than the two-phased protocol, particularly for short transactions; and it can perform concurrency control based on semantic dependencies.<<ETX>>\",\"PeriodicalId\":265283,\"journal\":{\"name\":\"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92\",\"volume\":\"117 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1992.246413\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1992.246413","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

描述了一种调度并发事务的策略，其中可以指定与事务相关的前提条件和效果。还提出了当检测到事务失败时的恢复过程。该调度算法的优点可以概括为:对于传统的事务模型，它比两阶段协议约束更少，特别是对于短事务;并且可以基于语义依赖进行并发控制。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Dependency-based concurrency control in logic-oriented object bases

A policy for scheduling concurrent transactions in which the preconditions and effects associated with the transactions can be specified is described. Also proposed is a recovery procedure for when transaction failures are detected. The advantages of the scheduling algorithm can be summarized as follows: for conventional transaction models, it is less constrained than the two-phased protocol, particularly for short transactions; and it can perform concurrency control based on semantic dependencies.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92

自引率

0.00%

发文量