On transaction management in temporal databases

  • Avigdor Gal
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1399)


A transaction model provides a framework for concurrent processing of retrieval and update operations in a database. Considerable research effort has focused on various techniques and protocols to ensure the ACID properties of transactions in conventional databases. However, the adoption of these techniques and protocols to temporal databases is not trivial. In particular, a refined locking mechanism based on temporal characteristics can provide better concurrency among transactions in temporal databases than a conventional locking mechanism. Accordingly, this paper presents a set of modifications and fine tuning of traditional concepts in transaction management, to enable a better performance of temporal databases. We also suggest a scheme for implementing a transaction protocol for temporal databases on top of a relational database. The contribution of the paper is in identifying the unique properties of transaction management in temporal databases and the use of these properties to provide a refined locking mechanism to enhance the concurrency of such databases. In particular, we show that the classic 2PL mechanism cannot ensure serializability in temporal databases. Instead, we suggest an alternative method to ensure serializability and reduce redundant abort operations, which is based on a temporal serializability graph.


temporal databases transaction management 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G. Ariav. A temporally oriented data model. ACM Transactions on Database Systems, 11(4):499–527, Dec. 1986.CrossRefGoogle Scholar
  2. 2.
    A. Bernstein and N. Goodman. Timestamped-based algorithms for concurrency control in distributed database systems. In Proceedings of the International Conference on VLDB, pages 285–300, 1980.Google Scholar
  3. 3.
    G. Bhargava and S. K. Gadia. Relational database systems with zero information loss. IEEE Transactions on Knowledge and Data Engineering, 5(l):76–87, Feb. 1993.CrossRefGoogle Scholar
  4. 4.
    J. Blakeley. Challenges for research on temporal databases. In Proceedings of the International Workshop on an Infrastructure for Temporal Database, June 1993.Google Scholar
  5. 5.
    D. Chamberlin. Using The New DB2, IBM's Object-Relational Database System. Morgan Kaufmann Publishers, Inc., San Francisco, California, 1996.Google Scholar
  6. 6.
    P. Chrysanthis and K. Ramamritham. ACTA: The saga continues. In A. Elmagarmid, editor, Database Transaction Models for Advanced Applications, chapter 10, pages 349–397. ACM Press. Morgan Kaufmann publisher, Inc., 1992.Google Scholar
  7. 7.
    J. Clifford and A. U. Tansel. On an algebra for historical relational databases: two views. In Proceedings of the ACM SIGMOD, pages 247–265, May 1985.Google Scholar
  8. 8.
    P. Dadam, V. Y. Lum, and H.-D. Werner. Integration of time versions into a relational database system. In Proceedings of the International Conference on VLDB, pages 509–522, Singapore, 1984.Google Scholar
  9. 9.
    S. Gadia. The role of temporal elements in temporal databases. Data Engineering Bulletin, 7:197–203, 1988.Google Scholar
  10. 10.
    A. Gal. TALE — A Temporal Active Language and Execution Model. PhD thesis, Technion—Israel Institute of Technology, Technion City, Haifa, Israel, May 1995. Available through the author's WWW home page, http://www.cs.toronto.edu/~avigal.Google Scholar
  11. 11.
    A. Gal and O. Etzion. Parallel execution model for updating temporal databases. International Journal of Computer Systems Science and Engineering, 12(5):317–327, Sept. 1997.Google Scholar
  12. 12.
    A. Gal, O. Etzion, and A. Segev. Extended update functionality in temporal databases. Technical Report ISE-TR-94-1, Technion—Israel Institute of Technology, Sept. 1994.Google Scholar
  13. 13.
    A. Gal, O. Etzion, and A. Segev. TALE — a temporal active language and execution model. In P. Constantopoulos, J. Mylopoulos, and Y. Vassiliou, editors, Advanced Information Systems Engineering, pages 60–81. Springer, May 1996.Google Scholar
  14. 14.
    H. Garcia-Molina and K. Salem. Sagas. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 249–259, May 1987.Google Scholar
  15. 15.
    D. Georgakopoulos, M. Rusinkiewicz, and A. Sheth. Using tickets to enforce the serializability of multidatabase transactions. IEEE Transactions on Knowledge and Data Engineering, 6(1), 1994.Google Scholar
  16. 16.
    T. Hadzilacos and C. Papadimitriou. Some algorithmic aspects of multiversion concurrency control. In Proc. Fourth ACM Sym. on Principles of Database Systems, pages 96–104, 1985.Google Scholar
  17. 17.
    C. Jensen, J. Clifford, S. Gadia, A. Segev, and R. Snodgrass. A glossary of temporal database concepts. ACM SIGMOD Record, 21(3):35–43, 1992.CrossRefGoogle Scholar
  18. 18.
    C. Jensen et al. A consensus glossary of temporal database concepts. ACM SIGMOD Record, 23(l):52–63, 1994.Google Scholar
  19. 19.
    A. Kumar and M. Stonebraker. Performance evaluation of an operating system transaction manager. In Proceedings of the International Conference on VLDB, pages 473–481, Brighton, England, 1987.Google Scholar
  20. 20.
    D. Lomet. Grow and post index trees: Role, techniques and future potential. In Proceedings of the Second Symposium on Large Spatial Databases, Zurich, Switzerland, 1991.Google Scholar
  21. 21.
    D. Lomet and B. Salzberg. Transaction-time databases. In Temporal Databases: Theory, Design, and Implementation, pages 388–417. Benjamin/Cummings, 1993.Google Scholar
  22. 22.
    M. Stonebraker. Conncurency control and consistency of multiple copies of data in distributed ingres. IEEE Transaction on Software Engineering, 3(3):188–194, May 1979.Google Scholar
  23. 23.
    S. Navathe and R. Ahmed. A temporal relational model and a query language. Information Sciences, 49:147–175, 1989.CrossRefGoogle Scholar
  24. 24.
    B. Nixon et al. Design of a compiler for a semantic data model. Technical Report CSRI-44, Computer Systems Research Institute, University of Toronto, May 1987.Google Scholar
  25. 25.
    C. Papadimitriou, P. Bernstein, and J. R. Jr. Computational problems related to database concurrency control. In Proceedings of the Conference on Theoretical Computer Science, 1977.Google Scholar
  26. 26.
    N. Pissinou, R. Snodgrass, R. Elmasri, I. Mumick, M. Ozsu, B. Pernici, A. Segev, and B. Theodoulidis. Towards an infrastructure for temporal databases—A workshop report. ACM SIGMOD Record, 23(1):35, 1994.CrossRefGoogle Scholar
  27. 27.
    R. Snodgrass and I. Ahn. Temporal databases. IEEE Computer, 19:35–42, Sep 1986.Google Scholar
  28. 28.
    K. Torp, C. Jensen, and M. Bohlen. Layered temporal DBMS: concepts and techniques. In Proceedings of the Fifih International Conference On Database Systems For Advanced Applications (DASFAA '97), Melbourne, Australia, Apr. 1997.Google Scholar
  29. 29.
    J. Ullman. Principles of Database and Knowledge-Base Systems, volume 1. Computer Science Press, Rockville, Maryland, 1 edition, 1988.Google Scholar
  30. 30.
    C. Vassilakis, N. Lorentzos, and P. Georgiadis. Transaction support in temporal DBMS. In J. Clifford and A. Tuzhilin, editors, Recent Advances in Temporal Databases, pages 255–271. Springer, 1995.Google Scholar
  31. 31.
    G. Weikum. Principles and realization strategies of multilevel transaction management. ACM Transactions on Database Systems (TODS), 16(l):132–180, 1991.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Avigdor Gal
    • 1
  1. 1.Department of Computer ScienceUniversity of TorontoCanada

Personalised recommendations