The 2DR-tree is a novel approach for access spatial data, which uses
nodes that are the same dimensionality as the data space. Therefore, all
relationships between objects are preserved and different binary search
strategies are supported. This paper presents the 2DR-tree binary search
strategy. Validity rules ensure that each node preserves all spatial
relationships. A performance evaluation shows the advantages of the 2DR-tree
binary search strategy.
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at firstname.lastname@example.org