An ML-enhanced R-tree can process high-overlap range queries up to 5.4X faster than a traditional R-tree, with average query recall up to 99%, but only when the learned model is trained on the same query distribution.
Machine learning for databases: Foundations, paradigms, and open problems,
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
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Tradeoffs in Processing Queries and Supporting Updates over an ML-Enhanced R-tree
An ML-enhanced R-tree can process high-overlap range queries up to 5.4X faster than a traditional R-tree, with average query recall up to 99%, but only when the learned model is trained on the same query distribution.