Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
How can R* Tree be implemented as a persistent (disk based) one? What is the architecture of the file for saving the R* Tree index or for saving leaf values?
Notes: In addition how insert, update and delete operations can be performed in such a persistent R* Tree?
Notes II: I have implemented an in-memory R-Tree with bulk load functionality. But I think that is totally irrelevant when we speak about disk-based ones.
If you need to have an on-disk R-Tree index, I would suggest using Spatialite or Postgis. Spatialite is lightweight and easy to embed in a standalone application. Alternatively, have you looked at the C# Spatial Index project?. I wrote an R-Tree implementation in Java a few years back and wouldn’t recommend doing it if something already exists.