On matrices and K-relations

04/08/2019
by   Robert Brijder, et al.
0

We show that the matrix query language MATLANG corresponds to a natural fragment of the positive relational algebra on K-relations. The fragment is defined by introducing a composition operator and restricting K-relation arities to two. We then proceed to show that MATLANG can express all matrix queries expressible in the positive relational algebra on K-relations, when intermediate arities are restricted to three. Thus we offer an analogue, in a model with numerical data, to the situation in classical logic, where the algebra of binary relations is equivalent to first-order logic with three variables.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
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...
research
08/08/2020

dxo: A System for Relational Algebra and Differentiation

We present dxo, a relational system for algebra and differentiation, wri...
research
03/20/2020

Cartesian bicategories with choice

Relational structures are emerging as ubiquitous mathematical machinery ...
research
02/11/2020

Theories of real addition with and without a predicate for integers

We show that it is decidable whether or not a relation on the reals defi...
research
02/21/2018

A Dual Tableau-based Decision Procedure for a Relational Logic with the Universal Relation (Extended Version)

We present a first result towards the use of entailment in- side relatio...
research
06/17/2021

Introducing PathQuery, Google's Graph Query Language

We introduce PathQuery, a graph query language developed to scale with G...
research
10/26/2020

Expressive power of linear algebra query languages

Linear algebra algorithms often require some sort of iteration or recurs...

Please sign up or login with your details

Forgot password? Click here to reset