Fast Matrix Multiplication for Query Processing
X Hu - Proceedings of the ACM on Management of Data, 2024 - dl.acm.org
This paper studies how to use fast matrix multiplication to speed up query processing. As
observed, computing a two-table join and then projecting away the join attribute is …
observed, computing a two-table join and then projecting away the join attribute is …
Longest common extensions with wildcards: Trade-off and applications
G Bathie, P Charalampopoulos… - arXiv preprint arXiv …, 2024 - arxiv.org
We study the Longest Common Extension (LCE) problem in a string containing wildcards.
Wildcards (also called" don't cares" or" holes") are special characters that match any other …
Wildcards (also called" don't cares" or" holes") are special characters that match any other …
Output-Optimal Algorithms for Join-Aggregate Queries
X Hu - arXiv preprint arXiv:2406.05536, 2024 - arxiv.org
The classic Yannakakis framework proposed in 1981 is still the state-of-the-art approach for
tackling acyclic join-aggregate queries defined over commutative semi-rings. It has been …
tackling acyclic join-aggregate queries defined over commutative semi-rings. It has been …
Matrix Multiplication Verification Using Coding Theory
H Bennett, K Gajulapalli, A Golovnev… - arXiv preprint arXiv …, 2023 - arxiv.org
We study the Matrix Multiplication Verification Problem (MMV) where the goal is, given three
$ n\times n $ matrices $ A $, $ B $, and $ C $ as input, to decide whether $ AB= C $. A …
$ n\times n $ matrices $ A $, $ B $, and $ C $ as input, to decide whether $ AB= C $. A …
[PDF][PDF] Output-Optimal Algorithms for Acyclic Join-Aggregate Queries
X Hu - arXiv preprint arXiv:2406.05536, 2024 - cs.uwaterloo.ca
The classic Yannakakis framework proposed in 1981 is still the state-of-the-art approach for
tackling acyclic join-aggregate queries [28, 19] defined over commutative semi-rings. It has …
tackling acyclic join-aggregate queries [28, 19] defined over commutative semi-rings. It has …