Skip to main content
Log in

A Transaction Model to Improve Data Availability in Mobile Computing

  • Published:
Distributed and Parallel Databases Aims and scope Submit manuscript

Abstract

We incorporate a prewrite operation before a write operation in a mobile transaction to improve data availability. A prewrite operation does not update the state of a data object but only makes visible the future value that the data object will have after the final commit of the transaction. Once a transaction reads all the values and declares all the prewrites, it can pre-commit at mobile host (MH) (computer connected to unreliable mobile communication network). The remaining transaction's execution (writes on database) is shifted to the mobile service station (MSS) (computer connected to the reliable fixed network). Writes on database consume time and resources and are therefore shifted to MSS and delayed. This reduces wireless network traffic congestion. Since the responsibility of expensive part of the transaction's execution is shifted to the MSS, it also reduces the computing expenses at mobile host. A pre-committed transaction's prewrite values are made visible both at mobile and at fixed database servers before the final commit of the transaction. Thus, it increases data availability during frequent disconnection common in mobile computing. Since a pre-committed transaction does not abort, no undo recovery needs to be performed in our model. A mobile host needs to cache only prewrite values of the data objects which take less memory, transmission time, energy and can be transmitted over low bandwidth. We have analysed various possible schedules of running transactions concurrently both at mobile and fixed database servers. We have discussed the concurrency control algorithm for our transaction model and proved that the concurrent execution of our transaction processing model produces only serializable schedules. Our performance study shows that our model increases throughput and decreases transaction-abort-ratio in comparison to other lock based schemes. We have briefly discussed the recovery issues and implementation of our model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. D. Agrawal, A.El. Abbadi, and A.E. Lang, “The performance of protocols based on locks with ordered sharing,” IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 5, pp. 805–818, 1994.

    Google Scholar 

  2. D. Agrawal and S. Sengupta, “Modular synchronization in multiversion databases: Version control and concurrency control,” in ACM Proceedings of SIGMOD, ACM Press: New York, 1989, pp. 408–417.

    Google Scholar 

  3. N. Barghouti and G. Kaiser, “Concurrency control in advanced database applications,” ACM Computing Surveys, vol. 23, no. 3, pp. 269–317, 1991.

    Google Scholar 

  4. P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley Publishing Co., USA, 1987.

    Google Scholar 

  5. B. Bhargava and J. Riedl, “A model for adaptable systems for transaction processing,” IEEE Transaction on Knowledge and Data Engineering, vol. 1, no. 4, pp. 433–449, 1989.

    Google Scholar 

  6. P. Bober and C.J. Michael, “On mixing queries and transactions via multiversion locking,” Computer Science Department, University of Wisconsin-Madison, Technical Report, Nov., 1991.

  7. A. Chan, S. Fox, W. Lin, A. Nori, and D. Ries, “The implementation of an integrated concurrency control and recovery scheme,” in ACM Proceedings of SIGMOD, ACM Press, New York, 1982, pp. 184–191.

    Google Scholar 

  8. P.K. Chrysanthis, “Transaction processing in a mobile computing environment,” in Proceedings of IEEE Workshop on Advances in Parallel and Distributed Systems, 1993, pp. 77–82.

  9. M.H. Eich and A. Helal, “A mobile transaction model that captures both data and movement behaviour,” ACM/Baltzer Journal on Special Topics on Mobile Networks and Applications, vol. 2, no. 2, pp. 149–162, 1997.

    Google Scholar 

  10. P.A. Franaszek, J.T. Robinson, and A. Thomasian, “Concurrency control for high contention environments,” ACM Transactions on Database Systems, vol. 17, no. 2, pp. 304–345, 1992.

    Google Scholar 

  11. S. Goel, B. Bhargava, and S.K. Madria, “An adaptable constrained locking protocol for high data contention environments,” in Proceedings of IEEE for 6th Intl. Conference on Database Systems for Advanced Applications (DASFAA,99), Taiwan, 1999.

  12. T. Imielinksi and B.R. Badrinath, “Wireless mobile computing: Challenges in data management,” Communications of ACM, vol. 37, no. 10, pp. 18–28, 1994.

    Google Scholar 

  13. R. Kataoka, T. Satoh, and U. Inoue, “A multiversion concurrency control algorithm for concurrent execution of partial update and bulk retrieval transactions,” in Proceedings 10th Intl. Phoenix Conference on Computers and Communications, IEEE Computer Society Press: New Jersey, 1991, pp. 130–136.

    Google Scholar 

  14. J. Kistler and M. Satyanarayanan, “Disconnected operation in the coda file system,” ACM Transactions on Computer Systems, vol. 10, no. 1, pp. 3–25, 1992.

    Google Scholar 

  15. Q. Lu and M. Satyanaraynan, “Improving data consistency in mobile computing using isolation-only transactions,” in Proceedings of the Fifth Workshop on Hot Topics in Operating Systems, Washington, 1995.

  16. S.K. Madria, “Concurrency control and recovery algorithms in nested transaction environment and their proofs of correctness,” Ph.D. Thesis, Department of Mathematics, Indian Institute of Technology, Delhi, 1995.

    Google Scholar 

  17. S.K. Madria, “A prewrite transaction model,” in the Proceedings of 3rd International Baltic Workshop on Database and Information Systems, Riga, Latvia, 1998.

  18. S.K. Madria, “Transaction models for mobile computing,” in Proceedings of 6th IEEE Singapore International Conference on Network, World Scientific, Singapore, 1998.

  19. S.K. Madria and B. Bhargava, “System defined prewrites to increase concurrency in databases,” in Proceedings of the First East-Europian Symposium on Advances in Databases and Information Systems, ADBIS'97 (sponsored by ACM-SIGMOD), St.-Petersburg (Russia), Sept. 97, pp. 18–22.

  20. S.K. Madria and B. Bhargava, “A transaction model for mobile computing,” in IEEE CS Proceedings of International Database Engineering and Application Symposium (IDEAS'98), Cardiff, U.K., 1998.

  21. S.K. Madria, S.N. Maheshwari, B. Chandra, and B. Bhargava, “Crash recovery algorithm in an open and safe nested transaction model,” in Proceedings of 8th International Conference on Database and Expert System Applications (DEXA'97), France, Sept.97, Lecture Notes in Computer Science, vol. 1308, Springer Verlag, France.

  22. S.K. Madria and M. Mohania, “A study on mobile data and transaction management,” Research Report CIS-98-007, Advanced Computing Research Centre, School of Computer and Information Science, University of South Australia, Adelaide, Australia, June, 1998.

    Google Scholar 

  23. J.E.B. Moss, “Nested transactions: An approach to reliable distributed computing,” Ph.D. Thesis, also, Technical Report MIT/LCS/TR-260 MIT Laboratory for Computer Science, Cambridge, MA., April, 1981.

    Google Scholar 

  24. T. Nakajima, “Commutativity based concurrency control for multiversion objects,” in Proceedings of the International Workshop on Distributed Object Management, 1992, pp. 101–119.

  25. C.H. Papadimitriou, “The serializability of concurrent database updates,” Journal of ACM, vol. 26, no. 4, pp. 631–653, 1979.

    Google Scholar 

  26. E. Pitoura and B. Bhargava, “Dealing with mobility: Issues and research challenges,” Technical Report TR-93-070, Department of Computer Sciences, Purdue University, IN, 1993.

    Google Scholar 

  27. E. Pitoura and B. Bhargava, “Building information systems for mobile environments,” in Proceedings of 3rd International Conference on Information and Knowledge Management, 1994, pp. 371–378.

  28. E. Pitoura and B. Bhargava, “Maintaining consistency of data in mobile computing environments,” in Proceedings of 15th International Conference on Distributed Computing Systems, June, 1995. Extended version to appear in IEEE TKDE, 2000.

  29. C. Pu, G. Kaiser, and Hutchinson, “Split-transactions for open-ended activities,” in Proceedings of the 14th VLDB Conference, 1988.

  30. C. Pu and A. Leff, “Replica control in distributed systems: An asynchronous approach,” in Proceedings of the ACM SIGMOD, 1991, pp. 377–386.

  31. K. Ramamritham and P.K. Chrysanthis, “Ataxonomy of correctness criterion in database applications,” Journal of Very Large Databases, vol. 5, no. 1, pp. 85–97, 1996.

    Google Scholar 

  32. K. Salem, H. GarciaMolina, and J. Shands, “Altruistic locking,” ACM Transactions on Database Systems, vol. 19, no. 1, pp. 117–165, 1994.

    Google Scholar 

  33. G.D. Walborn and P.K. Chrysanthis, “Supporting semantics-based transaction processing in mobile database applications,” in Proceedings of 14th IEEE Symposium on Reliable Distributed Systems, 1995, pp. 31–40.

  34. W.E. Weihl, “Distributed version management for read-only actions,” IEEE Transactions Software Engineering, vol. 13, no. 1, pp. 55–64, 1987.

    Google Scholar 

  35. W.E. Weihl, “Commutativity-based concurrency control for abstract data types,” IEEE Transactions on Computers, vol. 37, no. 12, pp. 1488–1505, 1988.

    Google Scholar 

  36. S.K. Madria, M. Mohania, S. Bhowmick, and B. Bhargava, “A survey on mobile data and transaction management issues,” under revision in Information Science Journal.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Madria, S.K., Bhargava, B. A Transaction Model to Improve Data Availability in Mobile Computing. Distributed and Parallel Databases 10, 127–160 (2001). https://doi.org/10.1023/A:1019232412740

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019232412740

Navigation