Datalog programs over infinite databases, revisited

Sara Cohen*, Joseph Gil, Evelina Zarivach

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


This paper's revisit of infinite relational databases, a model traditionally perceived as purely theoretical, was sparked by a concrete implementation setting, and the results obtained here were used in a practical database problem. In the course of implementing a database system for querying Java software, we found that the universe of Java code can be effectively modeled as an infinite database. This modeling makes it possible to distinguish between queries which are "open-ended," that is, whose result may grow as software components are added into the system, and queries which are "closed," in that their result does not change as the software base grows. Further, closed queries can be implemented much more efficiently than open queries. Achievements include an algorithm for distinguishing between these two kinds of queries (we assume that queries are written in Datalog), and an algorithm to generate an efficient evaluation scheme of closed queries, which is a generalization of Vieille's famous QSQR algorithm for top-down evaluation of Datalog programs. A by-product of this work is a rather terse and elegant representation of QSQR.

Original languageAmerican English
Title of host publicationDatabase Programming Languages - 11th International Symposium, DBPL 2007, Revised Selected Papers
PublisherSpringer Verlag
Number of pages6
ISBN (Print)9783540759867
StatePublished - 2007
Externally publishedYes
Event11th International Symposium on Database Programming Languages, DBPL 2007 - Vienna, Austria
Duration: 23 Sep 200724 Sep 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4797 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference11th International Symposium on Database Programming Languages, DBPL 2007


Dive into the research topics of 'Datalog programs over infinite databases, revisited'. Together they form a unique fingerprint.

Cite this