title: Performance of RTree vs kd-trees
body: <p>I have around 10 K points in 5 dimensional space. We can assume that the points are randomly distributed in space (0,0,0,0,0) and (100,100,100,100,100). Clearly, the whole data set can easily reside in memory.</p>
  
  <p>I would like to know which algorithm for k nearest neighbour would run faster, kd-tree or RTree. </p>
  
  <p>Although I have some very high level idea of these two algorithms, I am not sure which will run faster, and why. I am open to exploring other algorithms if any, which could run fast. Please, if possible, specify why an algorithm may run faster.</p>