Real-time data semantics and similarity-based concurrency control

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

14 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)1241-1254
Journal / PublicationIEEE Transactions on Computers
Volume49
Issue number11
Online publishedNov 2000
Publication statusPublished - Nov 2000
Externally publishedYes

Abstract

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.

Research Area(s)

  • Concurrency control, schedule correctness, real-time database, serializability, similarity