The HiPAC project: combining active databases and timing constraints
ACM SIGMOD Record - Special Issue on Real-Time Database Systems
Evaluation of relational algebras incorporating the time dimension in databases
ACM Computing Surveys (CSUR)
Scheduling real-time transactions: a performance evaluation
ACM Transactions on Database Systems (TODS)
Data access scheduling in firm real-time database systems
Real-Time Systems - Special issue: real-time databases
Priority inheritance in soft real-time databases
Real-Time Systems - Special issue: real-time databases
Distributed and Parallel Databases - Special issue: Research topics in distributed and parallel databases
Applying update streams in a soft real-time database system
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
On being optimistic about real-time constraints
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Real-Time Data Semantics and Similarity-Based Concurrency Control
IEEE Transactions on Computers
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
On Transaction Boundaries in Active Databases: A Performance Perspective
IEEE Transactions on Knowledge and Data Engineering
Multiclass Query Scheduling in Real-Time Database Systems
IEEE Transactions on Knowledge and Data Engineering
Maintaining Temporal Consistency: Pessimistic vs. Optimistic Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Priority assignment in real-time active databases
The VLDB Journal — The International Journal on Very Large Data Bases
Scheduling transactions with temporal constraints: exploiting data semantics
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Similarity-based load adjustment for real-time data-intensive applications
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
SRDE-Application of Data Similarity to Process Control
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Real-Time Primary-Backup (RTPB) Replication with Temporal Consistency Guarantees
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Journal of Systems and Software
Real-Time Databases and Data Services
Real-Time Systems
Reading temporally consistent data in broadcast disks
ACM SIGMOBILE Mobile Computing and Communications Review
Wireless real-time on-demand data broadcast scheduling with dual deadlines
Journal of Parallel and Distributed Computing
Quality of Service Guarantee for Temporal Consistency of Real-Time Transactions
IEEE Transactions on Knowledge and Data Engineering
Location-dependent query processing under soft real-time constraints
Mobile Information Systems
DESH: overhead reduction algorithms for deferrable scheduling
Real-Time Systems
| Hi-index | 0.00 |
In this paper, issues involved in the design of a real-time database which maintains data temporal consistency are discussed. The concept of data-deadline is introduced and time cognizant transaction scheduling policies are proposed. Informally, data-deadline is a deadline assigned to a transaction due to the temporal constraints of the data accessed by the transaction. Further, two time cognizant forced wait policies which improve performance significantly by forcing a transaction to delay further execution until a new version of sensor data becomes available are proposed. A way to exploit temporal data similarity to improve performance is also proposed. Finally, these policies are evaluated through detailed simulation experiments. The simulation results show that taking advantage of temporal data semantics in transaction scheduling can significantly improve the performance of user transactions in real-time database systems. In particular, it is demonstrated that under the forced wait policy, the performance can be improved significantly. Further improvements result by exploiting data similarity.