Database queries and constraints via lifting problems

DOI10.1017/S0960129513000479zbMATH Open1342.68117arXiv1202.2591OpenAlexW3102550479MaRDI QIDQ5740402FDOQ5740402

Authors: David I. Spivak 

Publication date: 26 July 2016

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

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.

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

Recommendations

• Constraint Databases
• Publication:4508935
• Decomposing constraint satisfaction problems using database techniques
• scientific article; zbMATH DE number 4049152
• Publication:4508942
• Uniform Constraint Satisfaction Problems and Database Theory
• scientific article; zbMATH DE number 1395614
• Publication:4939285

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Higher Topos Theory (AM-170)
• Understanding the small object argument
• Homotopy theoretic models of identity types
• Quasi-categories and Kan complexes
• Title not available (Why is that?)
• Update semantics of relational views
• Generalized sketches as a framework for completeness theorems. I-III
• Polynomial functors and polynomial monads
• Functorial data migration

Cited In (6)

• Composing Cagean silence
• Fast left Kan extensions using the chase
• Relational lattices: from databases to universal algebra
• Title not available (Why is that?)
• Algebraic data integration
• A diagrammatic view of differential equations in physics

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)