SearcharxivSearch

arXiv subjects

Ilsun Chang

Publications and source records attributed to Ilsun Chang.

3 recordsLinked to original sources

Cross-Layer Decision Timing Orchestration in Cost-Based Database Systems: Resolving Structural Temporal Misalignment

This paper analyzes execution instability in traditional cost-based database management systems (DBMS) and identifies a structural timing misalignment between optimization and execution stages that contributes to tail-latency amplification. Beyond estimation accuracy and raw execution throughput, we argue that decision timing and the availability of runtime signals materially affect robustness under uncertainty. In conventional DBMS architectures, the optimizer relies on historical statistics, the executor observes runtime data distributions and resource states, and accelerators impose up-front transfer costs and amortization constraints. This temporal asynchrony can lead to rigid early-bound decisions that fail under input-scale shifts or stale statistics. We propose a cross-layer decision timing orchestration framework that shifts final decision authority from the compile-time optimizer to the runtime executor via selective late binding of operator-level choices. A Unified Risk Signal (URS) integrates optimizer uncertainty, execution-time observations, and accelerator cost signals without collapsing them into a single static cost model. Experiments on a modified PostgreSQL prototype evaluate (i) input-scale shift, (ii) stale-statistics drift, and (iii) GPU offload break-even regimes using controlled microbenchmarks. The proposed orchestration improves execution stability, reducing P99 latency by up to 20x under severe estimation drift while maintaining comparable median latency.

cs.DB

GPU-Augmented OLAP Execution Engine: GPU Offloading

Modern OLAP systems have mitigated I/O bottlenecks via storage-compute separation and columnar layouts, but CPU costs in the execution layer (especially Top-K selection and join probe) are emerging as new bottlenecks at scale. This paper proposes a hybrid architecture that augments existing vectorized execution by selectively offloading only high-impact primitives to the GPU. To reduce data movement, we use key-only transfer (keys and pointers) with late materialization. We further introduce a Risky Gate (risk-aware gating) that triggers offloading only in gain/risk intervals based on input size, transfer, kernel and post-processing costs, and candidate-set complexity (K, M). Using PostgreSQL microbenchmarks and GPU proxy measurements, we observe improved tail latency (P95/P99) under gated offloading compared to always-on GPU offloading. This work extends the risk-aware gating principle used for optimizer-stage GPU-assisted measurement (arXiv:2512.19750) to execution-layer OLAP primitives.

cs.AR

Risk-Aware GPU-Assisted Cardinality Estimation for Cost-Based Query Optimizers

Cardinality estimation is a cornerstone of cost-based optimizers (CBOs), yet real-world workloads often violate the assumptions behind static statistics, degrading decision stability and increasing plan flip rates. We empirically characterize failures caused by stale statistics, skew, join correlations, hidden distributions in bind variables, and sampling bias, and quantify the overhead and break-even points of hardware-accelerated measurement. We propose GACE (GPU-Assisted Cardinality Estimation), a hybrid auxiliary architecture that augments rather than replaces the optimizer. GACE selectively invokes GPU-based measurement only in risky intervals via a Risky Gate that detects estimation uncertainty, and a GPU Measurement Engine that performs high-speed probing with explicit cost accounting for the measurement itself. This design preserves low overhead in stable regions while improving plan stability and reducing tail latency (P99) in problematic scenarios.

cs.DB