Database query optimisation can be pushed below physical operators into index and loop internals, and early experiments show data density changes which grouping algorithm is fastest.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Case for Deep Query Optimisation
Database query optimisation can be pushed below physical operators into index and loop internals, and early experiments show data density changes which grouping algorithm is fastest.