The 2DR-tree: A 2-dimensional spatial access method
| dc.contributor.author | Osborn, Wendy | eng |
| dc.contributor.author | Barker, Ken | eng |
| dc.date.accessioned | 2008-02-26T20:23:25Z | |
| dc.date.available | 2008-02-26T20:23:25Z | |
| dc.date.computerscience | 2004-05-04 | eng |
| dc.date.issued | 2004-05-04 | eng |
| dc.description.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. | eng |
| dc.description.notes | 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 digitize@ucalgary.ca | eng |
| dc.identifier.department | 2004-750-15 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30311 | |
| dc.identifier.uri | http://hdl.handle.net/1880/45390 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | The 2DR-tree: A 2-dimensional spatial access method | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |
Files
License bundle
1 - 1 of 1