Skip to main content

Conceptual level concurrency control of relational update transactions

  • Dynamic Aspects Of Databases
  • Conference paper
  • First Online:

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

Abstract

The concurrency control problem is examined for transactions as they appear at the conceptual level in a concrete database model. Specifically, a class of widely accepted update transactions in relational databases is studied with respect to concurrency control. It is shown how static serializability testing, as well as dynamic scheduling, can be improved by making use of the semantic information available at the conceptual level on transactions and database constraints.

Extended Abstract

This author was supported in part by the National Science Foundation, under grant number IST-8511538.

This author was supported by the NATO Science Committee under a Postdoctoral Fellowship, Grant No. DAAD 300/402/508/7; this work was done while the author was visiting at UCSD.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., V. Vianu. Transactions in Relational Databases. Proc. 10th VLDB (1984) 46–56.

    Google Scholar 

  2. Abiteboul, S., V. Vianu. Equivalence and Optimization of Relational Transactions. JACM 35 (1988) 70–120.

    Google Scholar 

  3. Abiteboul, S., V. Vianu. Transactions and Integrity Constraints. Proc. 4th ACM PODS (1985) 193–204.

    Google Scholar 

  4. Abiteboul, S., V. Vianu. Deciding Properties of Transactional Schemas. Proc. 5th ACM PODS (1986) 235–239.

    Google Scholar 

  5. Bernstein, P. A., N. Goodman, M. Y. Lai. Analyzing Concurrency Control Algorithms When User and System Operations Differ. IEEE Trans. on Software Eng. 9 (1983) 233–239.

    Google Scholar 

  6. Bernstein, P. A., V. Hadzilacos, N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley (1987).

    Google Scholar 

  7. Date, C. J. A Guide to DB2. Addison-Wesley (1984).

    Google Scholar 

  8. Garcia-Molina, H. Using Semantic Knowledge for Transaction Processing in a Distributed Database. ACM TODS 8 (1983) 186–213.

    Google Scholar 

  9. Gray, J. Notes on Data Base Operating Systems. in: R. Bayer, M. R. Graham, G. Seegmuller (eds.). Operating Systems — An Advanced Course. Springer LNCS 60 (1978) 393–481.

    Google Scholar 

  10. Karabeg, A., D. Karabeg, K. Papakonstantinou, V. Vianu. Axiomatization and Simplification Rules for Relational Transactions. Proc. 6th ACM PODS (1987), 254–259.

    Google Scholar 

  11. Karabeg, D., V. Vianu. Parallel Update Transactions, this proceedings.

    Google Scholar 

  12. Korth, H.F. Locking Primitives in a Database System. JACM 30 (1983) 55–79.

    Google Scholar 

  13. Kung, H. T., C. H. Papadimitriou. An Optimality Theory of Concurrency Control for Databases. Acta Informatica 19 (1983) 1–11.

    Google Scholar 

  14. Maier, D. The Theory of Relational Databases. Computer Science Press (1983).

    Google Scholar 

  15. Maier, D., A. O. Mendelzon, Y. Sagiv. Testing Implications of Data Dependencies. ACM TODS 4 (1979) 455–469.

    Google Scholar 

  16. Papadimitriou, C. H. The serializability of concurrent database updates. JACM 26 (1979) 631–653.

    Article  Google Scholar 

  17. Roesler, M., W. A. Burkhard. Concurrency Control Scheme for Shared Objects: A Peephole Approach Based on Semantics. Proc. 7th IEEE Int. Conf. on Distributed Computing Systems (1987), 224–231.

    Google Scholar 

  18. Schwarz, P. M., A. Z. Spector. Synchronizing Shared Abstract Data Types. ACM Trans. on Computer Systems 2 (1984) 223–250.

    Google Scholar 

  19. Ullman, J. Principles of Database Systems. Computer Science Press (1982), 2nd ed.

    Google Scholar 

  20. Vianu, V., G. Vossen. Conceptual Level Concurrency Control of Relational Update Transactions. Techn. Rep. CS 87–105, UCSD (October 1987).

    Google Scholar 

  21. Weihl, W., B. Liskov. Specification and Implementation of Resilient Atomic Data Types. ACM TOPLAS 7 (1985) 244–269.

    Google Scholar 

  22. Weikum, G. A Theoretical Foundation of Multi-Level Concurrency Control. Proc. 5th ACM PODS (1986) 31–42.

    Google Scholar 

  23. Yannakakis, M. Serializability by Locking. JACM 31 (1984) 227–244.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marc Gyssens Jan Paredaens Dirk Van Gucht

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vianu, V., Vossen, G. (1988). Conceptual level concurrency control of relational update transactions. In: Gyssens, M., Paredaens, J., Van Gucht, D. (eds) ICDT '88. ICDT 1988. Lecture Notes in Computer Science, vol 326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50171-1_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-50171-1_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50171-8

  • Online ISBN: 978-3-540-45943-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics