Skip to main content

System Level Concurrency Control for Distributed Database Systems

  • Chapter
Fundamental Problems in Computing

Abstract

A distributed database system is one in which the database is spread among several sites and application programs “move” from site to site to access and update the data they need. The concurrency control is that portion of the system that responds to the read and write requests of the application programs. Its job is to maintain the global consistency of the distributed database while ensuring that the termination of the application programs is not prevented by phenomena such as deadlock. We assume each individual site has its own local concurrency control which responds to requests at that site and can only communicate with concurrency controls at other sites when an application program moves from site to site, terminates, or aborts.

This paper presents designs for several distributed concurrency controls and demonstrates that they work correctly. It also investigates some of the implications of global consistency of a distributed database and discusses phenomena that can prevent termination of application programs.

A preliminary version of this paper appeared in the Proceedings of the Second Berkeley Workshop on Distributed Data Management and Computer Networks, Berkeley, California, May 1977.

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.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. F. Achim. Data base networks–an overview. Management Informatics, 3(1):13–29, 1974.

    Google Scholar 

  2. M. M. Astrahan System R: Relational approach to database management. ACM Trans. Database Syst., 1(2):97–137, 1976.

    Article  Google Scholar 

  3. R. Bayer. On the integrity of data bases and resource locking. In H. Hasselmeier and W. G. Spruth, editors, Data Base Systems. Lecture Notes in Computer Science, volume 39. Springer, Berlin, 1976.

    Google Scholar 

  4. L. A. Bjork. Recovery scenario for a DB/DC system. In Proceedings of the ACM National Conference, pages 142–146, 1973.

    Google Scholar 

  5. D. D. Chamberlin, R. F. Boyce, and I. L. Traiger. A deadlock-free scheme for resource locking in a database environment. In Information Processing 74, pages 340–343. North-Holland, Amsterdam, 1974.

    Google Scholar 

  6. W. W. Chu and G. Ohlmacher. Avoiding deadlock in distributed data bases. In Proceedings of the ACM National Conference, pages 156–160, 1974.

    Google Scholar 

  7. E. G. Coffman, Jr., M. J. Eliphick, and A. Shoshani. System deadlocks. Computing Surveys, 3(2):67–78, 1971.

    Article  MATH  Google Scholar 

  8. P. J. Courtois, F. Heymans, and D. L. Parnas. Concurrent control with “readers” and “writers”. Comm. ACM, 14(10):667–669, 1971.

    Article  Google Scholar 

  9. C. T. Davies. Recovery semantics for a DB/DC system. In Proceedings of the ACM National Conference, pages 136–141, 1973.

    Google Scholar 

  10. M. E. Deppe and J. P. Fry. Distributed data bases–a summary of research. Computer Networks, 1(3):130–138, 1976.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  12. G. C. Everest. Concurrent update control and data base integrity. In J. W. Klimbie and K. L. Koffeman, editors, Data Base Management, pages 241–270. North-Holland, Amsterdam, 3rd edition, 1974.

    Google Scholar 

  13. B. M. Fossum. Database integrity as provided for by a particular data base management system. In J. W. Klimbie and K. L. Koffeman, editors, Data Base Management, pages 271–288. North-Holland, Amsterdam, 3rd edition, 1974.

    Google Scholar 

  14. General Electric Research and Development Center. MADMAN user manual. Schenectady, NY, 1976.

    Google Scholar 

  15. J., Gray. Locking in a decentralized computer system. Technical Report Res. Rep. RJ 1346, IBM Res. Lab., San Jose, Calif., 1974.

    Google Scholar 

  16. J. N. Gray, R. A. Lorie, and G. R. Putzolu. Granularity of locks in a shared data base. In Proc. Int. Conf. on Very Large Data Bases, pages 428–451, Framingham, 1975. (Available from ACM, New York).

    Google Scholar 

  17. I. Greif. Formal problem specifications for readers and writers scheduling. In Proc. MRI Symp. on Comptr. Software Eng., 1976. Polytechnic Inst. of New York.

    Google Scholar 

  18. D. A. Hawley, J. S. Knowles, and E. E. Tozer. Database consistency and the CODASYL DBTG proposals. Computer J., 18(3):206–212, 1975.

    Article  MATH  Google Scholar 

  19. C. A. R. Hoare. Monitors: An operating system structuring concept. Comm. ACM, 17(10):549–557, 1974.

    Article  MATH  Google Scholar 

  20. P. R. Johnson and R. H. Thomas. The maintenance of duplicate databases. Technical Report Doc. 31507, Network Information Center (NIC), 1975.

    Google Scholar 

  21. P. F. King and A. J. Collmeyer. Database sharing–an efficient mechanism for supporting concurrent processes. In Proc. AFIPS 1973 NCC, volume 42, pages 271–275. AFIPS Press, Montvale, 1973.

    Chapter  Google Scholar 

  22. L. Lamport, Time clocks and the ordering of events in a distributed system. Technical Report, Massachusetts Computer Associates, Wakefield, Mass., March 1976.

    Google Scholar 

  23. P. P. Macri. Deadlock detection and resolution in a CODASYL based data management system. In ACM-SIGMOD Int. Conf. on Management of Data, pages 45–49, 1976.

    Google Scholar 

  24. G. Schlageter. Access synchronization and deadlock-analysis in database systems: An implementation-oriented approach. Inform. Syst., 1:97–102, 1975.

    Article  MATH  Google Scholar 

  25. L. C. Sekino. Multiple concurrent updates. In Proc. Int. Conf. on Very Large Data Bases, pages 505–507, Framingham, 1975. (Available from ACM, New York).

    Google Scholar 

  26. R. E. Stearns, P. M. Lewis II, and D. J. Rosenkrantz. Concurrency controls for database systems. In Proc. 17th Annual Symp. on Foundations of Comptr. Sci., pages 19–32. Houston, 1976. (Available from IEEE, Long Beach, Calif.).

    Google Scholar 

  27. M. Stonebraker and E. Neuhold. A distributed data base version of INGRES. In Proc. Second Berkeley Workshop on Distributed Data Management and Computer Networks, pages 19–36, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science + Business Media B.V.

About this chapter

Cite this chapter

Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M. (2009). System Level Concurrency Control for Distributed Database Systems. In: Ravi, S.S., Shukla, S.K. (eds) Fundamental Problems in Computing. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-9688-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-9688-4_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-9687-7

  • Online ISBN: 978-1-4020-9688-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics