arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.11027cs.DB
收藏

FOLE中的关系运算

Relational Operations in FOLE

Robert E. Kent

摘要:

本文讨论一阶逻辑环境{FOLE}中的关系运算。在这里,我们演示了如何FOLE表达数据库理论的关系操作在一个清晰的和可实现的表示。分析了FOLE中数据库表/关系的表示,揭示了一种表示关系操作的原则性方法。这种表示是根据基本组件与复合关系操作之间的区别来表示的。9个基本组件分为三类:反射(2),布尔或基本操作(3)和伴随流(4)。给出了签名(2)和类型域(2)的伴随流,然后将其组合成完全伴随流。基本组件用于表示各种复合操作,我们用流程图说明每个操作。然后,复合操作的实现在包含四个部分的输入/输出表中表示:约束、构造、输入和输出。我们解释如何限制和colimits构造图表,然后将复合关系操作分为三类:限制,colimit和非正统。

英文摘要:

This paper discusses relational operations in the first-order logical environment {FOLE}. Here we demonstrate how FOLE expresses the relational operations of database theory in a clear and implementable representation. An analysis of the representation of database tables/relations in FOLE reveals a principled way to express the relational operations. This representation is expressed in terms of a distinction between basic components versus composite relational operations. The 9 basic components fall into three categories: reflection (2), Booleans or basic operations (3), and adjoint flow (4). Adjoint flow is given for signatures (2) and for type domains (2), which are then combined into full adjoint flow. The basic components are used to express various composite operations, where we illustrate each of these with a flowchart. Implementation of the composite operations is then expressed in an input/output table containing four parts: constraint, construction, input, and output. We explain how limits and colimits are constructed from diagrams of tables, and then classify composite relational operations into three categories: limit-like, colimit-like and unorthodox.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