Relational Operations in FOLE

03/19/2021
by   Robert E. Kent, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/19/2022

FOLE Equivalence

The first-order logical environment FOLE provides a rigorous and princip...
04/12/2020

A Relational Matrix Algebra and its Implementation in a Column Store

Analytical queries often require a mixture of relational and linear alge...
06/02/2017

Knowledge Representation in Bicategories of Relations

We introduce the relational ontology log, or relational olog, a knowledg...
06/29/2021

Is 2NF a Stable Normal Form?

Traditionally, it was accepted that a relational database can be normali...
05/25/2019

LUTNet: speeding up deep neural network inferencing via look-up tables

We consider the use of look-up tables (LUT) to speed up and simplify the...
09/25/2019

On the Expressiveness of LARA: A Unified Language for Linear and Relational Algebra

We study the expressive power of the LARA language – a recently proposed...
01/12/2022

Towards a Catalog of Composite Refactorings

Catalogs of refactoring have key importance in software maintenance and ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.