Skip to content

Fast Matrix Multiplication for Database Query Processing

Oct 2026 · ACM SIGMOD Record · Vol 55, pp. 26 - 27 · 0 citations · 14 references

TL;DR

This research drives the core insight of the research: a comprehensive exploration of FMM within database query engines, bringing the theoretical power of algebraic techniques to practical data systems.

Abstract

Motivation: Modern data analytical workloads – from graph processing to machine learning – have evolved significantly, increasingly combining JOIN with additional relational-algebra operators and aggregate functions (e.g., PROJECT and COUNT). Traditionally, database query processing has been dominated by discrete, logicbased primitives such as for-loops [9, 10, 13], tree decompositions [4], and data partitioning [6, 8], which are fundamentally combinatorial. However, the landscape changes when examining graph analytics, where algebraic algorithms – which treat query processing as a series of high-dimensional tensor or matrix operations – have achieved strictly lower theoretical complexity than the best-known combinatorial counterparts. Fast matrix multiplication (FMM) bridges this gap. As modern data systems increasingly integrate dedicated linear algebra kernels (e.g., for ML), repurposing these optimized algebraic engines for classical query processing offers immense potential. This drives the core insight of our research: a comprehensive exploration of FMM within database query engines, bringing the theoretical power of algebraic techniques to practical data systems.

View source

Similar papers

Open access Sep 2026

Expeditus: Database Optimization Based on Workload Analysis with Structural Query Clustering

Workload analysis is fundamental to database performance management, as heterogeneous and complex workloads require automated identification of similar query patterns. In this context, this work investigates whether SQL query clustering based on structural embeddings extracted from the workload can support more efficie...

M. Duarte, Júlio César de Lira Marinho, Angelo Brayner et al. · 0 citations
Preprint Oct 2026

The Case for TPU-Accelerated Analytical Query Processing

This paper presents the first comprehensive case for TPU-accelerated analytical query processing by running all the TPC-H queries entirely on the TPUs, and introduces Native TPU Accelerator (NTA) for analytical query processing, which provides hardware-conscious algorithm design and optimizations in JAX/XLA.

Yeounoh Chung, Jaehyun Ha, Helena Caminal et al. · 0 citations
Jul 2026

The Data World is Not Flat: Efficient Factorized Execution for Relational Systems

A novel code-generating engine with factorization that enables intra-query-parallelized query execution on factorized representations and generates code to overcome their CPU-unfriendly layout, offering a unified and scalable solution for modern workloads.

Stefan Lehner, Thomas Neumann · 0 citations
Open access Sep 2026

Metric Algebra: Embedding-Independence in Vector Databases

Vector databases are increasingly central to retrieval applications, yet deployments remain embedding-siloed: different databases store vectors produced by different embedding models and ANN pipelines, making cross-database search ill-defined or forcing expensive re-embedding and index rebuilds. We propose metric al...

Tian-Jian Yang, Yang Cao, Bei-Ning Yang et al. · 0 citations
Open access 2024

HYPERION-Q: A Graph-Guided Self-Validating and Hardware-Aware Framework for High-Performance Query Processing

Modern data management systems must simultaneously address three critical challenges: efficient query optimization for large queries, reliable detection of logical errors in database engines, and high-performance processing across heterogeneous hardware architectures. Traditional query optimizers rely on dynamic progra...

Praveen Kumar Kumbum, Ramachandra Reddy Vangala · 1 citation
Preprint Aug 2026

GRBench: A Comprehensive Benchmark Evaluation for Graph-relational Data Management

GRBench constructs a linked graph-relational schema from the real-world SciSciNet-v2 dataset and derives scalable instances through consistency-preserving subset extraction and evaluates representative system architectures through a unified, multidimensional methodology.

Ze-Peng Liu, Xin-Xin Huang, Xuan-Ming Liu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.