Skip to main content

Optimistic Concurrency Control Based on Timestamp Interval for Broadcast Environment

  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2435))

Abstract

The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than that of the opposite direction. In addition, mobile computing systems generate mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and news updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance is degraded when previous schemes are applied to the broadcast environment. In this paper, we propose optimistic concurrency control based on timestamp interval for broadcast environment. The following requirements are satisfied by adapting weak consistency that is the most appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also adopt the Timestamp Interval protocol to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Shanmugasundaram, A. Nithrakashyap, R. Sivasankaran, and K. Ramamritham, “Efficient Concurrency Control for Broadcast Environments”, Proceedings ACM SIGMOD Conference, pp.85–96, June 1999

    Google Scholar 

  2. P.A. Bernstein, V. Hadzilacos, and N. Goodman, “Concurrency Control and Recovery in Database Systems”, Addison Wesley, Reading, Massachusetts, 1987.

    Google Scholar 

  3. P.M. Bober and M.J. Carey. “Multiversion Query Locking”, Proceedings 18 th VLDB Conference, Vancouver, Canada, August 1992.

    Google Scholar 

  4. W. Weihl, “Distributed Version Management for Read-Only Actions”, IEEE Transactions on Software Engineering, Vol.13, No.1, January 1987.

    Google Scholar 

  5. S. Acharya, R. Alonso. M. Franlikn, and S. Zdonik, “Broadcast Disks: Data Management for Asymmetric Communication Environments”, Proceedings ACM SIGMOD Conference, May 1997.

    Google Scholar 

  6. S. Acharya, M. Franklin, and S. Zdonik, “Disseminating Updates on Broadcast Disks”, Proceedings 22nd VLDB Conference, Mumbai, India, 1996

    Google Scholar 

  7. D. Barbara and T. Imielinsky, “Sleepers and Workholics: Caching in Mobile Environment”, Proceedings ACM SIGMOD Conference, pp.1–12, June 1994.

    Google Scholar 

  8. J. Jing, A. Elmagarmid, A. Helal, and R. Alonso, “Bit-Sequences: An Adaptive Cache Invalidation Method in Mobile Client/Server Environment”, ACM/Baltzer Mobile Networks and Applications, Vol.2, No.2, 1997.

    Google Scholar 

  9. K.L. Wu, P.S. Yu, and M.S. Chen, “Energy-efficient Caching for Wireless Mobile Computing”, Proceedings 12th IEEE ICDE Conference, pp. 336–343, Feb. 1996.

    Google Scholar 

  10. C.F. Fong, C.S. Lui, and M.H. Wong, “Quantifying Complexity and Performance Gains of Distributed Caching in a Wireless Network Environment”, Proceedings 13th IEEE ICDE Conference, pp. 104–113, April 1997

    Google Scholar 

  11. E. Pitoura, “Supporting Read-Only Transactions in Wireless Broadcasting”, Proceedings 9th DEXA Workshop, pp. 428–433, 1998.

    Google Scholar 

  12. E. Pitoura and P. Chrysanthis, “Scalable Processing of Read-Only Transactions in Broadcast Push”, Proceedings International Conference on Distributed Computing Systems, Austin, 1999.

    Google Scholar 

  13. G. Herman et al., “The Datacycle Architecture for Very High Throughput Data-base Systems”, Proceedings ACM SIGMOD Conference, 1987.

    Google Scholar 

  14. Lee V., Son S. H., and Lam K.: “On the Performance of Transaction Processing in Broadcast Environments”, Proceedings International Conference on Mobile Data Access (MDA’99), Hong Kong, Dec 1999.

    Google Scholar 

  15. T. Harder, “Observations on Optimistic Concurrency Control Schemes”, Information Systems, Vol.9, No.2, pp. 111–120, 1984.

    Article  Google Scholar 

  16. P. Xuan et al., “Broadcast on Demand-Efficient and Timely Dissemination of Data in Mobile Environments”, Proceedings IEEE Real-Time Technology and Applications Symposium, pp. 38–48, June 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, U., Hwang, B. (2002). Optimistic Concurrency Control Based on Timestamp Interval for Broadcast Environment. In: Manolopoulos, Y., Návrat, P. (eds) Advances in Databases and Information Systems. ADBIS 2002. Lecture Notes in Computer Science, vol 2435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45710-0_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-45710-0_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44138-0

  • Online ISBN: 978-3-540-45710-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics