Thread history

Fragment of a discussion from User talk:Jdev/Code/R Tree
Viewing a history listing
Jump to navigation Jump to search
Time User Activity Comment
No results

Hmm... that performance difference is fairly expected. kNN spends a lot of time doing distance calculations that RS doesn't need to do. Also, just a note.... I think the questions of using r-trees vs kd-trees should be separate from whether RS or kNN is used. I say that because well... both types of trees can do both types of searches.

Rednaxela23:11, 21 December 2011