Constraints and redundancy in Datalog

Alon Levy*, Yehoshua Sagiv

*Corresponding author for this work

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

27 Scopus citations

Abstract

Two types of redundancies in datalog programs are considered. Redundancy based on reachability eliminates rules and predicates that do not participate in any derivation tree of a fact for the query predicate. Redundancy based on irrelevance is similar, but considers only minimal derivation trees, that is, derivation trees having no pair of identical atoms, such that one is an ancestor of the other. Algorithms for detecting these redundancies are given, including the case of programs with constraint literals. These algorithms not only detect redundancies in the presence of constraints, but also push constraints from the given query and rules to the EDB predicates. Under certain assumptions discussed in the paper, the constraints are pushed to the EDB as tightly as possible.

Original languageEnglish
Title of host publicationProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
PublisherPubl by ACM
Pages67-80
Number of pages14
ISBN (Print)0897915194, 9780897915199
DOIs
StatePublished - 1992
Externally publishedYes
EventProceedings of the 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - San Diego, CA, USA
Duration: 2 Jun 19924 Jun 1992

Publication series

NameProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Conference

ConferenceProceedings of the 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
CitySan Diego, CA, USA
Period2/06/924/06/92

Fingerprint

Dive into the research topics of 'Constraints and redundancy in Datalog'. Together they form a unique fingerprint.

Cite this