
On Temporal Deductive Databasesy
MEHMET A. ORGUN
Department of Computing, Macquarie University
Sydney, NSW 2109, Australia
Tel: +61 (0)2 8059916, Fax: +61 (0)2 8058983
Email: [email protected]
ABSTRACT
This paper introduces a temporal deductive database system featuring a logic programming language and an algebraic frontend. The language, called Temporal Datalog, is an extension of Datalog based on a simple temporal logic with two temporal operators, namely first and next. Programs of Temporal Datalog are considered as temporal deductive databases, specifying temporal relationships among data and providing base relations to Tra expressions. The minimummodel of a given Temporal Datalog program is regarded as the temporal database the program models intensionally. The algebraic frontend, called Tra, is a pointwise extension of the relational algebra upon the set of natural numbers. When needed during the evaluation of Tra expressions, slices of temporal relations over intervals can be retrieved from a given temporal deductive database by bottomup evaluation strategies.
A modular extension of Temporal Datalog is also proposed, through which temporal relations created during the evaluation of Tra expressions may be fed back to the deductive part for further manipulation. Modules therefore enable the algebra to have full access to the deductive capabilities of Temporal Datalog, and to extend it with nonstandard algebraic operators. The paper also shows that the temporal operators of Tra can be simulated in Temporal Datalog by program clauses.
Keywords: Temporal Databases, Temporal Algebras, Deductive Databases, Logic Programming, Temporal Logic, Declarative Semantics, Modules.
yThis is a substantially extended and revised version of the paper A relational algebra as a query language for Temporal Datalog", which appeared in A. Min Tjoa and Isidro Ramos, editors, Proceedings of DEXA'92: The Third International Conference on Database and Expert Systems Applications, Valencia, Spain, September 2{4, 1992. SpringerVerlag, pp.276{281.