Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45391
Title: Searching the 2DR-tree
Authors: Osborn, Wendy
Barker, Ken
Keywords: Computer Science
Issue Date: 11-May-2004
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.
URI: http://hdl.handle.net/1880/45391
Appears in Collections:Barker, Ken

Files in This Item:
File Description SizeFormat 
2004-751-16.pdf960.81 kBAdobe PDFView/Open
2004-751-16.ps611.28 kBPostscriptView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.