Pages that link to "Item:Q1869749"
From MaRDI portal
The following pages link to On R-trees with low query complexity (Q1869749):
Displaying 11 items.
- Efficient \(c\)-oriented range searching with DOP-trees (Q1000927) (← links)
- Cache-oblivious R-trees (Q1017905) (← links)
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension (Q1376406) (← links)
- Efficient bulk operations on dynamic \(R\)-trees (Q1601035) (← links)
- R-trees: theory and applications (Q1775219) (← links)
- Algorithms for improving the quality of \(R\)-trees (Q1779948) (← links)
- Box-trees and R-trees with near-optimal query time (Q1849440) (← links)
- Hyperorthogonal well-folded Hilbert curves (Q2970470) (← links)
- On Cartesian Trees and Range Minimum Queries (Q3638046) (← links)
- Box-trees and R-trees with near-optimal query time (Q5361567) (← links)
- Cache-oblivious R-trees (Q5370610) (← links)