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

From Algorithm Wiki

Revision as of 07:54, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

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

Space Complexity

$O(log n)$

(https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S1877050915019675, Table 2)

Description

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=R-tree_(Nearest_Neighbor_Search_(NNS)_Nearest_Neighbor_Search)&oldid=46944"