Pith. sign in

REVIEW 2 cited by

Query Processing on Tensor Computation Runtimes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.01877 v4 pith:3PIP5BDH submitted 2022-03-03 cs.DB cs.AIcs.LG

classification cs.DBcs.AIcs.LG
keywords tensorhardwarecomputationquerysystemsofferedqueriesruntimes
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. RTCUDB: Building Databases with RT Processors

    cs.DB 2024-12 conditional novelty 7.0 of 10

    RTCUDB encodes database rows as 3D triangles and runs queries as ray-tracing jobs, claiming up to 18.3x speedup over the state-of-the-art CUDA GPU database Crystal.

  2. AI Query Compilation for Unified and Optimized Execution

    cs.DB 2026-08 conditional novelty 6.0 of 10

    Compiling SQL and LLM inference into one JAX tensor program removes split-execution data transfers and yields reported speedups on TPUs, with trade-offs at high filter selectivity.

Pith tools