Skip to main content
SpringerLink
Log in

An Optimistic Concurrency Control Protocol for Replicated Databases

  • Chapter
Book cover Fundamental Problems in Computing

  • 1040 Accesses

Abstract

This paper presents an optimistic approach to transaction management for replicated databases. We propose a new transaction management protocol that guarantees global serializability and freedom from distributed deadlocks without relying on any properties of the DBMSs running at the local sites. In comparison to prior protocols, this protocol reduces the communication required to coordinate transactions by a factor of r, where r is the average number of operations per transaction. We also consider implementation issues in reducing message overhead and discuss failure recovery.

Our approach is based on the concept of virtual sites introduced in Breitbart and Korth (Proc. SIGACT-SIGART-SIGMOD Symp. Principles of Database Systems, pages 173–184, Tucson, AZ, 1997; J. Computer and System Sciences, 59(1):29–69, 1999). The optimistic protocol of this paper allows a significantly higher degree of concurrency than the protocol presented there.

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

Access this chapter

Log in via an institution
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. D. Agrawal, A. ElAbbadi, and R. C. Steinke. Epidemic algorithms in replicated databases. In Proc. 16th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 161–172, Tucson, AZ, 1997.

    Google Scholar 

  2. F. Akal, Y. Breitbart, T. Grabs, H. Schek, C. Turker, and L. Veen. Fine-grained replication, and scheduling with freshness and correctness guarantees. In Proc. 31st Intl. Conf. VLDB, pages 565–576, Trondheim, Norway, 2005.

    Google Scholar 

  3. T. Anderson, Y. Breitbart, H. F. Korth, and A. Wool. Replication, consistency, and practicality: Are these mutually exclusive? In Proc. 1998 ACM SIGMOD Intl. Conf. Management of Data, pages 484–495, Seattle, WA, 1998.

    Google Scholar 

  4. P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison–Wesley, Reading, 1987.

    Google Scholar 

  5. Y. Breitbart and H. F. Korth. Replication and consistency: Being lazy helps sometimes. In Proc. SIGACT-SIGART-SIGMOD Symp. Principles of Database Systems, pages 173–184, Tucson, AZ, 1997.

    Google Scholar 

  6. Y. Breitbart and H. F. Korth. Replication and consistency in distributed environment. J. Computer and System Sciences, 59(1):29–69, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  7. Y. Breitbart, H. Garcia-Molina, and A. Silberschatz. Overview of multidatabase transaction management. VLDB Journal, 1(2):181–239, 1992.

    Article  Google Scholar 

  8. Y. Breitbart, R. Kommondoor, R. Rastogi, S. Seshadri, and A. Silberschatz. Update propagation protocols for replicated databases. In Proc. 1999 ACM SIGMOD Intl. Conf. Management of Data, pages 97–108, Philadelphia, PA, 1999.

    Google Scholar 

  9. P. Chundi, D. Rosenkrantz, and S. S. Ravi. Deferred updates and data placement in distributed databases. In Proc. International Conference on Data Engineering, pages 469–476, New Orleans, LA, Feb.–Mar. 1996.

    Google Scholar 

  10. C. A. Ellis. Consistency and correctness of duplicate database systems. Operating Systems Review, 11(5):67–84, 1977.

    Article  Google Scholar 

  11. L. Gao, M. Dahlin, A. Nayate, J. Zheng, and A. Iyengar. Improving availability and performance with application-specific data replication. IEEE Trans. Knowledge and Data Engineering, 17(1):106–120, 2005.

    Article  Google Scholar 

  12. E. Gelenbe and K. Sevcik. Analysis of update synchronization for multiple copy data-bases. In Proc. Third Berkeley Workshop on Distributed Databases and Computer Networks, pages 69–90, Berkeley, CA, Aug. 1978.

    Google Scholar 

  13. J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Mateo, 1993.

    MATH  Google Scholar 

  14. J. Gray, P. Helland, P. O’Neil, and D. Shasha. The dangers of replication and a solution. In Proc. 1996 ACM SIGMOD Intl. Conf. Management of Data, pages 173–182, Montreal, Canada, 1996.

    Google Scholar 

  15. A. A. Helal, A. A. Heddaya, and B. B. Bhargava. Replication Techniques in Distributed Systems. Kluwer Academic, Norwell, 1996.

    MATH  Google Scholar 

  16. E. Holler. Multiple copy update. In B. Lampson, M. Paul, and H. J. Siegel, editors, Distributed Systems—Architecture and Implementation: An Advanced Course. Lecture Notes in Computer Science, volume 105, pages 284–307. Springer, Berlin, 1981.

    Google Scholar 

  17. M. Hsu and A. Silberschatz. Unilateral commit: a new paradigm for reliable distributed transaction management. In Proc. 7th International Conference on Data Engineering, pages 286–293, Kobe, Japan, Feb.–Mar. 1991.

    Google Scholar 

  18. H. F. Korth and T. Imielinski. Introduction to mobile computing. In H. F. Korth and T. Imielinski, editors, Mobile Computing, pages 1–39. Kluwer Academic, Norwell, 1996.

    Google Scholar 

  19. H. F. Korth, E. Levy, and A. Silberschatz. A formal approach to recovery by compensating transactions. In Proc. 1990 International Conference on Very Large Databases, pages 95–106, Brisbane, Australia, Aug. 1990.

    Google Scholar 

  20. E. Levy, H. F. Korth, and A. Silberschatz. A theory of relaxed atomicity. In Proc. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 95–110, Montreal, Canada, Aug. 1991.

    Google Scholar 

  21. S. Mehrotra, R. Rastogi, H. F. Korth, and A. Silberschatz. Non-serializable executions in heterogeneous distributed database systems. In Proc. First International Conference on Parallel and Distributed Information Systems, pages 245–252, Miami Beach, FL, Dec. 1991.

    Google Scholar 

  22. T. Minoura. A new concurrency control algorithm for distributed database systems. In Proc. 4th Berkeley Workshop on Distributed Databases and Computer Networks, pages 221–234, Berkeley, CA, Aug. 1979.

    Google Scholar 

  23. C. Olson and J. Widom. Offering a precision-performance trade-off for aggregation queries over replicated data. In Proc. International Conference on Very Large Data Bases, pages 144–155, Cairo, Egypt, Sep. 2000.

    Google Scholar 

  24. C. Olson and J. Widom. Efficient monitoring and querying of distributed dynamic data via approximate replication. IEEE Data Engineering Bulletin, 28(1):11–18, 2005.

    Google Scholar 

  25. C. Papadimitriou. The Theory of Database Concurrency Control. Computer Science Press, Rockville, 1986.

    MATH  Google Scholar 

  26. C. Pu and A. Leff. Replica control in distributed systems: An asynchronous approach. In Proc. 1996 ACM SIGMOD Intl. Conf. Management of Data, pages 377–386, Denver, CO, May 1991.

    Google Scholar 

  27. M. Rabinovich, N. Gehani, and A. Kononov. Scalable update propagation in epidemic replicated databases. In Proc. 1996 Extending Database Technology Conference, pages 207–222. Springer, Berlin, 1996.

    Google Scholar 

  28. J. Sidell, P. Aoki, S. Barr, A. Sah, C. Staelin, M. Stonebraker, and A. Yu. Data replication in Mariposa. In Proc. 1996 International Conf. Data Engineering, pages 485–494, New Orleans, LA, Feb.–Mar. 1996.

    Google Scholar 

  29. R. H. Thomas. A solution to the concurrency control problem for multiple copy databases. In Proc. CompCon, pages 56–62, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Kent State University, Kent, OH, 44240, USA

    Yuri Breitbart

  2. Department of Computer Science and Engineering, Lehigh University, Bethlehem, PA, 18015, USA

    Henry F. Korth

  3. Department of Computer Science, Yale University, New Haven, CT, 06520, USA

    Avi Silberschatz

Authors
  1. Yuri Breitbart
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henry F. Korth
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Avi Silberschatz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuri Breitbart .

Editor information

Editors and Affiliations

  1. Department of Computer Science, University at Albany—SUNY, 1400 Washington Avenue, Albany, NY, 12222, USA

    S. S. Ravi

  2. Bradley Dept. Electrical and Computer Engineering, Virginia Tech, 302 Whittemore (0111), Blacksburg, VA, 24061, USA

    Sandeep K. Shukla

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science + Business Media B.V.

About this chapter

Cite this chapter

Breitbart, Y., Korth, H.F., Silberschatz, A. (2009). An Optimistic Concurrency Control Protocol for Replicated Databases. In: Ravi, S.S., Shukla, S.K. (eds) Fundamental Problems in Computing. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-9688-4_12

Download citation

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

  • 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

Search

Navigation