DeepAI AI Chat
Log In Sign Up

On matrices and K-relations

by   Robert Brijder, et al.

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.


page 1

page 2

page 3

page 4


A Relational Matrix Algebra and its Implementation in a Column Store

Analytical queries often require a mixture of relational and linear alge...

dxo: A System for Relational Algebra and Differentiation

We present dxo, a relational system for algebra and differentiation, wri...

Cartesian bicategories with choice

Relational structures are emerging as ubiquitous mathematical machinery ...

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...

Introducing PathQuery, Google's Graph Query Language

We introduce PathQuery, a graph query language developed to scale with G...

Manifesto for Improved Foundations of Relational Model

Normalized relations extended with inherited attributes can be more fait...

Expressive power of linear algebra query languages

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