Metraipolis › archive › dc_d27e76fab910
Numerical Stability of Linear Algebra Operations over Relational Databases — arXiv:2609.13802
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13802
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T02:15:14.065Z
- SHA-256 of the archived text
f19f1fb3fd400d63275bb11758e64fde56aac27c6708a68cb1563ecc5bb06aec- Stable URL of this page
https://metraipolis.com/documento/dc_d27e76fab910
How to cite
Numerical Stability of Linear Algebra Operations over Relational Databases — arXiv:2609.13802 — arXiv (en), https://arxiv.org/abs/2609.13802 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d27e76fab910 (Metraipolis archive dc_d27e76fab910, sha256 f19f1fb3fd400d63275bb11758e64fde56aac27c6708a68cb1563ecc5bb06aec)
BibTeX
@misc{dcd27e76fab910,
title = {Numerical Stability of Linear Algebra Operations over Relational Databases — arXiv:2609.13802},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13802},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d27e76fab910; sha256 f19f1fb3fd400d63275bb11758e64fde56aac27c6708a68cb1563ecc5bb06aec},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13802. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A large body of work in the database literature develops efficient algorithms for linear algebra and machine learning over matrices defined by relational joins, yet the numerical stability of such computations has so far received no attention. This is a practical concern: a join matrix can be much larger than the input database, and the repeated copies of input values it contains compound the floating-point errors incurred by the numerical operations performed over it. This paper initiates a formal investigation of numerical stability for linear algebra over database joins. We first show that backward stability, the standard yardstick of numerical stability, loses its effectiveness in this setting: join matrices form a structured subspace of the ambient matrix space, so a perturbation explaining a computed result need not correspond to any perturbed input database. This failure already occurs for operations as simple as matrix-vector multiplication. To overcome this limitation, we introduce projected backward stability, a generalization of backward stability from the computation of one function to that of a composition of two functions, and establish its connection to classical backward stability. In our database setting, the two functions are the join query and the numerical operation. We further introduce the database condition number as the square root of the ratio of maximal to minimal number of copies of input data values into the join matrix, and show that it quantifies how a perturbation of the join matrix is amplified into a perturbation of the input database, independently of the computation used. The database condition number coincides with the classical condition number of the expansion matrix that replicates input values into the join matrix. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-15 in cs.DB). Categorie arXiv: Databases (cs.DB). Pagina del lavoro: https://arxiv.org/abs/2609.13802 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T01:53:21.329Z dalla pagina https://arxiv.org/catchup/cs.DB/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).