Scheduling queries with relative consistency constraints

This paper studies the problem of scheduling preemptable queries with relative consistency constraints when the absolute consistency for real-time data objects is preserved. The single query schedule problem is studied first, then the multiple queries scheduling problem. An optimal algorithm and several heuristics for scheduling multiple queries are proposed. Experiments are also conducted to compare the performance of these algorithms.