Please use this identifier to cite or link to this item:
|Title:||The 2DR-tree: A 2-dimensional spatial access method|
|Abstract:||This paper presents the 2DR-tree, a novel approach for accessing spatial data. The 2DR-tree uses nodes that are the same dimensionality as the data space. Therefore, all relationships between objects are preserved and different searching strategies such as binary and greedy are supported. The insertion and deletion strategies both use a binary partition of a node to insert an object or update a non-leaf minimum bounding rectangle. A validity test ensures that each node involved in an insertion or deletion preserves the spatial relationships among its objects. A performance evaluation shows the advantages of the 2DR-tree and identifies issues for future consideration.|
|Appears in Collections:||Barker, Ken|
Files in This Item:
|2004-750-15.pdf||1.74 MB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.