pith. sign in

arxiv: cs/0701171 · v1 · submitted 2007-01-26 · 💻 cs.DB · cs.DS

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

classification 💻 cs.DB cs.DS
keywords zonesalgorithmarticlecross-matchdatabasedatasetsimplementationpoints-near-a-point
0
0 comments X
read the original abstract

Zones 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.