Static analysis in datalog extensions

Alon Y. Halevy*, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

36 Scopus citations

Abstract

We consider the problems of containment, equivalence, satisfiability and query-reachability for datalog programs with negation. These problems are important for optimizing datalog programs. We show that both query-reachability and satisfiability are decidable for programs with stratified negation provided that negation is applied only to EDB predicates or that all EDB predicates are unary. In the latter case, we show that equivalence is also decidable. The algorithms we present can also be used to push constraints from a given query to the EDB predicates. In showing our decidability results we describe a powerful tool, the query-tree, which is used for several optimization problems for datalog programs. Finally, we show that satisfiability is undecidable for datalog programs with unary IDB predicates, stratified negation and the interpreted predicate ≠.

Original languageEnglish
Pages (from-to)971-1012
Number of pages42
JournalJournal of the ACM
Volume48
Issue number5
DOIs
StatePublished - Sep 2001

Keywords

  • Abstract interpretation
  • Datalog
  • Query containment
  • Query satisfiability

Fingerprint

Dive into the research topics of 'Static analysis in datalog extensions'. Together they form a unique fingerprint.

Cite this