MonoRel: Monotone Relations in CQ Containment

• MonoRel is the monotone fragment of Boolean queries, defined as the intersection of CQ containments and monotone queries over a fixed relational schema.
• The preservation theorem demonstrates that every monotone CQ containment is equivalent to a nonemptiness test of a single conjunctive query, ensuring no extra expressive power.
• The proof uses head elimination and minimality techniques to analyze query structure, leading to NP-complete recognition of monotonicity in this framework.

Searching arXiv for the primary paper and closely related work on monotone relations / MonoRel. arXiv search query: (Surinx et al., 2018) MonoRel denotes the monotone fragment of Boolean queries expressed as containments of conjunctive queries over a fixed finite relational schema $\mathcal T$. Formally, if $\mathrm{CQ}^{\subseteq}$ is the class of Boolean queries of the form $Q_1 \subseteq Q_2$ and $\mathrm{MON}$ is the class of monotone Boolean queries, then

$$\mathrm{MonoRel}:=\mathrm{CQ}^{\subseteq}\cap \mathrm{MON}.$$

Its significance lies in a preservation theorem showing that monotone containments of conjunctive queries add no expressive power beyond ordinary conjunctive-query nonemptiness: for every schema $\mathcal T$, $\mathrm{MonoRel}=\mathrm{CQ}^{\neq}$, where $\mathrm{CQ}^{\neq}$ is the class of Boolean queries given by nonemptiness of a single conjunctive query (Surinx et al., 2018).

1. Formal setting and definition

The underlying framework fixes a finite relational schema $\mathcal T$, where each relation symbol $R\in\mathcal T$ has arity $\mathrm{CQ}^{\subseteq}$0. An instance $\mathrm{CQ}^{\subseteq}$1 of $\mathrm{CQ}^{\subseteq}$2 is a finite set of ground facts $\mathrm{CQ}^{\subseteq}$3, and $\mathrm{CQ}^{\subseteq}$4 means that $\mathrm{CQ}^{\subseteq}$5 extends $\mathrm{CQ}^{\subseteq}$6 by set-theoretic inclusion (Surinx et al., 2018).

A conjunctive query $\mathrm{CQ}^{\subseteq}$7 over $\mathrm{CQ}^{\subseteq}$8 is written as

$\mathrm{CQ}^{\subseteq}$9

where $Q_1 \subseteq Q_2$0 is the head, a tuple of variables $Q_1 \subseteq Q_2$1, and $Q_1 \subseteq Q_2$2 is the body, a finite set of atoms $Q_1 \subseteq Q_2$3 with variables from $Q_1 \subseteq Q_2$4. The answer $Q_1 \subseteq Q_2$5 is the set of tuples $Q_1 \subseteq Q_2$6 for which there exists a homomorphism $Q_1 \subseteq Q_2$7 satisfying the body atoms and $Q_1 \subseteq Q_2$8 for all $Q_1 \subseteq Q_2$9. When the head is empty, $\mathrm{MON}$0 is either $\mathrm{MON}$1 or $\mathrm{MON}$2 (Surinx et al., 2018).

Within this framework, Boolean queries arise in two standard ways. The first is nonemptiness: a conjunctive query $\mathrm{MON}$3 induces the Boolean test $\mathrm{MON}$4, which returns true exactly when $\mathrm{MON}$5. The second is containment: if $\mathrm{MON}$6 and $\mathrm{MON}$7 have the same head arity, then $\mathrm{MON}$8 is the Boolean query that returns true on $\mathrm{MON}$9 iff $$\mathrm{MonoRel}:=\mathrm{CQ}^{\subseteq}\cap \mathrm{MON}.$$0. Monotonicity is defined semantically: a Boolean query $$\mathrm{MonoRel}:=\mathrm{CQ}^{\subseteq}\cap \mathrm{MON}.$$1 is monotone if for all instances $$\mathrm{MonoRel}:=\mathrm{CQ}^{\subseteq}\cap \mathrm{MON}.$$2,

$$\mathrm{MonoRel}:=\mathrm{CQ}^{\subseteq}\cap \mathrm{MON}.$$3

MonoRel is precisely the subcollection of containment queries with this monotonicity property (Surinx et al., 2018).

2. Preservation theorem and expressive equivalence

The central theorem states that restricting containment-of-CQ queries to the monotone fragment yields no Boolean queries beyond conjunctive-query nonemptiness. In its global form,

