The theory of database concurrency control
The theory of database concurrency control
Enhancing availability in distributed real-time databases
ACM SIGMOD Record - Special Issue on Real-Time Database Systems
Triggered real-time databases with consistency constraints
Proceedings of the sixteenth international conference on Very large databases
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Maintaining Temporal Consistency: Pessimistic vs. Optimistic Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
A Formal Characterization of Epsilon Serializability
IEEE Transactions on Knowledge and Data Engineering
Performance Characteristics of Epsilon Serializability with Hierarchical Inconsistency Bounds
Proceedings of the Ninth International Conference on Data Engineering
A semantic-based concurrency control protocol for real-time transactions
RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
Error Propagation Analysis of Real-Time Data Intensive Applications
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
Distributed pinwheel scheduling with end-to-end timing constraints
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
Scheduling transactions with temporal constraints: exploiting data semantics
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Concurrency Control for Mixed Transactions in Real-Time Databases
IEEE Transactions on Computers
Specification and Management of QoS in Real-Time Databases Supporting Imprecise Computations
IEEE Transactions on Computers
| Hi-index | 14.99 |
How to exploit application semantics to improve the performance of a real-time data-intensive application has been an active research topic in the past few years. Weaker correctness criteria and semantics-based concurrency control algorithms were proposed to provide more flexibility in reordering read and write events [4], [7], [8], [9], [18], [19], [22]. Distinct from past work, this paper exploits the trade-off between data consistency and system workload. The definition of similarity [8] is combined with the idea of transaction skipping to provide a theoretical foundation for reducing the workload of a transaction system. We also propose guidelines to adjust the execution frequencies of a static set of transactions and prove their correctness. The strengths of this work were verified by simulation experiments on an air traffic control example [20].