Givens旋转用于数据库连接上的QR分解、SVD和PCA
Givens Rotations for QR Decomposition, SVD and PCA over Database Joins
AI总结:
本文提出Figaro算法,将QR分解推至数据库连接之后,实现无环连接下线性时间计算,并用于SVD和PCA,无需物化连接输出,实验表明其性能和精度优于Intel MKL。
摘要:
本文介绍了Figaro,一种用于计算关系数据上自然连接所定义矩阵的QR分解中上三角矩阵的算法。Figaro的主要新颖之处在于它将QR分解推到了连接之后。这带来了几个理想的特性。对于无环连接,它所需时间与数据库大小成线性关系,且与连接大小无关。其执行等价于应用一系列与连接大小成比例的Givens旋转。其相对于经典QR分解算法的舍入误差数量与数据库大小相对于连接输出大小的比例相当。QR分解是许多线性代数计算的核心,包括奇异值分解(SVD)和主成分分析(PCA)。我们展示了如何使用Figaro计算QR分解中的正交矩阵、SVD以及连接输出的PCA,而无需物化连接输出。一系列实验验证了Figaro在运行时性能和数值精度上均能超越LAPACK库Intel MKL,其优势因子与连接输出和输入大小之间的差距成比例。
英文摘要:
This article introduces Figaro, an algorithm for computing the upper-triangular matrix in the QR decomposition of the matrix defined by the natural join over relational data. Figaro's main novelty is that it pushes the QR decomposition past the join. This leads to several desirable properties. For acyclic joins, it takes time linear in the database size and independent of the join size. Its execution is equivalent to the application of a sequence of Givens rotations proportional to the join size. Its number of rounding errors relative to the classical QR decomposition algorithms is on par with the database size relative to the join output size. The QR decomposition lies at the core of many linear algebra computations including the singular value decomposition (SVD) and the principal component analysis (PCA). We show how Figaro can be used to compute the orthogonal matrix in the QR decomposition, the SVD and the PCA of the join output without the need to materialize the join output. A suite of experiments validate that Figaro can outperform both in runtime performance and numerical accuracy the LAPACK library Intel MKL by a factor proportional to the gap between the sizes of the join output and input.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。