基于提升问题的数据库查询和约束
Database queries and constraints via lifting problems
摘要：
以前的工作已经证明，类别是有用的和表达的数据库模型。在本文中，我们建立在该模型上，表明某些查询和约束对应于提升问题，发现在现代方法代数拓扑。在我们的公式中，每个所谓的SPARQL图模式查询对应于一个类别理论提升问题，其中查询的解决方案集正是提升集。我们解释相同的形式主义内的约束，然后调查查询和约束的一些基本属性。特别地，对于任何数据库$π$，我们可以将关于$π$的查询的某个导出数据库$\Qry(π)$关联。作为一个应用程序，我们解释了如何让用户访问某些部分的$\Qry(π)$，而不是直接访问$π$，提高了管理模式演变的影响的能力。
英文摘要：
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 $π$ we can associate a certain derived database $\Qry(π)$ of queries on $π$. As an application, we explain how giving users access to certain parts of $\Qry(π)$, rather than direct access to $π$, improves ones ability to manage the impact of schema evolution.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
