Tailwind: A Practical Framework for Query Accelerators
Geoffrey X. Yu, Ryan Marcus, Tim Kraska

TL;DR
Tailwind introduces an external query planner that enables the integration of workload-specific accelerators into existing RDBMSs, significantly improving query performance through automatic, predictive query rewriting.
Contribution
It presents a novel framework with a declarative abstraction (ALPs) and neural network-based cost estimation to seamlessly incorporate custom accelerators into any RDBMS.
Findings
Achieved 1.38x average speedup on TPC-H queries with Redshift and DuckDB.
Demonstrated diverse accelerators can improve performance up to 29x.
Showed Tailwind's automatic rewriting effectively leverages accelerators for faster query execution.
Abstract
Relational database management systems (RDBMSes) can process general-purpose queries, but often have lower performance compared to custom-built solutions for specific queries. For example, consider a group-by query over a few known groups (e.g., grouping by country). While an RDBMS would likely use a hash map to do the grouping, a faster method could hard-code the expected groups into the query executor. But such workload-specific techniques, which we call query accelerators, are not widely used in practice because the engineering effort (optimizer and engine changes, potential bugs) does not justify the isolated performance gains (speedup on a single specific query). We propose Tailwind: an external query planner that brings accelerators into any RDBMS that supports data import/export. Users define their accelerators using abstract logical plans (ALPs): a new mostly-declarative…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
