Aug 2026· Proceedings of the VLDB Endowment· Vol 19, pp. 3996-4008· 0 citations· 34 references
TL;DR
This work implements composition in Amazon Redshift through FastCompose, a complementary technique in which query-time code generation emits only lightweight glue code to arrange pre-compiled operators into a query-specific execution plan, rather than re-emitting or compiling any operator logic, at a fraction of the cost of full compilation.
Abstract
Compilation-based query execution produces optimized machine code per query but introduces a cold-start problem: when the compiled code is not cached, the query stalls during compilation, delaying data processing by up to orders of magnitude relative to the query's execution time. This overhead dominates short-running queries and creates latency variability for both interactive analytics and ETL pipelines. We introduce
composition
, a complementary technique in which query-time code generation emits only lightweight glue code to arrange pre-compiled operators into a query-specific execution plan, rather than re-emitting or compiling any operator logic, at a fraction of the cost of full compilation. Composition eliminates the cold-start stall while compilation catches up in the background and takes over for peak performance. We implement composition in Amazon Redshift through
FastCompose
, which enables both modes from a single code-base without relying on a separate fallback engine for cold runs. Compared to compilation-only cold starts (with caching and serverless compilation active), FastCompose achieves 7.0× speedup on TPC-DS 100 GB, 2.0× on TPC-DS 3 TB, 12.0× on TPC-H 100 GB, and 1.6× on TPC-H 3 TB. FastCompose is deployed across thousands of Redshift clusters. On production workloads, composition reduces cold-start dashboard load times by 3.5× and ETL duration by 1.9×, removing compilation as a bottleneck.
A low-latency MLIR compilation backend based on TPDE that by-passes the LLVM lowering and compilation pipeline is introduced and techniques that reduce MLIR’s intrinsic overhead are proposed.
Jonas Ladner, Lukas Döllerer, Alexis Engelke et al.· 0 citations
eBPF allows user-defined programs to safely extend Linux kernel functionality at runtime, but its final machine code comes from a compilation pipeline that differs from native targets, and how efficient that pipeline is has no clear reference point. Our work constructs one: using the standard LLVM x86 backend as an app...
Hoang Duong, Hao Sun, Zhen-Dong Su· Proceedings of the 4th Works...· 0 citations
SemBaker acts as an external plugin rather than replacing a backend's native execution, a compilation-based execution engine for semantic operator systems, and achieves average speedups and cost reductions across three 200-query QA workloads.
User-written Triton kernels enable high-performance GPU computation within PyTorch, but their end-to-end latency can remain dominated by host-side orchestration, especially when device execution is short. Although torch.compile can generate native host wrappers for captured graphs, each invocation still passes through...
Jin-Jie Liu, Xiao-Yan Liu, Shu-Han Zhang et al.· 0 citations
This work builds on Rhyme, a declarative language whose object-notation syntax mirrors the structure of query results, and refine Rhyme's semantics for generator binding and missing values, allowing co-iteration, inner/outer joins, and nested-loop traversals to be expressed under different uses of generator symbols.
Ran Guo, Tiark Rompf· Proceedings of the VLDB Endo...· 0 citations
This work presents vla.simd, a CPU inference engine that combines shared SIMD micro-kernels, reusable computation, and target-specific optimization, and introduces IMPACT, an ACT-based policy with cached text representations and language-modulated visual features.
Khanh Duy Nguyen, Hoang M. Truong, A. T. Le· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.