Scheduling Periodic Jobs that Allow Imprecise Results
IEEE Transactions on Computers
Readings in database systems (2nd ed.)
Readings in database systems (2nd ed.)
Advances in real-time systems
Real-time database — similarity and resource scheduling
ACM SIGMOD Record
DeeDS towards a distributed and active real-time database system
ACM SIGMOD Record
Managing contention and timing constraints in a real-time database system
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Real-time computing with lock-free shared objects
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Value-cognizant admission control for RTDB systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Commit processing in distributed real-time database systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
| Hi-index | 0.00 |
Real-time database research has reached a point when a practical approach need to be found to combine academic research fruits with real world problems. It is generally believed that the transaction scheduling principles of the traditional database management is too stringent to meet real-time constraints. In this paper, we look at the real world problem and argue that the future will see the proliferation of federated database consisting of distributed heterogeneous subdatabases. We propose the similarity predicate to unify real-time constraints on applications of the federated database system. We then design a real-time SQL engine that sits between the distributed database and the applications that separates the database design from individual user application. The real-time part of the engine benefits from SQL standard and can be scaled from empty to very sophisticated.