A survey unifying view, index, and plan selection into one candidate selection problem, adding an NP-hardness proof and a claimed polynomial-time reuse optimization for RL View and BigSubs.
Lecture Notes in Computer Science 5022 (2008), 121–132
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DB 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
The Selection Problem in Multi-Query Optimization: a Comprehensive Survey
A survey unifying view, index, and plan selection into one candidate selection problem, adding an NP-hardness proof and a claimed polynomial-time reuse optimization for RL View and BigSubs.