Abstract
Limited execution capability, weak connections with the fixed network, frequent disconnections, and mobility dictate naturally an optimistic mode for transaction execution at mobile hosts (MH): the relevant computation is performed at MHs with cached data to provide quick response to the user, but the execution is validated against concurrent transactions and ACID properties maintained at the fixed network. Some of the proposals in the literature to reduce the likelihood of invalidation and thus increase the meaningfulness of computation at MH are: (i) If the validation fails, the transaction could be re-executed and accepted even when the results differ from the original ones but within certain limits; (ii) Validation/re-execution idea can be extended to several intermediate stages and the computation at MH adjusted with respect to changes in the database state at the fixed network. In this paper, we strengthen the computation at MH further by facilitating partial guarantee against invalidation. This is accomplished by switching the computation to a pessimistic mode. Varying degrees of pessimism are provided. They balance the guarantee against its effect on other transactions’ executions.
This research is supported in part by the Natural Sciences and Engineering Research Council of Canada Individual Research Grant OGP0003182.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Alonso and H. F. Korth 1993. Database System Issues in Nomadic Computing, SIGMOD 5:388–392.
D. Barbara and T. Imielinski 1994. Sleepers and Workaholics: Caching Strategies in Mobile Environments, SIGMOD 5:1–12.
J. Gray, P. Helland, P. O’Neil and D. Shasha 1996. The Dangers of Replication and a Solution, Proc. SIGMOD, 173–182.
H. Koch, L. Krombholz and O. Theel 1993. A Brief Introduction into the World of ‘Mobile Computing’, Tech. Report, University of Darmstadt, THD-BS-1993-03.
H. T. Kung and J. T. Robinson 1981. On Optimistic Methods for Concurrency Control, ACM TODS, 6(2):213–226.
K. A. Momin and K. Vidyasankar 1998. A Model for Transaction Execution in Mobile Environments, Proc. Intl. Conf. on Information Technology, India, 162–167.
K. A. Momin 1999. A Transaction Execution Model for Mobile Computing Environments, Master’s Thesis, Memorial University of Newfoundland, Canada.
V. R. Narasayya 1993. Distributed Transactions in a Mobile Computing System, Technical Report, University of Washington.
E. Pitoura and G. Samaras 1998. Data Management for Mobile Computing, Kluwer Academic Publishers.
K. Vidyasankar and V. V. Raghavan 1985. Highly Flexible Integration of the Locking and the Optimistic Approaches of Concurrency Control, Proc. 9th COMP-SAC, 489–494.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Momin, K.A., Vidyasankar, K. (2000). Flexible Integration of Optimistic and Pessimistic Concurrency Control in Mobile Environments. In: Štuller, J., Pokorný, J., Thalheim, B., Masunaga, Y. (eds) Current Issues in Databases and Information Systems. ADBIS DASFAA 2000 2000. Lecture Notes in Computer Science, vol 1884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44472-6_29
Download citation
DOI: https://doi.org/10.1007/3-540-44472-6_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67977-6
Online ISBN: 978-3-540-44472-5
eBook Packages: Springer Book Archive