Skip to main content

An Efficient Distributed Concurrency Control Algorithm using Two Phase Priority

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2001)

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

Included in the following conference series:

Abstract

Many concurrency control algorithms for distributed real-time database systems have been proposed. But there isn’t a representative concurrency control algorithm for replication environment. In this paper, we propose an efficient concurrency control algorithm for distributed real-time database systems in replication environment. The main ideas of this paper are promoting priority and trading of data. Promoting priority is that the priority of the transaction that enters into voting phase is elevated. Trading of data is that a holder in the voting phase can lend holding data to other transactions. The proposed algorithm does not cause priority inversion. Therefore it decreases the ratio of restarting transactions and guarantees a transaction to commit at its maximum. Also to reduce blocking times of transactions, it permits data of a transaction in the voting phase to lend to the others. It is shown through the performance evaluation that the proposed algorithm outperforms the existing algorithms such as DO2PL_PA and MIRROR.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Baothman, F., Sarje, A.K. and Joshi, R.C. “On optimistic concurrency control for RTDBS,” TENCON’ 98. 1998 IEEE Region 10 International Conference on Global Connectivity in Energy, Computer, Communication and Control Volume: 2, Page(s): 615–618 vol.2, 1998.

    Article  Google Scholar 

  2. Carey, M., and Linvy, M., “Conflict Detection Tradeoffs for Replicated Data,” ACM Transactions on Database Systems, Vol. 16, Page(s): 703–746, 1991.

    Article  Google Scholar 

  3. C. Mohan, B. Lindsay and R. Obermarck, “Transaction Management in the R* Distributed Database Management System”, ACM TODS, 11(4), 1986.

    Google Scholar 

  4. Haritsa, J..R. and Carey, M.J.; Livny, M. “Dynamic real-time optimistic concurrency control,” Real-Time Systems Symposium, Proceedings., 11th, 1990, Page(s): 94–103, 1990.

    Google Scholar 

  5. Michael J. Carey. and Miron Livny. “Distributed Concurrency Control Performance: A Study of Algorithm, Distribution, and Replication,” Proceedings of the 14th VLDB Conference, Los Angels, California Page(s): 13–25, 1988.

    Google Scholar 

  6. Son, S., “Advances In Real-Time Systems,” Prentice Hall, 1995.

    Google Scholar 

  7. Thomasian, A. “Distributed optimistic concurrency control methods for highperformance transaction processing,” Knowledge and Data Engineering, IEEE Transactions on Volume: 101, Jan.-Feb. 1998.

    Google Scholar 

  8. Xiong, M., Ramamritham, K., Haritsa, J., and Stankovic, J., “MIRROR: A State-Conscious Concurrency Control Protocol in Replicated Real-time Database,” Technical Report 98-36, Department of Computer Science, University of Massachusetts at Amherst, 1998.

    Google Scholar 

  9. E. Levy, H. Korth and A. Silberschatz, “An optimistic commit protocol for distributed transaction management”, Proc. of ACM SIGMOD Conf., May 1991.

    Google Scholar 

  10. Anderson, T., Breitbart, Y., Korth, H. and Wool, A., “Replication, Consistency, and Practicality: Are These Mutually Exclusive” Proceedings of the ACMSIGMOD 1998 International Conference on Management of Data, Seattle, WA., Page(s) 484–495, 1998.

    Google Scholar 

  11. Agrawal, R., Carey, M., and McVoy, L., “The Performance of Alternative Strategies for Dealing With Deadlocks in Database Management Systems”, IEEE TOSE, Dec 1987.

    Google Scholar 

  12. Ciciani, B., Dias, D.M., Yu, P.S., “Analysis of Replication in Distributed Database Systems,” IEEE Transactions on Knowledge and Data Engineering, Vol. 2,No.2, June 1990.

    Google Scholar 

  13. Gray, J., “Notes On Database Operating Systems,” in Operating Systems: An Advanced Course, R. Bayer, R. Graham, and G. Seegmuller, eds., Springer-verlag, 1979.

    Google Scholar 

  14. Ulusoy, O., “Processing Real-Time Transactions in a Replicated Database System,” Distributed and Parallel Databases, 2, Page(s) 405–436, 1994.

    Article  Google Scholar 

  15. Wu, K.L., Yu, P.S. and Pu, C., “Divergence Control for Epsilon-Serializability,” In Proceedings of Eighth International Conference on Data Engineering, Phoenix, February 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, J.S., Shin, J.R., Yoo, J.S. (2001). An Efficient Distributed Concurrency Control Algorithm using Two Phase Priority. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44759-8_90

Download citation

  • DOI: https://doi.org/10.1007/3-540-44759-8_90

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42527-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics