indexing - R-Tree and Quadtree Comparison -


I want to compare R-tree and quatttree for geospatial data. While there literature is available, I struggle to find documents that cover the actual basic comparison. So I decided to ask this question.

In my opinion, R-tree has the advantage of being balanced and there are no empty leaves of the tree. In the form of a loss, the basic process of inserting or removing can result in whole index restructuring. .

Quatratie is opposite, it is not balanced and empty straps, but it does not need to be restricted.

In this way, as a visitor, I would say that the R-tree needs less memory and it is faster to search because of its low altitude. Quatttree is better when there are several update-operations, but the resulting tree may be unbalanced.

Is this point right in your opinion? Are there any good documents that cover this topic?

Auf Wiedersehen, Andre

"restructuring the whole index" No. R-tree restructuring is limited to a single path, not the "complete" index. It actually works like a B-tree.

To apply both and consider doing some benchmark, actually know how they do not only use the theory.

Equally with a high transformation frequency On distributed data, QuadTrats will usually work better. On the disk, R-trees have clear advantages.

Comments

Popular posts from this blog

Pass DB Connection parameters to a Kettle a.k.a PDI table Input step dynamically from Excel -

multithreading - PhantomJS-Node in a for Loop -

c++ - MATLAB .m file to .mex file using Matlab Compiler -