Application semantics and concurrency control of real-time data-intensive applications
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The semantics are discussed of data-intensive real-time applications for which serializability is too recursive for consistency management. By examining the semantics of these applications the authors formalize the concept of similarity which has been used on an ad hoc basis by application engineers to provide more flexibility in concurrency control. Weaker consistency requirements based on the similarity concept are proposed. The concept of similarity is used to extend the usual correctness criteria for transaction scheduling: finite-state, view, conflict serializability to their counterparts of final-state Delta -serializability, view Delta -serializability, and conflict Delta -serializability.Keywords
This publication has 8 references indexed in Scilit:
- Scheduling real-time transactionsACM Transactions on Database Systems, 1992
- On being optimistic about real-time constraintsPublished by Association for Computing Machinery (ACM) ,1990
- Concurrency control for distributed real-time databasesACM SIGMOD Record, 1988
- Enhancing availability in distributed real-time databasesACM SIGMOD Record, 1988
- On real-time transactionsACM SIGMOD Record, 1988
- Formal model of correctness without serializabiltyPublished by Association for Computing Machinery (ACM) ,1988
- SagasPublished by Association for Computing Machinery (ACM) ,1987
- Read-only transactions in a distributed databaseACM Transactions on Database Systems, 1982