On bounded database schemes and bounded Horn-clause programs

Yehoshua Sagiv*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

A lossless database scheme with full implicational dependencies is considered. The following condition is necessary in order that restricted projections of the representative instance could be expressed in relational algebra (i.e., in first-order logic): The dependencies of the database scheme are equivalent to a single join dependency and some equality-generating dependencies. An important special case is when the database scheme has only full tuple-generating dependencies. In this case, restricted projections of the representative instance can be expressed in relational algebra if and only if the following condition is true: The dependencies of the database scheme are equivalent to a single joint dependency. Testing this condition is decidable. This result also applied to the class of Horn-clause programs consisting only of typed rules with one predicate symbol R (and without function symbols). A program consisting of rules of this form is equivalent to a nonrecursive program if and only if it is equivalent to a project-join mapping. Finally, it is also shown that a tableau mapping is idempotent if and only if it is a project-join mapping.

Original languageEnglish
Pages (from-to)1-22
Number of pages22
JournalSIAM Journal on Computing
Volume17
Issue number1
DOIs
StatePublished - 1988

Fingerprint

Dive into the research topics of 'On bounded database schemes and bounded Horn-clause programs'. Together they form a unique fingerprint.

Cite this