The Zones Algorithm for Finding Points-Near-a-Point or Cross-Matching Spatial Datasets

Simple item page
dc.creatorGray, Jim
dc.creatorNieto-Santisteban, Maria A.
dc.creatorSzalay, Alexander S.
dc.date2007-01-26
dc.date.accessioned2026-07-07T07:43:14Z
dc.date.available2026-07-07T07:43:14Z
dc.descriptionZones index an N-dimensional Euclidian or metric space to efficiently support points-near-a-point queries either within a dataset or between two datasets. The approach uses relational algebra and the B-Tree mechanism found in almost all relational database systems. Hence, the Zones Algorithm gives a portable-relational implementation of points-near-point, spatial cross-match, and self-match queries. This article corrects some mistakes in an earlier article we wrote on the Zones Algorithm and describes some algorithmic improvements. The Appendix includes an implementation of point-near-point, self-match, and cross-match using the USGS city and stream gauge database.
dc.identifierhttps://arxiv.org/abs/cs/0701171
dc.identifierhttp://arxiv.org/abs/cs/0701171
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122749
dc.subjectDatabases
dc.subjectData Structures and Algorithms
dc.titleThe Zones Algorithm for Finding Points-Near-a-Point or Cross-Matching Spatial Datasets
dc.typetext

Files

Collections

arXiv