R-tree (Nearest Neighbor Search (NNS) Nearest Neighbor Search)

Time Complexity

R-Tree construction: $O(n \log n)$ NNS: $O(n)$

Space Complexity

$O(log n)$

(https://www.sciencedirect.com/science/article/pii/S1877050915019675, Table 2)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Real RAM

Year

1984

Reference

http://www-db.deis.unibo.it/courses/SI-LS/papers/Gut84.pdf