I have been doing some reading on Priority R-Trees (PR-Trees). R-trees are the equivalent of B-trees for spatial data. Apparently, PR-Tree perform must like R-trees on average, but with a much better worst case analysis.

Reference

Lars Arge, Mark de Berg, Herman Haverkort, and Ke Yi, The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree, In Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data (SIGMOD ’04), Paris, France, June 2004, 347-358.

No Comments »

No comments yet.

Leave a comment

Warning: When entering a long comment, please ensure that you make copy of your text prior to submitting it. If the server should fail or if you hit a bug, you might lose your work. I am not responsible for your lost effort.

To spammers: I carefully review every single post and make sure that spam gets deleted. You are wasting your time if you are manually entering spam using this form. Read my terms of use to see what I consider to be abusive.

Example: duo plus septem is '9'. The numbers are expressed in latin numerals but you should give your answers using ordinary digits.

 

« Blog's main page

Powered by WordPress