Welcome to DiSC 2002
SIGMOD 2001
PODS 2001
SIGMOD RECORD 2001
CIKM 2001
CoopIS 2001
DASFAA 2001
DASFAA 2000
DBPL 2001
Data Engineering Bul
DEXA_EC-WEB 2001
DMKD 2001
DPDJ 2001
HYPERTEXT 2001
ICDE 2001
ICDM 2001
ICDT 2001
JCDL 2001
KDD 2001
KDD_EXPLORATIONS 20
KRDB 2001
MDM 2001
= MDM'01 Website
<<< = MDM'01 papers>>>
= Industrial Talks
= Posters
MIR 2001
MIS 2001
RIDE 2001
SBBD 2001
SIGIR 2001
SIGIR FORUM 2001
SSDBM 2001
SSTD 2001
TODS 2001
TIME 2001
VLDB 2001
VLDBJ 2001

Optimistic Scheduling Algorithm for Mobile Transactions Based on Reordering


SungSuk Kim, Chong-Sun Hwang, HeonChang Yu, and SangKeun Lee

  View Paper (PDF)  

Return to Data Broadcasting


Abstract

In this paper, we propose transaction processing algorithms in the broadcast environment. We take an optimistic approach for mobile transactions because (a) it needs a small number of messages for maintaining transactional consistency, and (b) it can make good use of broadcasting facilities from the servers. The more data conflicts occur, however, the more mobile transactions may be aborted. Thus, we accept reordering technique to reduce the number of aborted transactions; that is, whenever any kind of conflict is found from broadcast information, the system determine the operation orders without violating transactional consistency, not just aborting the mobile transactions unconditionally. The proposed algorithms - O-Post algorithm for update transaction and O-Pre algorithm for read-only transaction - do not need much information from the server while resulting in serializable executions. Finally, we also evaluate the performance behavior through simulation study.


DiSC'02 © 2003 Association for Computing Machinery