Skip to main content
SpringerLink
Log in

Querying clocked databases

  • Conference paper
  • First Online:
Flexible Query Answering Systems (FQAS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1495))

Included in the following conference series:

  • 95 Accesses

Abstract

We propose a temporal extension of Datalog which can be used to model and query temporal databases with relations based on multiple clocks. The extension, called Clocked Temporal Datalog, is based on a clocked temporal logic in which each formula can be assigned a separate clock. A Clocked Temporal Datalog program consists of three parts: (1) a clock definition, (2) a clock assignment, and (3) a program body. The clock definition specifies all the available clocks. The clock assignment assigns to each predicate defined in the program body a clock from the clock definition. The meaning of the program body naturally depends on the provided clock definition and assignment. Therefore a Clocked Temporal Datalog program models intensionally a clocked (temporal) database in which each relation is defined over a clock.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. R. Apt, H. A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89–148. Morgan Kaufmann, Los Altos, Calif, 1988.

    Google Scholar 

  2. M. Baudinet, M. Niézette, and P. Wolper. On the representation of infinite temporal data and queries. In Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 280–290. The Association for Computing Machinery, 1991.

    Google Scholar 

  3. M. Böhlen and R. Marti. On the completeness of temporal database query languages. In D. M. Gabbay and H. J. Ohlbach, editors, Proceedings of ICTL'94: The First International Conference on Temporal Logic, volume 827 of LNAI, pages 283–300, Gustav Stresemann Institut, Bonn, Germany, 1994. Springer-Verlag.

    Google Scholar 

  4. J. Chomicki and T. Imieliński. Temporal deductive databases and infinite objects. In Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 61–73. The Association for Computing Machinery, 1988.

    Google Scholar 

  5. C. E. Dyreson and R. T. Snodgrass. Temporal granularity. In R. T. Snodgrass, editor, The TSQL2 Temporal Query Language, pages 347–383. Kluwer Academic Press, 1995.

    Google Scholar 

  6. J.-R. Gagné and J. Plaice. A non-standard temporal deductive database system. Journal of Symbolic Computation, 22(5&6), 1996.

    Google Scholar 

  7. P. Ladkin. The Logic of Time Representation. PhD thesis, University of California, Berkeley, California, USA, 1987.

    Google Scholar 

  8. J. Y. Lee, R. Elmasri, and J. Won. An integrated temporal data model incorporating time series concept. Department of Computer Science and Engineering, The University of Texas at Arlington, Texas, U.S.A., February 1997.

    Google Scholar 

  9. C. Liu and M. A. Orgun. Dealing with multiple granularity of time in temporal logic programming. Journal of Symbolic Computation, 22(5&6):699–720, 1996.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  11. M. A. Orgun. On temporal deductive databases. Computational Intelligence, 12(2):235–259, 1996.

    MathSciNet  Google Scholar 

  12. M. A. Orgun and W. W Wadge. Theory and practice of temporal logic programming. In L. FarinÃs del Cerro and M. Penttonen, editors, Intensional Logics for Programming, pages 23–50. Oxford University Press, 1992.

    Google Scholar 

  13. G. özsoyoğlu and R. T. Snodgrass. Temporal and real-time databases: A survey. IEEE Transactions on Knowledge and Data Engineering, 7(4):513–532, August 1995.

    Article  Google Scholar 

  14. J. van Benthem. Temporal logic. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 4. Oxford University Press, 1993.

    Google Scholar 

  15. G. Wiederhold, S. Jajodia, and W. Litwin. Dealing with granularity of time in temporal databases. In R. Andersen, J. A. Bubenko, and A. SØlvberg, editors, Advanced Information Systems Enginering: Proceedings of the Third International Conference CAiSE'91, pages 124–140, Trondheim, Norway, May 13–15 1991. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Macquarie University, 2109, NSW, Australia

    Mehmet A. Orgun

  2. Information Technology Division, Defence Science and Technology Organisation, PO Box 1500, 5108, Salisbury, SA, Australia

    Chuchang Liu

Authors
  1. Mehmet A. Orgun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chuchang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Troels Andreasen Henning Christiansen Henrik Legind Larsen

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Orgun, M.A., Liu, C. (1998). Querying clocked databases. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 1998. Lecture Notes in Computer Science, vol 1495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056012

Download citation

  • DOI: https://doi.org/10.1007/BFb0056012

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65082-9

  • Online ISBN: 978-3-540-49655-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation