A New Optimistic Concurrency Control Method for Mobile Transactions


The KIPS Transactions:PartD, Vol. 10, No. 3, pp. 439-446, Jun. 2003
10.3745/KIPSTD.2003.10.3.439,   PDF Download:

Abstract

A crucial limitation in environments where data is broadcast to very large client populations is the low bandwidth available for clients to communicate with servers. Many advanced applications are developed in mobile computing environments, but conventional concurrency controls are not suitable because of the low bandwidth of wireless network. In this paper, we propose a new optimistic concurrency control protocol for mobile transactions. In this protocol, mobile read-only transactions can be completed locally at the clients without additional communication, only mobile update transactions are sent to the server for global validation. Our protocol reduces unnecessary aborts occurred in the previous study using only conflict information. In addition to, our algorithm can detect and resolve non-serializable execution using by data table maintained in a server.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
C. Y. Kim and S. C. Bae, "A New Optimistic Concurrency Control Method for Mobile Transactions," The KIPS Transactions:PartD, vol. 10, no. 3, pp. 439-446, 2003. DOI: 10.3745/KIPSTD.2003.10.3.439.

[ACM Style]
Chi Yeon Kim and Seok Chan Bae. 2003. A New Optimistic Concurrency Control Method for Mobile Transactions. The KIPS Transactions:PartD, 10, 3, (2003), 439-446. DOI: 10.3745/KIPSTD.2003.10.3.439.