Skip to main content

Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols

  • Session 5 Database Theory
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1987)

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

  • 115 Accesses

Abstract

Three different types of consistencies, viz., semiweak, weak, and strong, of a read-only transaction in a schedule s of a set T of transactions are defined and these are compared with the existing notions of consistencies of a read-only transaction in a schedule. We present a technique that enables a user to control the consistency of a read-only transaction in heterogeneous locking protocols. Since the weak consistency of a read-only transaction improves concurrency in heterogeneous locking protocols, the users can help to improve concurrency in heterogeneous locking protocols by supplying the consistency requirements of read-only transactions. A heterogeneous locking protocol P' derived from a locking protocol P that uses exclusive mode locks only and ensures serializability need not be deadlock-free. We present a sufficient condition that ensures the deadlock-freeness of P′, when P is deadlock-free and all the read-only transactions in P′ are two phase.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buckley, G. N., Silberschatz, A.: On the heterogeneous guard locking protocol. The Computer Journal, 27, 1 (1984), pp.86–87.

    Article  Google Scholar 

  2. Buckley, G. N., and Silberschatz, A.: Beyond two phase locking. J. ACM, 32,2(Apr. 1985),314–326.

    Article  Google Scholar 

  3. Chan, A., and Gray, R.: Implementing distributed read-only transactions. IEEE Trans. Soft. Eng. SE-11, 2(Feb. 1985), 205–212.

    Google Scholar 

  4. Casanova, M. A.: The concurrency control problem for database systems. Lecture Notes in Computer Science, vol. 116, Berlin-Heidelberg-New York, Springer 1981.

    Google Scholar 

  5. Dasgupta, P., and Kedem, Z. M.: A non-2-phase locking protocol for general databases. In Proc. of the 8th Int. Conference on Very Large Databases, Oct. 1983, 92–96.

    Google Scholar 

  6. Eswaran, K. P., Gray, J. N., Lorie, R. A., and Traiger, I. L.: The notions of consistency and predicate locks in a database system. Comm. ACM, 19,11(Nov. 1976),624–633.

    Article  Google Scholar 

  7. Garcia-Molina, H.: Read-only transactions in distributed databases. ACM Trans. Database Syst., 7, 2(Jun. 1982),209–234.

    Article  Google Scholar 

  8. Hansdah, R. C., and Patnaik, L. M.: Update serializability in locking. In Proc. of the International Conference on Database Theory, Rome, Italy, Sept. 1986(Lecture Notes in Computer Science, vol. 243, pp. 171–185).

    Google Scholar 

  9. Kedem, Z. M., and Silberschatz, A.: A characterization of database graphs admitting a simple locking protocol. Acta Informatica, 16, 1(1981), 1–13.

    Article  Google Scholar 

  10. Kedem, Z. M., and Silberschatz, A.: Non-two phase locking protocols with shared and exclusive locks. In Proc. of the 6th Int. Conf. on VLDB, Montreal, 1980,309–317.

    Google Scholar 

  11. Kedem, Z. M., and Silberschatz, A.: Locking protocols from exclusive to shared locks. J. ACM, 30, 4(Oct.1983),787–804.

    Article  Google Scholar 

  12. Korth, H.: Locking protocols: general lock classes and deadlock freedom. Ph.D. Thesis, Princeton University, Jun. 1981.

    Google Scholar 

  13. Kung, H. T., and Papadimitriou, C. H.: An optimality theory of concurrency control in databases. Acta Informatica, 19, 1(1983), 1–12.

    Article  Google Scholar 

  14. Mohan, C.: Strategies for enhancing concurrency and managing deadlocks in database locking protocols. Ph.D. Thesis, Dept. of Computer Science, University of Texas at Austin, 1981.

    Google Scholar 

  15. Mohan, C., Fussel, D., and Silberschatz, A.: Compatibility and commutativity of lock modes. Information and control,61,1(April 1984), 38–64.

    Article  Google Scholar 

  16. Papadimitriou, C. H.: The serializability of concurrent database updates. J. ACM, 29,4(Oct. 1979), 631–653.

    Article  Google Scholar 

  17. Silberschatz, A., and Kedem, Z. M.: Consistency in hierarchical database systems. J. ACM, 27,1(Jan. 1980), 72–80.

    Article  Google Scholar 

  18. Silberschatz, A., and Kedem, Z. M.: A family of locking protocols for database systems that are modeled by directed graphs. IEEE Trans. Soft. Engg., SE-8,6(Nov. 1982), 558–602.

    Google Scholar 

  19. Stearns, R. E., Lewis, P. M. II, and Rosenkrantz, D. Z.: Concurrency control for database systems. In Proc. of the 17th Symp. on Foundations of Computer Science, Oct.1976, 19–32.

    Google Scholar 

  20. Ullman, J. D.: Principles of database systems. Computer Science Press Inc., Potomac, Md., 1982.

    Google Scholar 

  21. Yannakakis, M.: Serializability by locking. J. ACM, 31, 2(Apr. 1984), 227–244.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Kesav V. Nori

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hansdah, R.C., Patnaik, L.M. (1987). Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18625-5_55

Download citation

  • DOI: https://doi.org/10.1007/3-540-18625-5_55

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48033-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics