Version consistency and serializability in design databases

  • K. Vidyasankar
  • C. N. G. Dampney
Dynamic Aspects Of Databases
Part of the Lecture Notes in Computer Science book series (LNCS, volume 326)

Abstract

A database used by engineering or manufacturing applications for analysis and design purposes is called a design database. Here data items represent the actual physical structure of engineering parts and components. A design process can be thought of as starting with certain base data items or design objects, and deriving others from them. Several alternate designs may be tried from the same set of base objects. Designs with several sets of base objects may also be tried. Hence several versions of various data items may exist in the system simultaneously. Then “consistent” versions must be used in each derivation. Also a concurrency control mechanism for design database systems must allow keeping various versions until the end of the design process.

In this paper we propose a formal definition of version consistency expressed in terms of transaction histories. This allows checking version consistency from a history graph constructed from transaction processing. The version consistency checking algorithm takes polynomial time. We also demonstrate that a notion called τ*-serializability is an appropriate correctness criterion for concurrent executions in design databases. This is distinct from view-serializability which is accepted as the appropriate criterion for databases used for business and administrative transaction processing. We show that τ*-serializability of a version consistent history can be checked in polynomial time. In contrast checking τ*-serializability of a not necessarily version consistent history is NP-complete. It turns out that both version consistency and τ*-serializability can be checked using the same history graph.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BKK]
    F. Bancilhan, W. Kim and H.F. Korth, A model of CAD transactions, Proc. VLDB '85, pp. 25–33, 1985.Google Scholar
  2. [BG]
    P.A. Bernstein and N. Goodman, Multiversion concurrency control — theory and algorithms, ACM TODS Vol.8, No.4, pp. 465–483, 1983.CrossRefGoogle Scholar
  3. [B]
    J.A. Brzozowski, On models of transactions, Technical Report No.84001, Department of Applied Mathematics and Physics, Kyoto University, Japan, 1984.Google Scholar
  4. [D]
    C.N.G. Dampney, Precedency control and other semantic integrity issues in a workbench database, IEEE 1983 Proceedings of Annual Meeting — Database Week, pp. 97–104, 1983.Google Scholar
  5. [K]
    U. Kelter, Concurrency control for design objects with versions in CAD databases, Inform. Systems Vol.12, No.2, pp. 137–143, 1987.Google Scholar
  6. [KSUW]
    P. Klahold, G. Schlageter, R. Unland and W. Wilkes, A transaction model supporting complex applications in integrated information systems, Proc. SIGMOD '85, pp. 388–401, 1985.Google Scholar
  7. [NH]
    T. Neumann and C. Hornung, Consistency and transactions in CAD database, Proc. VLDB '82, pp. 181–188, 1982.Google Scholar
  8. [P]
    C.H. Papadimitriou, The serializability of concurrent database updates, J.ACM, Vol.26, No.4, pp. 631–653, 1979.Google Scholar
  9. [PK]
    C.H. Papadimitriou and P.C. Kanellakis, On concurrency control by multiple versions, ACM TODS Vol.9, No.1, pp. 89–99, 1984.CrossRefGoogle Scholar
  10. [V]
    K. Vidyasankar, Generalized theory of serializability, Acta Informatica Vol.24, No.1, pp. 105–119, 1987.Google Scholar
  11. [Y]
    M. Yannakakis, Serializability by locking, J.ACM Vol.31, No.2, pp. 227–244, 1984.Google Scholar

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • K. Vidyasankar
    • 1
  • C. N. G. Dampney
    • 2
  1. 1.Department of Computer ScienceMemorial University of NewfoundlandSt. John'sCanada
  2. 2.School of Mathematics, Physics, Computing and ElectronicsMacquarie UniversityNorth RydeAustralia

Personalised recommendations