Enumeration and updates for conjunctive linear algebra queries through expressibility

DOI10.46298/LMCS-22(1:1)2025MaRDI QIDQ6858377zbMATH OpenFDO

Authors Thomas Muñoz, Cristian Riveros, Stijn Vansummeren

Publication date 13 February 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-22(1:1)2025

zbMATH Keywords

conjunctive queriesenumeration algorithmslinear algebraquery evaluation

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• Degrees of acyclicity for hypergraphs and relational database schemes
• Direct access for answers to conjunctive queries with aggregation
• First-order queries on structures of bounded degree are computable with constant delay
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1257742 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 922677 (Why is no real title available?)
• scientific article; zbMATH DE number 7650984 (Why is no real title available?)
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• On matrices and \(K\)-relations
• On the expressive power of linear algebra on graphs
• Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture

Cited in

(1)

• Direct access for answers to conjunctive queries with aggregation

This page was built for publication: Enumeration and updates for conjunctive linear algebra queries through expressibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858377)