DocumentCode
2617992
Title
Scheduling queries with relative consistency constraints
Author
Bai, Tian ; Li, Guohui ; Liu, YunSheng
Author_Institution
Coll. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China
fYear
2011
fDate
27-29 June 2011
Firstpage
2534
Lastpage
2537
Abstract
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.
Keywords
query processing; scheduling; absolute consistency; multiple queries scheduling problem; optimal algorithm; preemptable query scheduling; relative consistency constraints; single query schedule problem; Algorithm design and analysis; Heuristic algorithms; Processor scheduling; Real time systems; Schedules; Scheduling; Strontium; query schedule; real-time database; relative consistency;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Service System (CSSS), 2011 International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4244-9762-1
Type
conf
DOI
10.1109/CSSS.2011.5974545
Filename
5974545
Link To Document