Performance?

Now i'm curious too, but i hope, that results will pretty same:) I will publish results, when i will try it

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.

I completely agree with you. But i think, that r-tree is faster with RS, but kD-tree is faster with kNN

That's an interesting theory, could perhaps be the case. I might test that some time.

Good point about the minimum bounding rectangles. Thinking about it some more, I suspect that the RS speed of a kd-tree that uses minimum bounding rectangles, would be extremely similar to that of a R-tree really. Sure, the partitioning is a bit different but both have reasonable enough partitioning and with the minimum bounding rectangles the search algorithm would basically be the same.

Yeah, that rebalancing aspect is what prompted me to do some r-tree experiments in the past.