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

  • Angelo Brayner
  • Theo Härder
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2172)


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.


Concurrency Control Local Database Database Object Global Schedule Semantic Unit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bernstein, P. A., Hadzilacos, V. and Goodman, N. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987. 309Google Scholar
  2. 2.
    Brayner, A. Transaction Management in Multidatabase Systems. Shaker-Verlag, 1999. 305Google Scholar
  3. 3.
    Brayner, A. and Härder, T. Recovery in multidatabase systems. In Procedings of XIV Brazilian Symposium on Databases (SBBD 99), 1999. 315Google Scholar
  4. 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.zbMATHCrossRefGoogle Scholar
  5. 5.
    Breitbart, Y., Garcia-Molina, H., Silberschatz, A. Overview of multidatabase transaction management. The VLDB Journal, (2):181–239, 1992. 305CrossRefGoogle Scholar
  6. 6.
    Casanova, M. A. The Concurrency Problem of Database Systems. In Lectures Notes in Computer Science, number 116. Springer-Verlag, 1981. 313Google Scholar
  7. 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. 303Google Scholar
  8. 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. 301zbMATHCrossRefMathSciNetGoogle Scholar
  9. 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. 305Google Scholar
  10. 10.
    Korth, H. F. and Speegle, G. D. Formal Model of Correctness Without Serializability. In Proceedings of ACM SIGMOD Conference, pages 379–386, 1988. 305Google Scholar
  11. 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. 305CrossRefGoogle Scholar
  12. 12.
    Litwin, W., Mark, L. and Roussopoulos, N. Interoperability of Multiple Autonomous Databases. Computing Surveys, 22(3):267–293, 1990. 301CrossRefGoogle Scholar
  13. 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. 305Google Scholar
  14. 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. 305Google Scholar
  15. 15.
    Salem, K., Garcia-Molina, H. and Shands, J. Altruistic Locking. ACM Transactions on Database Systems, 19(1):117–165, March 1994. 310CrossRefGoogle Scholar
  16. 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. 307Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Angelo Brayner
    • 1
  • Theo Härder
    • 2
  1. 1.Dept. of Computer ScienceUniversity of Fortaleza, UNIFORFortalezaBrazil
  2. 2.Dept. of Computer ScienceUniversity of KaiserslauternKaiserslauternGermany

Personalised recommendations