[Previous [1] [2] [3] [4] [5] [6] [7] [8]

Journal of Inforamtion Science and Engineering, Vol. 16 No. 4, pp. 535-554 (July 2000)

On Optimistic Methods for Mobile Transactions*

San-Yih Hwang
Department of Information Management
National Sun Yat-Sen University
Kaohsiung, Taiwan 804, R.O.C.
E-mail: syhwang@mis.nsysu.edu.tw

We propose a new transaction execution model in a mobile environment where a subset of data items is cached by each mobile host. This execution model allows each mobile host to execute transactions locally and, before their commits, to request certification from the database server on the wired network. The database server certifies a commit request only when the execution of its pertaining transaction was consistent. This protocol behaves like the optimistic concurrency control mechanisms in traditional transaction processing systems. However, traditional optimistic algorithms cannot be applied directly to mobile environments. We propose three strategies for validation of commit requests by the database server. These strategies aim to minimize both the processing overhead and transaction abort ratio. We compare the performance of the proposed strategies via both complexity analysis and simulation and suggest guidelines for choosing the best algorithm for different operating regions.

Keywords: mobile computing, transaction management, databases, optimistic concurrency control, data cache and data replication

Full Text () Retrieve PDF document (200007_03.pdf)

Received November 13, 1998; revised July 9, 1999; accepted August 2, 1999.
Communicated by Yi-Bing Lin.
*This research was supported by the National Science Council, R.O.C., under grant NSC 86-2213-E-110-003.