paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Enumeration and updates for conjunctive linear algebra queries through expressibility

通过可表达性刻画合取线性代数查询的枚举与更新
LMCS vol.Volume 22, Issue 12026匹配度 2/10 · 该论文属于数据库理论与查询语言研究,讨论 MATLANG 线性代数程序的可表达性、常数延迟枚举和常数时间更新,与用户关注的静态分析、LLM/Agent、浮点程序分析或贝叶斯程序分析没有直接交集。仅在线性代数程序/DSL 形式化层面存在非常间接的关联。引用 0 inbox
Thomas Muñoz, Cristian Riveros, Stijn Vansummeren
crossref: 2026-09-10

AI 速览

一句话:界定 MATLANG 中与 free-connex、q-hierarchical 合取查询对应的片段,识别支持常数延迟枚举和常数时间更新的线性代数程序。

由于线性代数与矩阵运算在数据分析中日益重要,人们希望借助关系查询优化技术来求值稀疏线性代数程序。近期工作建立了线性代数程序与关系代数之间的紧密联系,从而可以迁移后者的优化技术。本文研究 MATLANG 中哪些线性代数程序对应于合取一阶逻辑的 free-connex 与 q-hierarchical 片段:前者支持线性时间预处理后的常数延迟枚举,后者进一步支持常数时间更新。作者改进并推广了 MATLANG 与在半环标注关系上求值的关系代数之间的对应关系,并识别出使复杂度界从布尔标注推广到一般半环成立的半环性质。通过刻画相应的 MATLANG 片段,本文识别出可常数延迟枚举与常数时间更新的线性代数程序片段。

问题
在 MATLANG 线性代数程序与关系代数已有对应关系的基础上,确定哪些线性代数程序对应于 free-connex 与 q-hierarchical 合取查询片段,从而享有高效枚举与更新特性。
方法
改进并推广 MATLANG 与在半环标注关系上求值的关系代数之间的对应关系,并识别半环性质,将 free-connex 和 q-hierarchical 合取查询的复杂度界从布尔标注推广到一般半环。
评估
以理论证明为主:给出 MATLANG 对应片段的表达力刻画,并证明这些片段可在线性时间预处理后实现常数延迟枚举,且支持常数时间更新。
原文摘要(Abstract)

Due to the importance of linear algebra and matrix operations in data analytics, there is significant interest in using relational query optimization and processing techniques for evaluating (sparse) linear algebra programs. In particular, in recent years close connections have been established between linear algebra programs and relational algebra that allow transferring optimization techniques of the latter to the former. In this paper, we ask ourselves which linear algebra programs in MATLANG correspond to the free-connex and q-hierarchical fragments of conjunctive first-order logic. Both fragments have desirable query processing properties: free-connex conjunctive queries support constant-delay enumeration after a linear-time preprocessing phase, and q-hierarchical conjunctive queries further allow constant-time updates. By characterizing the corresponding fragments of MATLANG, we hence identify the fragments of linear algebra programs that one can evaluate with constant-delay enumeration after linear-time preprocessing and with constant-time updates. To derive our results, we improve and generalize previous correspondences between MATLANG and relational algebra evaluated over semiring-annotated relations. In addition, we identify properties on semirings that allow to generalize the complexity bounds for free-connex and q-hierarchical conjunctive queries from Boolean annotations to general semirings.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@article{paperbot4036,
  title = {Enumeration and updates for conjunctive linear algebra queries through expressibility},
  author = {Thomas Muñoz and Cristian Riveros and Stijn Vansummeren},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 22, Issue 1},
  year = {2026},
  doi = {10.46298/lmcs-22(1:1)2025}
}