Record Details

Scheduling transactions with temporal constraints: Exploiting data semantics

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Scheduling transactions with temporal constraints: Exploiting data semantics
 
Creator XIONG, M
RAMAMRITHAM, K
STANKOVIC, JA
TOWSLEY, D
SIVASANKARAN, R
 
Subject real-time databases
real-time database systems
temporal consistency
earliest deadline first
least slack first
data-deadline
transaction processing
 
Description 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 similarily 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.
 
Publisher IEEE COMPUTER SOC
 
Date 2011-07-31T15:03:16Z
2011-12-26T12:53:03Z
2011-12-27T05:40:09Z
2011-07-31T15:03:16Z
2011-12-26T12:53:03Z
2011-12-27T05:40:09Z
2002
 
Type Article
 
Identifier IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 14(5), 1155-1166
1041-4347
http://dspace.library.iitb.ac.in/xmlui/handle/10054/8153
http://hdl.handle.net/10054/8153
 
Language en