Conjunctive query¶

In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator.

Version: v1 · 2026-09-28 · History
Domain-specific #: 8652
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomain: Database Theory → Computer Science & Software Engineering

Core Idea¶

Conjunctive query is treated here as the recurring computer_science_and_information identity summarized by this source-grounded definition: In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator.

In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator. Many first-order queries can be written as conjunctive queries. In particular, a large part of queries issued on relational databases can be expressed in this way.

Conjunctive queries also have a number of desirable theoretical properties that larger classes of queries (e.g., the relational algebra queries) do not share. 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. 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.

For Conjunctive query, the abstraction is narrower than the article's general subject matter: a positive case must preserve In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in computer_science_and_information, which is why this identity is domain-specific rather than prime.

How would you explain it like I'm…

The All-Must-Match Question

Imagine asking a big book of lists, "Show me every kid who is in art class AND has a red backpack AND walks to school." Your question is just a bunch of things that all have to be true at once, joined by "and." That kind of simple all-must-match question is a conjunctive query.

And-Only Database Questions

Databases store information in tables, and people ask them questions called queries. A conjunctive query is a simple kind of question built only by joining conditions with "and": no "or," and no "not." For example, "find each male student and his address, where that student takes some course." The student and the address are what you want back; the course is just something that has to exist, so it isn't shown in the answer. Lots of everyday database questions can be written this way, and because they are simple, they are easier for computers to reason about.

Conjunction-Only First-Order Query

In database theory, a conjunctive query is a restricted form of first-order query that uses only logical conjunction (and), together with existential quantification, over relations in the database. Its variables split into distinguished variables, whose values are returned as the answer, and undistinguished variables, which are only required to exist. For instance, a query asking for male students and their addresses, where some course and some other student are involved, returns only the student and address, while the course and the other student are existentially quantified. Many first-order queries, including a large share of real queries on relational databases, can be written this way. Because they are restricted, conjunctive queries have desirable theoretical properties that larger classes, such as full relational algebra queries, lack. One studied problem is evaluating a conjunctive query when both the query and the database are part of the input.

A Conjunctive query is a restricted form of first-order query built from atomic relational conditions combined only with logical conjunction, with some variables existentially quantified. Its variables divide into distinguished variables, whose values are returned as the answer, and undistinguished variables, which are existentially quantified and serve only to connect conditions. For example, a query asking for male students and their addresses, where the student must attend some course that some other student also attends, returns only the student and address; the course and the second student are existential. Many first-order queries, and a large portion of the queries issued against relational databases in practice, can be expressed this way. Conjunctive queries enjoy desirable theoretical properties that larger classes such as relational algebra queries lack. One central problem studied is evaluation, in which both the query and the database are treated as part of the input.

Structural Signature¶

Sig role-phrases:

Defining carrier — 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.
Constitutive relation — The conjunctive queries are the fragment of (domain independent) first-order logic given by the set of.
Operating condition — 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.
Recognition evidence — conjunctive queries extended by union and negation, which by Codd's theorem correspond to relational algebra and first-order logic.
Admissible variation — The formal study of all of these extensions is justified by their application in relational databases and is in the realm of database theory.
Characteristic consequence — The main application of query containment is in query optimization: Deciding whether two queries are equivalent is possible by simply checking mutual containment.
Failure boundary — Each such formula can be rewritten (efficiently) into an equivalent formula in prenex normal form, thus this form is usually simply assumed.

What It Is Not¶

Not the whole field of computer_science_and_information. The node requires the specific identity stated by In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator.
Not an over-broad reading. with the free variables x_1, \ldots, x_k being called distinguished variables, and the bound variables x_{k+1}, \ldots, x_m being called undistinguished variables.
Not an over-broad reading. This formula cannot be implemented in the select-project-join fragment of relational algebra, and hence should not be considered a conjunctive query.
Not an over-broad reading. 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.
Not automatically Boolean Conjunctive Query. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Conjunctive query applies literally inside computer_science_and_information wherever the source-defined carrier and relation can be established. Its documented habitats include:

Extensions. The formal study of all of these extensions is justified by their application in relational databases and is in the realm of database theory.
Complexity. 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.
Formal properties. The main application of query containment is in query optimization: Deciding whether two queries are equivalent is possible by simply checking mutual containment.
Formal properties. 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 {x,y} between two variables if and only if there is an atomic formula R(x,y) or R(y,x) in the query) and the conjunctive query is acyclic if and only if its dependency graph is acyclic.
Definition. The conjunctive queries are the fragment of (domain independent) first-order logic given by the set of.
Definition. Each such formula can be rewritten (efficiently) into an equivalent formula in prenex normal form, thus this form is usually simply assumed.

Outside computer_science_and_information, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Pattern or should be marked as analogy.

Clarity¶

A clear use of Conjunctive query names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator. The strongest recognition evidence in the frozen account is: conjunctive queries extended by union and negation, which by Codd's theorem correspond to relational algebra and first-order logic. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification with the free variables x_1, \ldots, x_k being called distinguished variables, and the bound variables x_{k+1}, \ldots, x_m being called undistinguished variables. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Conjunctive query compresses multiple computer_science_and_information details into a stable diagnostic relation. The source shows both the central mechanism—the conjunctive queries are the fragment of (domain independent) first-order logic given by the set of.—and the practical consequence—the main application of query containment is in query optimization: Deciding whether two queries are equivalent is possible by simply checking mutual containment. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the computer_science_and_information entities to which the claim applies.
State the relation. Use the source-grounded identity: In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator.
Check operation and conditions. 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.
Demand recognition evidence. conjunctive queries extended by union and negation, which by Codd's theorem correspond to relational algebra and first-order logic.
Test variation. Change an implementation or setting while preserving the formal study of all of these extensions is justified by their application in relational databases and is in the realm of database theory.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Pattern.

Knowledge Transfer¶

Within the home domain. Knowledge about Conjunctive query transfers literally when a new case preserves the same carrier type, relation, and recognition test. The formal study of all of these extensions is justified by their application in relational databases and is in the realm of database theory. 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.

Beyond the home domain. No canonical parent is asserted for Conjunctive query. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

For example, the above query can be written as an SQL query of the conjunctive query fragment as. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator; recognition evidence → conjunctive queries extended by union and negation, which by Codd's theorem correspond to relational algebra and first-order logic

Applied / In Practice¶

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. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Datalog; invariant → In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator; boundary → the case exits the class when with the free variables x_1, \ldots, x_k being called distinguished variables, and the bound variables x_{k+1}, \ldots, x_m being called undistinguished variables

Structural Tensions¶

T1 — Stable identity versus admissible variation. with the free variables x_1, \ldots, x_k being called distinguished variables, and the bound variables x_{k+1}, \ldots, x_m being called undistinguished variables. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. This formula cannot be implemented in the select-project-join fragment of relational algebra, and hence should not be considered a conjunctive query. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. 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. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. Conjunctive queries where all variables are distinguished (and no variables are bound) are called equi-join queries, 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). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. 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. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Conjunctive query literally, co-instantiate Pattern, or only resemble it?

T6 — Autonomy versus reduction. The conjunctive queries are the fragment of (domain independent) first-order logic given by the set of. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Conjunctive query distinguish that the broader parent Pattern leaves together?

Structural–Framed Character¶

Conjunctive query is structural-leaning. Its structural side is the repeatable organization summarized by In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator. Its framed side is the computer_science_and_information vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: 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. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Pattern. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: 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. The conjunctive queries are the fragment of (domain independent) first-order logic given by the set of. It further constrains recognition and variation through: 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. conjunctive queries extended by union and negation, which by Codd's theorem correspond to relational algebra and first-order logic.

What is domain-bound. computer science and information supplies the operative entities, technical vocabulary, warrants, and exceptions that make Conjunctive query literal. Its documented scope includes the condition that The formal study of all of these extensions is justified by their application in relational databases and is in the realm of database theory. Another bounded application condition is that 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. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—The formal study of all of these extensions is justified by their application in relational databases and is in the realm of database theory.—and future graph densification may discover a defensible relation only if it preserves that boundary.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Conjunctive query. The reviewed identity is: In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Neighborhood in Abstraction Space¶

Conjunctive query sits in a sparse region of the domain-specific corpus (61^st percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Formal Logic & Semantic Systems (18 abstractions)

Nearest neighbors

Relational Model — 0.86
Formal Theory — 0.85
Gödel–Dummett Logic — 0.84
Equational logic — 0.84
Skip list — 0.84

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Pattern. The parent omits the specialist differentia. Tell: Can the case establish In database theory, a conjunctive query is a restricted form of first-order queries using the logical conjunction operator?
Boolean Conjunctive Query. An existential conjunction of relational atoms that returns true exactly when a database instance contains a variable assignment—or equivalently a homomorphic image—satisfying every atom. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Query Optimization. Let the author state only what result a declarative query should return, then have a separate optimiser search the space of algebraically equivalent execution plans and emit the cheapest one under a cost model. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Relational Model. Organize data as typed sets of tuples queried by a small closed algebra of relation-to-relation operators, so any composition is itself a valid query, rewrites preserve meaning, and the logical schema is separated from physical storage. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Conjunctive query remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside computer_science_and_information lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Pattern?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Conjunctive_query (revision 1325085188).
Preserved source candidate: http://www.cs.ox.ac.uk/dan.olteanu/papers/oz-tods15.pdf
Preserved source candidate: http://www.cs.rice.edu/~vardi/papers/stoc82.pdf.gz
Preserved source candidate: https://web.archive.org/web/20110823221732/http://www.cs.rice.edu/~vardi/papers/stoc82.pdf.gz
Preserved source candidate: http://portal.acm.org/citation.cfm?id=803397&coll=portal&dl=ACM
Preserved source candidate: https://pages.cs.wisc.edu/~paris/lecture-notes/lecture2.pdf
Preserved source candidate: https://web.archive.org/web/20070205175730/http://www.dis.uniroma1.it/~lenzerin/homepagine/didattica/viewbasedqueryprocessing/ConjunctiveQueries.pdf

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.