Dynamic Scheduling of Transactions in Design Databases based on Version Consistency

Extended Abstract
  • Gottfried Vossen
  • Roger Schwarz


The concurrency control problem for design databases is considered. In such a database, used in engineering design applications, transactions operate concurrently on multiple versions of various design objects. Recently, a notion of version consistency has been proposed for schedules of such transactions, and it has been shown that a notion of serializability appropriate for schedules of design transactions can statically be tested in polynomial time in the presence of version consistency. However, no dynamic concurrency control mechanism based on these results has been reported yet. Such a mechanism is the subject of this paper. In particular, a dynamic scheduling algorithm for design transactions is presented which generates version consistent and τ *-serializable schedules; various problems newly arising in a dynamic situation are identified, and solutions for them proposed where possible.


Schedule Algorithm Concurrency Control Dynamic Schedule Design Database Multiple Version 
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]
    D. Agrawal and S. Sengupta, “Modular Synchronization in Multiversion Databases: Version Control and Concurrency Control,” Proc. ACM SIGMOD Int. Conf. on Management of Data 1989, 408–417.Google Scholar
  2. [2]
    F. Bancilhon, W. Kim and H.F. Korth, “A Model of CAD Transactions,” Proc. 11th Int. Conf. on Very Large Data Bases 1985, 25–33.Google Scholar
  3. [3]
    P.A. Bernstein and N. Goodman, “Multiversion Concurrency Control: Theory and Algorithms,” ACM Trans. Database Systems Vol. 8, 1983, 465–483.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    P.A. Bernstein, V. Iladzilacos and N. Goodman, “Concurrency Control and Recovery in Database Systems,” Addison-Wesley Publ. Co., Reading, MA, 1987.Google Scholar
  5. [5]
    H.T. Chou and W. Kim, “A Unifying Framework for Version Control in a CAD Environment,” Proc. 12th Int. Conf. on Very Large Data Bases 1986, 336–344.Google Scholar
  6. [6]
    R. Elmasri and S.B. Navathe, “Fundamentals of Database Systems,” The Benjamin-Cummings Publ. Co., Redwood City, CA, 1989.Google Scholar
  7. [7]
    T. Hadzilacos and C.H. Papadimitriou, “Algorithmic Aspects of Multiversion Concurrency Control,” J. Computers and System Sciences Vol. 33, 1986, 297–310.MathSciNetMATHCrossRefGoogle Scholar
  8. [8]
    G. Lausen, “Formal Aspects of Optimistic Concurrency Control in a Multiple Version Database System,” Information Systems Vol. 8, 1983, 291–301.MATHCrossRefGoogle Scholar
  9. [9]
    C.H. Papadimitriou, “The Theory of Database Concurrency Control,” Computer Science Press, Rockville, MD, 1986.Google Scholar
  10. [10]
    C.H. Papadimitriou and P.C. Kanellakis, “On Concurrency Control by Multiple Versions,” ACM Trans. Database Systems Vol. 9, 1984, 89–99.MATHCrossRefGoogle Scholar
  11. [11]
    R. Schwarz, “Dynamic Scheduling of Design Transactions based on Version Consistency,” Master’s Thesis (in German), University of Kiel, April 1990.Google Scholar
  12. [12]
    K. Vidyasankar, “Generalized Theory of Serializability,” Acta Informatica Vol. 24, 1987, 105–119.MathSciNetMATHCrossRefGoogle Scholar
  13. [13]
    K. Vidyasankar and C.N.G. Dampney, “Version Consistency and Serializability in Design Databases,” Proc. 2nd Int. Conference on Database Theory (ICDT) 1988, Springer LNCS 326, 368–382.Google Scholar
  14. [14]
    G. Vossen, “Data Models, Database Languages and Database Management Systems”, Addison-Wesley Publ. Co., Wokingham, England 1990, forthcoming.Google Scholar
  15. [15]
    G. Vossen and R. Schwarz, “Dynamic Scheduling of Transactions in Design Databases based on Version Consistency,” Informatik-Bericht 89–22, RWTH Aachen 1989.Google Scholar
  16. [16]
    G. Weikum, “Enhancing Concurrency in Layered Systems,” Proc. 2nd Workshop on High Performance Transaction Systems 1987, Springer LNCS 359, 200–218.Google Scholar
  17. [17]
    M. Yannakakis, “Serializability by Locking,” J. ACM Vol. 31, 1984, 227–244.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag/Wien 1990

Authors and Affiliations

  • Gottfried Vossen
    • 1
    • 3
  • Roger Schwarz
    • 2
  1. 1.Institut für InformatikUniversität Koblenz (EWH)KoblenzGermany
  2. 2.Institut für InformatikUniversität KielKielGermany
  3. 3.Lehrstuhl für Angewandte Mathematik, insbes. InformatikRWTH AachenAachenGermany

Personalised recommendations