Boolean conjunctive query

In the theory of relational databases, a Boolean conjunctive query is a conjunctive query without distinguished predicates, i.e., a query in the form $R_{1}(t_{1})\wedge \cdots \wedge R_{n}(t_{n})$, where each $R_{i}$ is a relation symbol and each $t_{i}$ is a tuple of variables and constants; the number of elements in $t_{i}$ is equal to the arity of $R_{i}$. Such a query evaluates to either true or false depending on whether the relations in the database contain the appropriate tuples of values, i.e. the conjunction is valid according to the facts in the database.

As an example, if a database schema contains the relation symbols Father (binary, who's the father of whom) and Employed (unary, who is employed), a conjunctive query could be $Father({\text{Mark}},x)\wedge Employed(x)$. This query evaluates to true if there exists an individual x who is a child of Mark and employed. In other words, this query expresses the question: "does Mark have an employed child?"

Complexity

Main article: Conjunctive query § Complexity

See also

• Logical conjunction
• Conjunctive query

References

• G. Gottlob; N. Leone; F. Scarcello (2001). "The complexity of acyclic conjunctive queries". Journal of the ACM. 48 (3): 431–498. doi:10.1145/382780.382783.