Searching the 2DR-tree
Date
2004-05-11
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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.
Description
Keywords
Computer Science