Graphical Conjunctive Queries

by   Filippo Bonchi, et al.

The Calculus of Conjunctive Queries (CCQ) has foundational status in database theory. A celebrated theorem of Chandra and Merlin states that CCQ query inclusion is decidable. Its proof transforms logical formulas to graphs: each query has a natural model - a kind of graph - and query inclusion reduces to the existence of a graph homomorphism between natural models. We introduce the diagrammatic language Graphical Conjunctive Queries (GCQ) and show that it has the same expressivity as CCQ. GCQ terms are string diagrams, and their algebraic structure allows us to derive a sound and complete axiomatisation of query inclusion, which turns out to be exactly Carboni and Walters' notion of cartesian bicategory of relations. Our completeness proof exploits the combinatorial nature of string diagrams as (certain cospans of) hypergraphs: Chandra and Merlin's insights inspire a theorem that relates such cospans with spans. Completeness and decidability of the (in)equational theory of GCQ follow as a corollary. Categorically speaking, our contribution is a model-theoretic completeness theorem of free cartesian bicategories (on a relational signature) for the category of sets and relations.



There are no comments yet.


page 1

page 2

page 3

page 4


Completeness of Nominal PROPs

We introduce nominal string diagrams as string diagrams internal in the ...

Pictures of Processes: Automated Graph Rewriting for Monoidal Categories and Applications to Quantum Computing

This work is about diagrammatic languages, how they can be represented, ...

Relational Diagrams: a pattern-preserving diagrammatic representation of non-disjunctive Relational Queries

Analyzing relational languages by their logical expressiveness is well u...

String Diagrams for Regular Logic (Extended Abstract)

Regular logic can be regarded as the internal language of regular catego...

Strategic Coalitions in Stochastic Games

The article introduces a notion of a stochastic game with failure states...

Semantic Limits of Dense Combinatorial Objects

The theory of limits of discrete combinatorial objects has been thriving...

String Diagrammatic Electrical Circuit Theory

We develop a comprehensive string diagrammatic treatment of electrical c...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.