A multi-level caching and upper-bound pruning technique enables efficient interleaving of cost-based optimization with query rewrites in bottom-up DBMS optimizers, cutting overall optimization time when implemented in GaussDB.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Cost-Based Rewrite in a Bottom-Up Optimizer
A multi-level caching and upper-bound pruning technique enables efficient interleaving of cost-based optimization with query rewrites in bottom-up DBMS optimizers, cutting overall optimization time when implemented in GaussDB.