Pith. sign in

REVIEW 1 cited by

Parachute: Single-Pass Bi-Directional Information Passing

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.13670 v1 pith:ZR4WESQ7 submitted 2025-06-16 cs.DB

Mihail Stoian , Andreas Zimmerer , Skander Krid , Amadou Latyr Ngom , Jialin Ding , Tim Kraska , Andreas Kipf This is my paper · ORCID
classification cs.DB
keywords informationpassingbi-directionalexecutionflowparachuteproductionquery
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Sideways information passing is a well-known technique for mitigating the impact of large build sides in a database query plan. As currently implemented in production systems, sideways information passing enables only a uni-directional information flow, as opposed to instance-optimal algorithms, such as Yannakakis'. On the other hand, the latter require an additional pass over the input, which hinders adoption in production systems. In this paper, we make a step towards enabling single-pass bi-directional information passing during query execution. We achieve this by statically analyzing between which tables the information flow is blocked and by leveraging precomputed join-induced fingerprint columns on FK-tables. On the JOB benchmark, Parachute improves DuckDB v1.2's end-to-end execution time without and with semi-join filtering by 1.54x and 1.24x, respectively, when allowed to use 15% extra space.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Instance-Optimized String Fingerprints

    cs.DB 2025-07 conditional novelty 5.0 of 10

    A mixed-integer optimization model assigns characters to fingerprint bins per workload, reducing LIKE false positives and yielding up to 1.36x faster table scans in DuckDB.

Pith tools