Pith. sign in

REVIEW 4 cited by

Terabyte-Scale Analytics in the Blink of an Eye

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2506.09226 v2 pith:QMPVIUBG submitted 2025-06-10 cs.DB cs.DCcs.PF

Terabyte-Scale Analytics in the Blink of an Eye

Bowen Wu , Wei Cui , Carlo Curino , Matteo Interlandi , Rathijit Sen This is my paper
classification cs.DB cs.DCcs.PF
keywords performanceclustersdataanalyticsblinkcommunitydistributedgains
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

For the past two decades, the DB community has devoted substantial research to take advantage of cheap clusters of machines for distributed data analytics -- we believe that we are at the beginning of a paradigm shift. The scaling laws and popularity of AI models lead to the deployment of incredibly powerful GPU clusters in commercial data centers. Compared to CPU-only solutions, these clusters deliver impressive improvements in per-node compute, memory bandwidth, and inter-node interconnect performance. In this paper, we study the problem of scaling analytical SQL queries on distributed clusters of GPUs, with the stated goal of establishing an upper bound on the likely performance gains. To do so, we build a prototype designed to maximize performance by leveraging ML/HPC best practices, such as group communication primitives for cross-device data movements. This allows us to conduct thorough performance experimentation to point our community towards a massive performance opportunity of at least 60$\times$. To make these gains more relatable, before you can blink twice, our system can run all 22 queries of TPC-H at a 1TB scale factor!

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. veScale-FSDP: Flexible and High-Performance FSDP at Scale

    cs.DC 2026-02 unverdicted novelty 6.0

    veScale-FSDP uses RaggedShard and structure-aware planning to support block-wise quantization and non-element-wise optimizers while delivering 5-66% higher throughput and 16-30% lower memory than prior FSDP systems at...

  2. High-Performance DBMSs with io_uring: When and How to use it

    cs.DB 2025-12 conditional novelty 6.0

    Databases get ~2x from io_uring only with async architecture plus registered buffers, passthrough, polling, and zero-copy; naive swapping gains only ~1.1x.

  3. PystachIO: Efficient Distributed GPU Query Processing with PyTorch over Fast Networks & Fast Storage

    cs.DB 2025-12 unverdicted novelty 5.0

    PystachIO is a PyTorch-based distributed OLAP engine that delivers up to 3x end-to-end speedups for storage-resident queries by combining fast RDMA networks, NVMe storage, and I/O-computation overlap optimizations.

  4. To GPU or Not to GPU: Vector Search in Relational Engines

    cs.DB 2026-05 conditional novelty 4.0

    Relational engines achieve faster SQL+vector-search queries on GPU than CPU when using compact vector indexes and fast interconnects, reversing the CPU-only design in current systems.