$$\mathrm{MonoRel}:=\mathrm{CQ}^{\subseteq}\cap \mathrm{MON}.$$4

Equivalently, for every pair of conjunctive queries $$\mathrm{MonoRel}:=\mathrm{CQ}^{\subseteq}\cap \mathrm{MON}.$$5, the Boolean query

$$\mathrm{MonoRel}:=\mathrm{CQ}^{\subseteq}\cap \mathrm{MON}.$$6

is monotone if and only if there exists a conjunctive query $$\mathrm{MonoRel}:=\mathrm{CQ}^{\subseteq}\cap \mathrm{MON}.$$7 such that, for all instances $$\mathrm{MonoRel}:=\mathrm{CQ}^{\subseteq}\cap \mathrm{MON}.$$8,

$$\mathrm{MonoRel}:=\mathrm{CQ}^{\subseteq}\cap \mathrm{MON}.$$9

The result is therefore a preservation theorem in the precise sense that a semantic restriction—monotonicity—forces a syntactic collapse to the language of CQ nonemptiness (Surinx et al., 2018).

The theorem is asymmetric in difficulty. The easy direction is that every CQ nonemptiness query is monotone and can be represented within the containment formalism. The substantive content is the converse: given a monotone containment $\mathcal T$0, one can construct a single conjunctive query $\mathcal T$1 whose nonemptiness reproduces exactly the same yes/no behavior on all finite instances (Surinx et al., 2018).

This characterization isolates the exact expressive boundary of monotone CQ containments. Containment syntax may appear richer than nonemptiness syntax because it compares two query answers rather than inspecting one. The theorem shows that, once monotonicity is imposed, this apparent extra expressive latitude disappears (Surinx et al., 2018).

3. Proof architecture

The proof proceeds through a structural reduction of the containment query. The first step is Head Elimination. If a monotone containment $\mathcal T$2 is given, then it is equivalent to one in which both heads are empty: $\mathcal T$3 The proof idea uses a one-element instance $\mathcal T$4 containing a single fact $\mathcal T$5 for each $\mathcal T$6 to force homomorphisms to identify head positions, and then applies monotonicity to transfer the argument from $\mathcal T$7 to arbitrary instances (Surinx et al., 2018).

The second step is a minimality analysis of the left-hand body. If $\mathcal T$8 and $\mathcal T$9 with $\mathrm{MonoRel}=\mathrm{CQ}^{\neq}$0 minimal, then a nontrivial monotone case can only occur when $\mathrm{MonoRel}=\mathrm{CQ}^{\neq}$1 is very small. More precisely, if $\mathrm{MonoRel}=\mathrm{CQ}^{\neq}$2, then either the containment is equivalent to the constant true query or it fails to be monotone. The proof uses the Chandra–Merlin characterization of CQ containment together with the additivity of connected bodies to build a counterexample whenever the containment is nontrivial but not syntactically forced (Surinx et al., 2018).

After these reductions, the proof turns to a case analysis on $\mathrm{MonoRel}=\mathrm{CQ}^{\neq}$3. The one-atom case is decisive. If $\mathrm{MonoRel}=\mathrm{CQ}^{\neq}$4 contains exactly one atom $\mathrm{MonoRel}=\mathrm{CQ}^{\neq}$5, then the connected components of $\mathrm{MonoRel}=\mathrm{CQ}^{\neq}$6 can be partitioned according to whether they must map into that single $\mathrm{MonoRel}=\mathrm{CQ}^{\neq}$7-atom or into other parts of an instance. This yields a subset $\mathrm{MonoRel}=\mathrm{CQ}^{\neq}$8 of the connected components of $\mathrm{MonoRel}=\mathrm{CQ}^{\neq}$9 such that the original monotone containment is equivalent to the Boolean query defined by the conjunctive query

$\mathrm{CQ}^{\neq}$0

Since nonemptiness of that $\mathrm{CQ}^{\neq}$1 is a CQ nonemptiness test, the equivalence with $\mathrm{CQ}^{\neq}$2 follows (Surinx et al., 2018).

A plausible implication is that MonoRel is best viewed not as a genuinely new query formalism, but as a semantic subclass whose members admit canonical reduction to ordinary existential pattern detection.

4. Canonical example

A standard example uses the schema $\mathrm{CQ}^{\neq}$3 and the Boolean conjunctive queries

$\mathrm{CQ}^{\neq}$4

