Please use this identifier to cite or link to this item:
|Title:||Searching the 2DR-tree|
|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.|
|Appears in Collections:||Barker, Ken|
Files in This Item:
|2004-751-16.pdf||960.81 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.