Database queries and constraints via lifting problems

Understand

Previous work has demonstrated that categories are useful and expressive models for databases.

• In the present paper we build on that model, showing that certain queries and constraints correspond to lifting problems, as found in modern approaches to algebraic topology.
• In our formulation, each so-called SPARQL graph pattern query corresponds to a category-theoretic lifting problem, whereby the set of solutions to the query is precisely the set of lifts.
• We interpret constraints within the same formalism and then investigate some basic properties of queries and constraints.