Skip to main content

A Relational Algebra as a Query Language for Temporal DATALOG

  • Conference paper

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Springer-Verlag, Berlin Heidelberg, 1990.

    Book  Google Scholar 

  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. 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. 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. M. Fitting. Enumeration operators and modular logic programming. Journal of Logic Programming, 4:11–21, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  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. Shashi K. Gadia. A homogeneous relational model and query languages for temporal databases. ACM Transactions on Database Systems, 13(4):418–448, December 1988.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.

    Google Scholar 

  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. 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. 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. 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. 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. N. Rescher and A. Urquhart. Temporal Logic. Springer-Verlag, 1971.

    Google Scholar 

  16. N. L. Sarda. Algebra and query language for a historical data model. The Computer Journal, 33(1): 11–18, 1990.

    Article  Google Scholar 

  17. R. Snodgrass. Temporal databases: Status and research directions. SIGMOD RECORD, 19:83–89, December 1990.

    Article  Google Scholar 

  18. Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, volume 1. Computer Science Press, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag/Wien

About this paper

Cite this paper

Orgun, M.A., Wadge, W.W. (1992). A Relational Algebra as a Query Language for Temporal DATALOG. In: Tjoa, A., Ramos, I. (eds) Database and Expert Systems Applications. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7557-6_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-7557-6_48

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82400-9

  • Online ISBN: 978-3-7091-7557-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics