Boolean conjunctive query: Difference between revisions

Revision as of 03:05, 21 July 2007

Revision as of 06:44, 29 April 2008

Line 1:

In the theory of [[relational databases]], a '''Boolean conjunctive query''' is a query in the form <math>R_1(t_1) \wedge \cdots \wedge R_n(t_n)</math>, where each <math>R_i</math> is a relation symbol and each <math>t_i</math> is a tuple of variables and constants; the number of elements in <math>t_i</math> is equal to the [[arity]] of <math>R_i</math>. Such a query evaluates to either true or false depending on whether the relations in the database contains the appropriate tuples of values.

As an example, if a database schema contains the relation symbols <math>Father</math> (binary, who's the father of whowhom) and <math>Employeed</math> (unary, who is employeed), a conjunctive query could be <math>Father(Mark, x) \wedge Employeed(x)</math>. This query evaluates to true if there exists an individual <math>x</math> who is a child of Mark and employed. In other worlds, this query expresses the question: "dodoes Mark have employed children?"

==See also==