Conjunctive query

The conjunctive queries are the fragment of (domain independent) first-order logic given by the set of formulae that can be constructed from atomic formulae using conjunction ∧ and existential quantification ∃, but not using disjunction ∨, negation ¬, or universal quantification ∀. Each such formula can be rewritten (efficiently) into an equivalent formula in prenex normal form, thus this form is usually simply assumed.

Thus conjunctive queries are of the following general form:

${\displaystyle (x_{1},\ldots ,x_{k}).\exists x_{k+1},\ldots x_{m}.A_{1}\wedge \ldots \wedge A_{r}}$,

with the free variables ${\displaystyle x_{1},\ldots ,x_{k}}$ being called distinguished variables, and the bound variables ${\displaystyle x_{k+1},\ldots ,x_{m}}$ being called undistinguished variables. ${\displaystyle A_{1},\ldots ,A_{r}}$ are atomic formulae.

As an example of why the restriction to domain independent first-order logic is important, consider ${\displaystyle x_{1}.\exists x_{2}.R(x_{2})}$, which is not domain independent; see Codd's theorem. This formula cannot be implemented in the select-project-join fragment of relational algebra, and hence should not be considered a conjunctive query.

Conjunctive queries can express a large proportion of queries that are frequently issued on relational databases. To give an example, imagine a relational database for storing information about students, their address, the courses they take and their gender. Finding all male students and their addresses who attend a course that is also attended by a female student is expressed by the following conjunctive query:

(student, address) . ∃ (student2, course) .
   attends(student, course) ∧ gender(student, 'male') ∧ 
   attends(student2, course) ∧
   gender(student2, 'female') ∧ lives(student, address)

Note that since the only entity of interest is the male student and his address, these are the only distinguished variables, while the variables course, student2 are only existentially quantified, i.e. undistinguished.

Conjunctive queries without distinguished variables are called boolean conjunctive queries. Conjunctive queries where all variables are distinguished (and no variables are bound) are called equi-join queries,[1] because they are the equivalent, in the relational calculus, of the equi-join queries in the relational algebra (when selecting all columns of the result).

Conjunctive queries also correspond to select-project-join queries in relational algebra (i.e., relational algebra queries that do not use the operations union or difference) and to select-from-where queries in SQL in which the where-condition uses exclusively conjunctions of atomic equality conditions, i.e. conditions constructed from column names and constants using no comparison operators other than "=", combined using "and". Notably, this excludes the use of aggregation and subqueries. For example, the above query can be written as an SQL query of the conjunctive query fragment as

select l.student, l.address
from   attends a1, gender g1,
       attends a2, gender g2,
       lives l
where  a1.student = g1.student and
       a2.student = g2.student and
       l.student = g1.student and
       a1.course = a2.course and
       g1.gender = 'male' and
       g2.gender = 'female';

Besides their logical notation, conjunctive queries can also be written as Datalog rules. Many authors in fact prefer the following Datalog notation for the query above:

 result(student, address) :- attends(student, course),  gender(student, male),
                             attends(student2, course), gender(student2, female),
                             lives(student, address).

Although there are no quantifiers in this notation, variables appearing in the head of the rule are still implicitly universally quantified, while variables only appearing in the body of the rule are still implicitly existentially quantified.

While any conjunctive query can be written as a Datalog rule, not every Datalog program can be written as a conjunctive query. In fact, only single rules over extensional predicate symbols can be easily rewritten as an equivalent conjunctive query. The problem of deciding whether for a given Datalog program there is an equivalent nonrecursive program (corresponding to a positive relational algebra query, or, equivalently, a formula of positive existential first-order logic, or, as a special case, a conjunctive query) is known as the Datalog boundedness problem and is undecidable.[2]

Extensions of conjunctive queries capturing more expressive power include:

• unions of conjunctive queries, which are equivalent to positive (i.e., negation-free) relational algebra
• conjunctive queries extended by union and negation, which by Codd's theorem correspond to relational algebra and first-order logic
• conjunctive queries with built-in predicates, e.g., arithmetic predicates
• conjunctive queries with aggregate functions.

The formal study of all of these extensions is justified by their application in relational databases and is in the realm of database theory.

For the study of the computational complexity of evaluating conjunctive queries, two problems have to be distinguished. The first is the problem of evaluating a conjunctive query on a relational database where both the query and the database are considered part of the input. The complexity of this problem is usually referred to as combined complexity, while the complexity of the problem of evaluating a query on a relational database, where the query is assumed fixed, is called data complexity.[3]

Conjunctive queries are NP-complete with respect to combined complexity,[4] while the data complexity of conjunctive queries is very low, in the parallel complexity class AC0, which is contained in LOGSPACE and thus in polynomial time. The NP-hardness of conjunctive queries may appear surprising, since relational algebra and SQL strictly subsume the conjunctive queries and are thus at least as hard (in fact, relational algebra is PSPACE-complete with respect to combined complexity and is therefore even harder under widely held complexity-theoretic assumptions). However, in the usual application scenario, databases are large, while queries are very small, and the data complexity model may be appropriate for studying and describing their difficulty.

The problem of listing all answers to a non-Boolean conjunctive query has been studied in the context of enumeration algorithms, with a characterization (under some computational hardness assumptions) of the queries for which enumeration can be performed with linear time preprocessing and constant delay between each solution. Specifically, these are the acyclic conjunctive queries which also satisfy a free-connex condition.[5]

Conjunctive queries are one of the great success stories of database theory in that many interesting problems that are computationally hard or undecidable for larger classes of queries are feasible for conjunctive queries.[6] For example, consider the query containment problem. We write ${\displaystyle R\subseteq S}$ for two database relations ${\displaystyle R,S}$ of the same schema if and only if each tuple occurring in ${\displaystyle R}$ also occurs in ${\displaystyle S}$. Given a query ${\displaystyle Q}$ and a relational database instance ${\displaystyle I}$, we write the result relation of evaluating the query on the instance simply as ${\displaystyle Q(I)}$. Given two queries ${\displaystyle Q_{1}}$ and ${\displaystyle Q_{2}}$ and a database schema, the query containment problem is the problem of deciding whether for all possible database instances ${\displaystyle I}$ over the input database schema, ${\displaystyle Q_{1}(I)\subseteq Q_{2}(I)}$. The main application of query containment is in query optimization: Deciding whether two queries are equivalent is possible by simply checking mutual containment.

The query containment problem is undecidable for relational algebra and SQL but is decidable and NP-complete for conjunctive queries. In fact, it turns out that the query containment problem for conjunctive queries is exactly the same problem as the query evaluation problem.[6] Since queries tend to be small, NP-completeness here is usually considered acceptable. The query containment problem for conjunctive queries is also equivalent to the constraint satisfaction problem.[7]

An important class of conjunctive queries that have polynomial-time combined complexity are the acyclic conjunctive queries.[8] The query evaluation, and thus query containment, is LOGCFL-complete and thus in polynomial time.[9] Acyclicity of conjunctive queries is a structural property of queries that is defined with respect to the query's hypergraph:[6] a conjunctive query is acyclic if and only if it has hypertree-width 1. For the special case of conjunctive queries in which all relations used are binary, this notion corresponds to the treewidth of the dependency graph of the variables in the query (i.e., the graph having the variables of the query as nodes and an undirected edge ${\displaystyle \{x,y\}}$ between two variables if and only if there is an atomic formula ${\displaystyle R(x,y)}$ or ${\displaystyle R(y,x)}$ in the query) and the conjunctive query is acyclic if and only if its dependency graph is acyclic.

An important generalization of acyclicity is the notion of bounded hypertree-width, which is a measure of how close to acyclic a hypergraph is, analogous to bounded treewidth in graphs. Conjunctive queries of bounded tree-width have LOGCFL combined complexity.[10]

Unrestricted conjunctive queries over tree data (i.e., a relational database consisting of a binary child relation of a tree as well as unary relations for labeling the tree nodes) have polynomial time combined complexity.[11]

• Ullman, J. D. Information integration using logical views Theoretical Computer Science, 2000, 239, 189-210
• Georg Gottlob, Presentation on structural decomposition methods for the efficient evaluation of conjunctive queries (PDF)