Real-time database — similarity and resource scheduling
- 1 March 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 25 (1) , 18-22
- https://doi.org/10.1145/381854.381873
Abstract
While much recent work has focussed on the performance of transaction systems where individual transactions have deadlines, our research addresses the semantics of data usage in real-time applications and its integration with real-time resource management, in particular, the timeless value of real-time data and the inherent path and not state-based constraints on concurrency control. Central to our research is the idea of similarity which is a reflexive, symmetric relation over the domain of a data object. By exploiting the similarity relation, we propose a class of efficient data-access policies for real-time data objects. We shall also discuss the design of a distributed real-time data-access interface. Our goal is to build a database facility which can support predictable real-time applications involving high-speed communication, information access, and multimedia.Keywords
This publication has 3 references indexed in Scilit:
- Formal model of correctness without serializabiltyPublished by Association for Computing Machinery (ACM) ,1988
- Read-only transactions in a distributed databaseACM Transactions on Database Systems, 1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973