Skip to main content

Global Semantic Serializability: An Approach to Increase Concurrency in Multidatabase Systems

  • Conference paper
  • First Online:
Cooperative Information Systems (CoopIS 2001)

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

Included in the following conference series:

  • 369 Accesses

Abstract

In this work, we present a new approach to control concurrency in multidatabase systems. The proposed approach is based on the use of semantic knowledge to relax the notion of absolute transaction atomicity. Supported by this new concept of atomicity, we propose a new correctness criterion, denoted global semantic serializability, for the execution of concurrent transactions, which provides a high degree of inter-transaction parallelism, ensures consistency of the local databases and preserves autonomy of local databases. Our proposal can also be used to increase concurrency in systems for integrating web data sources based on a mediator mechanism. Two concurrency control protocols we have developed are described.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bernstein, P. A., Hadzilacos, V. and Goodman, N. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987. 309

    Google Scholar 

  2. Brayner, A. Transaction Management in Multidatabase Systems. Shaker-Verlag, 1999. 305

    Google Scholar 

  3. Brayner, A. and Härder, T. Recovery in multidatabase systems. In Procedings of XIV Brazilian Symposium on Databases (SBBD 99), 1999. 315

    Google Scholar 

  4. Brayner, A., Härder, T. and Ritter, N. Semantic Serializability: A Correctness Criterion for Processing Transactions in Advanced Database Applications. Data & Knowledge Engineering, 31(1):1–24, 1999.

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  6. Casanova, M. A. The Concurrency Problem of Database Systems. In Lectures Notes in Computer Science, number 116. Springer-Verlag, 1981. 313

    Google Scholar 

  7. Du, W. and Elmagarmid, A. K. Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase. In Proceedings of the 15th International Conference on VLDB, pages 347–355, Amsterdam, 1989. 303

    Google Scholar 

  8. Eswaran, K. P., Gray, J. N., Lorie, R. A. and Traiger, I. L. The Notions of Consistency and Predicate Locks in a Database System. Communications of the ACM, 19(11):624–633, November 1976. 301

    Article  MATH  MathSciNet  Google Scholar 

  9. Georgakopoulos, D., Rusinkiewicz, M. and Sheth, A. Using Tickets to Enforce the Serializability of Multidatabase Transactions. IEEE Transactions on Knowledge and Data Engineering, 6(1):1–15, February 1993. 305

    Google Scholar 

  10. Korth, H. F. and Speegle, G. D. Formal Model of Correctness Without Serializability. In Proceedings of ACM SIGMOD Conference, pages 379–386, 1988. 305

    Google Scholar 

  11. Korth, H. F. and Speegle, G. D. Formal Aspects of Concurrency Control in Long-Duration Transaction Systems Using The NT/PV Model. ACM Transactions on Database Systems, 19(3):492–535, September 1994. 305

    Article  Google Scholar 

  12. Litwin, W., Mark, L. and Roussopoulos, N. Interoperability of Multiple Autonomous Databases. Computing Surveys, 22(3):267–293, 1990. 301

    Article  Google Scholar 

  13. Mehrotra, S., Rastogi, R., S., Korth, H. and Silberschatz, A. Non-serializable Executions in heterogeneous distributed database systems. In Proceedings of the First International Conference on Parallel and Distributed Information Systems, 1991. 305

    Google Scholar 

  14. Rastogi, R., Mehrotra, S., Breitbart, Y., Korth, H. and Silberschatz, A. On Correctness of Non-serializable Executions. In Proceedings of the SIGMOD PODS, pages 97–108, 1993. 305

    Google Scholar 

  15. Salem, K., Garcia-Molina, H. and Shands, J. Altruistic Locking. ACM Transactions on Database Systems, 19(1):117–165, March 1994. 310

    Article  Google Scholar 

  16. Shasha, D., Simon, E. and Valduirez, P. Simple Rational Guidance for Chopping Up Transactions. In Proceedings of 1992 ACM SIGMOD Conference, pages 298–307, 1992. 307

    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

Brayner, A., Härder, T. (2001). Global Semantic Serializability: An Approach to Increase Concurrency in Multidatabase Systems. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds) Cooperative Information Systems. CoopIS 2001. Lecture Notes in Computer Science, vol 2172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44751-2_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-44751-2_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42524-3

  • Online ISBN: 978-3-540-44751-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics