DBAILGMar 3, 2022

Query Processing on Tensor Computation Runtimes

UW
arXiv:2203.01877v453 citationsh-index: 40
Originality Incremental advance
AI Analysis

This work addresses the problem of efficiently leveraging specialized AI hardware for database systems, offering a novel integration that reduces development effort and improves performance, though it is incremental in combining existing SQL and tensor computation paradigms.

The paper tackles the challenge of integrating database query processing with AI hardware by designing Tensor Query Processor (TQP), which transforms SQL queries into tensor programs and executes them on tensor computation runtimes, achieving up to 10x speedup in query execution time and up to 9x speedup for queries mixing ML predictions and SQL.

The huge demand for computation in artificial intelligence (AI) is driving unparalleled investments in hardware and software systems for AI. This leads to an explosion in the number of specialized hardware devices, which are now offered by major cloud vendors. By hiding the low-level complexity through a tensor-based interface, tensor computation runtimes (TCRs) such as PyTorch allow data scientists to efficiently exploit the exciting capabilities offered by the new hardware. In this paper, we explore how database management systems can ride the wave of innovation happening in the AI space. We design, build, and evaluate Tensor Query Processor (TQP): TQP transforms SQL queries into tensor programs and executes them on TCRs. TQP is able to run the full TPC-H benchmark by implementing novel algorithms for relational operators on the tensor routines. At the same time, TQP can support various hardware while only requiring a fraction of the usual development effort. Experiments show that TQP can improve query execution time by up to 10$\times$ over specialized CPU- and GPU-only systems. Finally, TQP can accelerate queries mixing ML predictions and SQL end-to-end, and deliver up to 9$\times$ speedup over CPU baselines.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes