Searching the 2DR-tree

dc.contributor.author	Osborn, Wendy	eng
dc.contributor.author	Barker, Ken	eng
dc.date.accessioned	2008-02-26T20:23:30Z
dc.date.available	2008-02-26T20:23:30Z
dc.date.computerscience	2004-05-11	eng
dc.date.issued	2004-05-11	eng
dc.description.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.	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-751-16	eng
dc.identifier.doi	http://dx.doi.org/10.11575/PRISM/30310
dc.identifier.uri	http://hdl.handle.net/1880/45391
dc.language.iso	Eng	eng
dc.publisher.corporate	University of Calgary	eng
dc.publisher.faculty	Science	eng
dc.subject	Computer Science	eng
dc.title	Searching the 2DR-tree	eng
dc.type	unknown
thesis.degree.discipline	Computer Science	eng