Database Paper Browser

Back to papers

Expressive Power of Linear Algebra Query Languages

Summary: Extend MATLANG with dimension-bounded recursion (loops up to matrix size) to express classical linear-algebra algorithms such as Gaussian elimination and matrix inversion. Characterize expressiveness as arithmetic-circuit families; subfragments correspond to logics on semiring-annotated relations. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1809
Venue
PODS
Year
2021
Pagerank
4.534839e-05
Overall Rank
8,369 | 41.78%
DOI
10.1145/3452021.3458314

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
5,994 A Query Language Perspective on Graph Learning 2023 PODS 5.2415551e-05
10,997 Automating Vectorized Distributed Graph Computation 2024 SIGMOD 4.1945683e-05
11,363 Givens QR Decomposition over Relational Databases 2022 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
31 Provenance Semirings 2007 PODS 0.0007857786
4,409 Declarative Recursive Computation on an RDBMS 2019 VLDB 6.2104034e-05
Previous Page 1 / 1 Next

Semantically Similar Papers