{"title":"A Concurrency Control Algorithm Access to Temporal Data in Real-Time Database Systems","authors":"Qilong Han, Haiwei Pan, Guisheng Yin","doi":"10.1109/IMSCCS.2008.28","DOIUrl":null,"url":null,"abstract":"In this paper, we formalize and prove the correctness of a concurrency control algorithm for accessing to temporal data model in real-time database. A checking mechanism is proposed based on the semantic information of transaction deferrable time comparing transaction deadline with data deadline. The concurrency control algorithm improves the performance of real-time systems by evaluating data-deadline and transactions execution time, adjusting transaction validation rule and committing order. Theoretical analysis and example results demonstrate that the new algorithm can outperform the previous ones.","PeriodicalId":122953,"journal":{"name":"2008 International Multi-symposiums on Computer and Computational Sciences","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Multi-symposiums on Computer and Computational Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMSCCS.2008.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper, we formalize and prove the correctness of a concurrency control algorithm for accessing to temporal data model in real-time database. A checking mechanism is proposed based on the semantic information of transaction deferrable time comparing transaction deadline with data deadline. The concurrency control algorithm improves the performance of real-time systems by evaluating data-deadline and transactions execution time, adjusting transaction validation rule and committing order. Theoretical analysis and example results demonstrate that the new algorithm can outperform the previous ones.