Caching at the Bottom Heuristics
Policy
- cache all candidate collections
- increase cost of other operations as little as possible (i.e., early caching)
Algorithm
- extend optimizer to produce plan with Cache operators as low as possible (details in paper)
- pull-up Cache operators through pipeline
Pull-up reduces the number of irrelevant objects that are cached
without increasing the cost of pipelined operators