https://scholars.lib.ntu.edu.tw/handle/123456789/289779
標題: | Real-time data semantics and similarity-based concurrency control | 作者: | Mok, A.K. TEI-WEI KUO |
公開日期: | 2000 | 卷: | 49 | 期: | 11 | 起(迄)頁: | 1241-1254 | 來源出版物: | IEEE Transactions on Computers | 摘要: | This paper formalizes the concept of similarity which has been used on an ad hoc basis by application engineers to provide more flexibility in concurrency control. We show how the usual correctness criteria of concurrency control, namely, final-state, view, and conflict serializability, can be weakened to incorporate similarity. We extend the weakened correctness criteria in <16] for real-time applications which may run continually, have concurrent transaction executions, or skip unimportant computations. A semantic approach based on the similarity concept is then taken to propose a sufficient condition for scheduling real-time transactions without locking of data. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-0034314444&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/289779 |
DOI: | 10.1109/12.895940 | SDG/關鍵字: | Concurrency control; Data structures; Parallel processing systems; Scheduling; Semantics; Theorem proving; Schedule correctness; Serializability; Similarity; Database systems |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。