Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/30378
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | BRIJDER, Robert | - |
dc.contributor.author | GEERTS, Floris | - |
dc.contributor.author | VAN DEN BUSSCHE, Jan | - |
dc.contributor.author | WEERWAG, Timmy | - |
dc.date.accessioned | 2020-01-23T13:17:38Z | - |
dc.date.available | 2020-01-23T13:17:38Z | - |
dc.date.issued | 2019 | - |
dc.date.submitted | 2020-01-22T13:19:55Z | - |
dc.identifier.citation | ACM TRANSACTIONS ON DATABASE SYSTEMS, 44 (4) (Art N° 15) | - |
dc.identifier.issn | 0362-5915 | - |
dc.identifier.uri | http://hdl.handle.net/1942/30378 | - |
dc.description.abstract | We investigate the expressive power of MATLANG, a formal language for matrix manipulation based on common matrix operations and linear algebra. The language can be extended with the operation inv for inverting a matrix. In MATLANG + inv we can compute the transitive closure of directed graphs, whereas we show that this is not possible without inversion. Indeed we show that the basic language can be simulated in the relational algebra with arithmetic operations, grouping, and summation. We also consider an operation eigen for diagonalizing a matrix. It is defined such that for each eigenvalue a set of mutually orthogonal eigenvectors is returned that span the eigenspace of that eigenvalue. We show that inv can be expressed in MATLANG + eigen. We put forward the open question whether there are boolean queries about matrices, or generic queries about graphs, expressible in MATLANG + eigen but not in MATLANG + inv. Finally, the evaluation problem for MATLANG + eigen is shown to be complete for the complexity class ∃R. | - |
dc.language.iso | en | - |
dc.publisher | ASSOC COMPUTING MACHINERY | - |
dc.rights | © 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM. | - |
dc.subject.other | Matrix query languages | - |
dc.subject.other | relational algebra with aggregates | - |
dc.subject.other | query evaluation problem | - |
dc.subject.other | graph queries | - |
dc.title | On the Expressive Power of Query Languages for Matrices | - |
dc.type | Journal Contribution | - |
dc.identifier.issue | 4 | - |
dc.identifier.volume | 44 | - |
local.bibliographicCitation.jcat | A1 | - |
local.publisher.place | 1515 BROADWAY, NEW YORK, NY 10036-9998 USA | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
local.bibliographicCitation.artnr | 15 | - |
dc.source.type | Meeting | - |
dc.identifier.doi | 10.1145/3331445 | - |
dc.identifier.isi | WOS:000535714000003 | - |
dc.identifier.eissn | 1557-4644 | - |
local.provider.type | - | |
local.uhasselt.uhpub | yes | - |
item.fullcitation | BRIJDER, Robert; GEERTS, Floris; VAN DEN BUSSCHE, Jan & WEERWAG, Timmy (2019) On the Expressive Power of Query Languages for Matrices. In: ACM TRANSACTIONS ON DATABASE SYSTEMS, 44 (4) (Art N° 15). | - |
item.contributor | BRIJDER, Robert | - |
item.contributor | GEERTS, Floris | - |
item.contributor | VAN DEN BUSSCHE, Jan | - |
item.contributor | WEERWAG, Timmy | - |
item.accessRights | Open Access | - |
item.fulltext | With Fulltext | - |
crisitem.journal.issn | 0362-5915 | - |
crisitem.journal.eissn | 1557-4644 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
matlang-crc.pdf | Peer-reviewed author version | 875.03 kB | Adobe PDF | View/Open |
3331445.pdf Restricted Access | Published version | 762.28 kB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
1
checked on Sep 3, 2020
WEB OF SCIENCETM
Citations
12
checked on Sep 20, 2024
Page view(s)
60
checked on Sep 7, 2022
Download(s)
52
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.