Querying clocked databases

Mehmet A. Orgun, Chuchang Liu

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

1 Citation (Scopus)


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.

Original languageEnglish
Title of host publicationFlexible Query Answering Systems
Subtitle of host publicationThird International Conference, FQAS'98 Roskilde, Denmark, May 13–15, 1998 Proceedings
EditorsTroels Andreasen, Henning Christiansen, Henrik Legind Larsen
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Number of pages12
ISBN (Electronic)9783540496557
ISBN (Print)9783540650829
Publication statusPublished - 1998
Event3rd International Conference on Flexible Query Answering Systems, FQAS 1998 - Roskilde, Denmark
Duration: 13 May 199815 May 1998

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other3rd International Conference on Flexible Query Answering Systems, FQAS 1998


Dive into the research topics of 'Querying clocked databases'. Together they form a unique fingerprint.

Cite this