Database queries and constraints via lifting problems

DOI10.1017/S0960129513000479MaRDI QIDQ5740402zbMATH OpenOpenAlexFDO

Authors David I. Spivak

Publication date 26 July 2016

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1202.2591

Mathematics Subject Classification ID

Database theory (68P15)

Abstract: 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. In particular, to any database $pi$ we can associate a certain derived database $Qry(pi)$ of queries on $pi$. As an application, we explain how giving users access to certain parts of $Qry(pi)$, rather than direct access to $pi$, improves ones ability to manage the impact of schema evolution.

Recommendations

• Constraint Databases
• Constraint databases, queries and query languages
• Decomposing constraint satisfaction problems using database techniques
• scientific article; zbMATH DE number 4049152
• Linear-constraint databases
• Uniform Constraint Satisfaction Problems and Database Theory
• Constraint databases
• scientific article; zbMATH DE number 1406247

Cites work

• Categories for the working mathematician.
• Functorial data migration
• Generalized sketches as a framework for completeness theorems. I-III
• Higher Topos Theory (AM-170)
• Homotopy theoretic models of identity types
• scientific article; zbMATH DE number 1324388 (Why is no real title available?)
• scientific article; zbMATH DE number 1860105 (Why is no real title available?)
• Polynomial functors and polynomial monads
• Quasi-categories and Kan complexes
• Understanding the small object argument
• Update semantics of relational views

Cited in

(7)

• Fast left Kan extensions using the chase
• Relational lattices: from databases to universal algebra
• Algebraic data integration
• scientific article; zbMATH DE number 7453981 (Why is no real title available?)
• A diagrammatic view of differential equations in physics
• Composing Cagean silence
• Compositional separation of control flow and data flow

This page was built for publication: Database queries and constraints via lifting problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740402)