For an instance $\mathrm{CQ}^{\neq}$5, the containment $\mathrm{CQ}^{\neq}$6 holds exactly when every $\mathrm{CQ}^{\neq}$7-fact in $\mathrm{CQ}^{\neq}$8 has a corresponding $\mathrm{CQ}^{\neq}$9-fact in $\mathcal T$0, that is: $\mathcal T$1 This containment is monotone, because adding facts can only make the implication easier to satisfy (Surinx et al., 2018).

The preservation theorem requires a single CQ whose nonemptiness captures the same Boolean behavior. In this case, the body of $\mathcal T$2 has two connected components, $\mathcal T$3 and $\mathcal T$4, and the monotone analysis selects the $\mathcal T$5-component. The resulting conjunctive query is

$\mathcal T$6

Its nonemptiness test says that the instance contains at least one $\mathcal T$7-fact, which is exactly the condition that renders the presence of $\mathcal T$8-facts harmless with respect to the containment $\mathcal T$9 (Surinx et al., 2018).

This example exhibits the general mechanism of the theorem. The containment query is not interpreted as a comparison between two arbitrary answer sets; instead, its monotone content is distilled into the existence of a specific component pattern already present in the right-hand query.

5. Consequences for syntax, expressivity, and complexity

The theorem yields a syntactic characterization of a semantic notion. The condition “$R\in\mathcal T$0 is monotone” is semantic, since it quantifies over all instance extensions. The result shows that this semantic condition is captured exactly by the syntactic language $R\in\mathcal T$1 (Surinx et al., 2018).

A second consequence is no extra power. Allowing containment of two conjunctive queries may appear to enlarge the Boolean expressive resources available to database query languages. For monotone Boolean queries, however, it does not: beyond testing CQ nonemptiness, containment syntax contributes no additional expressive power (Surinx et al., 2018).

A third consequence concerns complexity. As a by-product of the same case distinctions used in the proof, testing monotonicity of $R\in\mathcal T$2 is NP-complete (Surinx et al., 2018). This places the semantic recognition problem for MonoRel within a familiar complexity-theoretic landscape: expressive collapse does not imply trivial recognizability.

The paper also places the result in the broader tradition of homomorphism-preservation and Lyndon-type theorems in finite model theory, specialized here to CQ containments (Surinx et al., 2018). This suggests that MonoRel is part of a wider family of phenomena in which monotonicity or positivity constraints force syntactic simplification.

6. Terminological scope in adjacent literatures

The term monotone relation is used in several technically distinct research areas, and these usages should not be conflated with the database-theoretic notion of MonoRel. In Banach-space operator theory, a linear relation $R\in\mathcal T$3 is monotone when

$R\in\mathcal T$4

for all graph points, and for maximally monotone linear relations the dense type, negative-infimum type, and Fitzpatrick–Phelps type are equivalent and coincide with monotonicity of the adjoint (Bauschke et al., 2011). In finite-dimensional Euclidean spaces, monotone linear relations admit explicit maximally monotone linear subspace extensions characterized through the symmetric matrix $R\in\mathcal T$5 (Wang et al., 2011), and the relationships among strict, paramonotone, $R\in\mathcal T$6-cyclic, $R\in\mathcal T$7, and maximal monotonicity have been analyzed systematically for linear relations in Hilbert space (Edwards, 2012). In abstract PDE theory, elliptic boundary-value problems in divergence form can be reformulated as inversion of a maximal monotone relation in a Hilbert space (Trostorff et al., 2012), while stochastic homogenization of random maximal monotone operators uses Fitzpatrick’s variational formulation, Visintin’s scale integration/disintegration theory, and Tartar–Murat compensated compactness (Lussardi et al., 2017).

In metric geometry, monotone relations have also been defined for Hadamard spaces. There, a relation $R\in\mathcal T$8 is monotone if

$R\in\mathcal T$9

for all $\mathrm{CQ}^{\subseteq}$00, and with the $\mathrm{CQ}^{\subseteq}$01-property one obtains the characterization

$\mathrm{CQ}^{\subseteq}$02

(Moslemipour et al., 2019).

In model theory and finite-variable logic, “monotone” binary relations on linear orders are interval-preserving relations. Over linear orders expanded by such relations, monadic first-order logic has the three-variable property, yielding $\mathrm{CQ}^{\subseteq}$03 (Fortin, 2019).

These parallel usages underscore that MonoRel in database theory is a domain-specific abbreviation: it names the monotone fragment of containment-of-CQ Boolean queries, not the general theory of monotone multifunctions or interval-preserving binary relations.