Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/33414
Title: On matrices and K-relations
Authors: BRIJDER, Robert 
GYSSENS, Marc 
VAN DEN BUSSCHE, Jan 
Issue Date: 2020
Publisher: Springer
Source: International Symposium on Foundations of Information and Knowledge Systems, Springer, p. 42 -57
Series/Report: Lecture Notes in Computer Science
Abstract: 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 re-lational 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.
Keywords: expressive power;provenance semirings;annotated relations;data science
Document URI: http://hdl.handle.net/1942/33414
ISBN: 978-3-030-39951-1
DOI: https://doi.org/10.1007/978-3-030-39951-1_3
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
arak_foiks_conf.pdfPeer-reviewed author version358.12 kBAdobe PDFView/Open
Show full item record

Page view(s)

56
checked on Sep 5, 2022

Download(s)

20
checked on Sep 5, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.