A Relational Algebra as a Query Language for Temporal DATALOG

  • Mehmet A. Orgun
  • William W. Wadge


This paper introduces a temporal relational algebra as a query language for temporal deductive databases, i. e., Temporal Datalog programs. In Temporal Datalog programs, temporal relationships among data are formalized through temporal operators, not by an explicit reference to time. The minimum model of a given Temporal Datalog program is regarded as the temporal database the program models intension ally. Users query temporal deductive databases using a temporal relational algebra (Tra), which is a point-wise extension of the relational algebra. During the evaluation of Tra expressions, portions of temporal relations are retrieved from a given temporal deductive database when needed. Bottom-up evaluation strategies such as the fixed point computation can be used to compute portions of temporal relations over intervals. An extension of Temporal Datalog with generic modules is also proposed. Through modules, temporal relations created during the evaluation of Tra expressions may be fed back to the deductive part for further manipulation.


Temporal Relation Query Language Relational Algebra Employee Relation Predicate Symbol 
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]
    M. Abadi and Z. Manna. Temporal logic programming. In Proceedings of the 1987 Symposium on Logic Programming, pages 4-16, San Fransisco, CA, 1987. IEEE Computer Society Press.Google Scholar
  2. [2]
    S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Springer-Verlag, Berlin Heidelberg, 1990.CrossRefGoogle Scholar
  3. [3]
    W. Chen, M. Kifer, and D. S. Warren. HiLog as a platform for database languages. In W. Kim, editor, Database Engineering, volume 8, pages 162-169. IEEE Computer Society Press, 1990.Google Scholar
  4. [4]
    J. Chomicki and T. Imielinski. Temporal deductive databases and infinite objects. In Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 61-73. Association for Computing Machinery, 1988.Google Scholar
  5. [5]
    J. Clifford and A. U. Tansel. On an algebra for historical relational databases: Two views. In S. Navathe, editor, Proceedings of the 1985 ACM SIGMOD International Conference on Management of Data, pages 247-265. Association for Computing Machinery, 1985.Google Scholar
  6. [6]
    M. Fitting. Enumeration operators and modular logic programming. Journal of Logic Programming, 4:11–21, 1987.MathSciNetMATHCrossRefGoogle Scholar
  7. [7]
    D. M. Gabbay. Modal and temporal logic programming. In A. Galton, editor, Temporal Logics and Their Applications, pages 197-237. Academic Press, 1987.Google Scholar
  8. [8]
    Shashi K. Gadia. A homogeneous relational model and query languages for temporal databases. ACM Transactions on Database Systems, 13(4):418–448, December 1988.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.Google Scholar
  10. [10]
    M. A. Orgun, H. A. Müller, and W. W. Wadge. A temporal relational algebra based on an abstract model. Dept. of Computer Science, University of Victoria, Victoria, B. C., Canada V8W 3P6, January 1992.Google Scholar
  11. [11]
    M. A. Orgun and W. W. Wadge. Chronolog: A temporal logic programming language and its formal semantics. Dept of Computer Science, University of Victoria, Victoria, B. C., Canada V8W 3P6, January 1988.Google Scholar
  12. [12]
    D. Stott Parker et al. Logic programming and databases. In L. Kerschberg, editor, Expert Database Systems, pages 35-48. Benjamin/Cummings Publishing Company, 1986.Google Scholar
  13. [13]
    G. Phipps, M. A. Derr, and K. A. Ross. Glue-Nail: A deductive system. In J. Clifford and R. King, editors, Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data, pages 308-317. Association for Computing Machinery, 1991.Google Scholar
  14. [14]
    Teodor C. Przymusinski. Perfect model semantics. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming: Proceedings of the Fifth International Conference and Symposium, pages 1081-1096. MIT Press, 1988.Google Scholar
  15. [15]
    N. Rescher and A. Urquhart. Temporal Logic. Springer-Verlag, 1971.Google Scholar
  16. [16]
    N. L. Sarda. Algebra and query language for a historical data model. The Computer Journal, 33(1): 11–18, 1990.CrossRefGoogle Scholar
  17. [17]
    R. Snodgrass. Temporal databases: Status and research directions. SIGMOD RECORD, 19:83–89, December 1990.CrossRefGoogle Scholar
  18. [18]
    Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, volume 1. Computer Science Press, 1988.Google Scholar

Copyright information

© Springer-Verlag/Wien 1992

Authors and Affiliations

  • Mehmet A. Orgun
    • 1
  • William W. Wadge
    • 1
  1. 1.Department of Computer ScienceUniversity of VictoriaVictoriaCanada

Personalised recommendations