Advertisement

Flexible Integration of Optimistic and Pessimistic Concurrency Control in Mobile Environments

  • Kaleem A. Momin
  • K. Vidyasankar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1884)

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.

Keywords

Mobile computing Transaction processing Concurrency control Re-execution Pessimistic mode 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Alonso and H. F. Korth 1993. Database System Issues in Nomadic Computing, SIGMOD 5:388–392.CrossRefGoogle Scholar
  2. 2.
    D. Barbara and T. Imielinski 1994. Sleepers and Workaholics: Caching Strategies in Mobile Environments, SIGMOD 5:1–12.CrossRefGoogle Scholar
  3. 3.
    J. Gray, P. Helland, P. O’Neil and D. Shasha 1996. The Dangers of Replication and a Solution, Proc. SIGMOD, 173–182.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    H. T. Kung and J. T. Robinson 1981. On Optimistic Methods for Concurrency Control, ACM TODS, 6(2):213–226.CrossRefGoogle Scholar
  6. 6.
    K. A. Momin and K. Vidyasankar 1998. A Model for Transaction Execution in Mobile Environments, Proc. Intl. Conf. on Information Technology, India, 162–167.Google Scholar
  7. 7.
    K. A. Momin 1999. A Transaction Execution Model for Mobile Computing Environments, Master’s Thesis, Memorial University of Newfoundland, Canada.Google Scholar
  8. 8.
    V. R. Narasayya 1993. Distributed Transactions in a Mobile Computing System, Technical Report, University of Washington.Google Scholar
  9. 9.
    E. Pitoura and G. Samaras 1998. Data Management for Mobile Computing, Kluwer Academic Publishers.Google Scholar
  10. 10.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Kaleem A. Momin
    • 1
  • K. Vidyasankar
    • 1
  1. 1.Department of Computer ScienceMemorial University of NewfoundlandSt. John’sCanada

Personalised recommendations