-1

where can I find an efficient implementation of R-tree and the range query and neighbor searching especially in Python?

Want to understand how these queries work using the code.(i am a beginner)

user9500575
  • 1
  • 4

1 Answers1

0

You won't find an efficient version in (pure) Python.

Python is fairly expensive at working with complex data structures like the R-tree. For efficiency reasons, these are better implemented in Cython or even pure C, and only used from within Python. You can easily find some libraries for this with DuckDuckGo.

Has QUIT--Anony-Mousse
  • 76,138
  • 12
  • 138
  • 194
  • Can you share some link for this "Python is fairly expensive at working with complex data structures like the R-tree" or any reasons? – user9500575 Mar 11 '19 at 23:50
  • Interpreted code vs. compiled code. That is why Cython is used for, e.g., k-d-trees in sklearn. See https://en.m.wikipedia.org/wiki/Cython – Has QUIT--Anony-Mousse Mar 12 '19 at 00:32