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

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

2007-01-26

arxiv.org/abs/cs/0701171v1

Computer Science

Databases

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Zones Algorithm for Finding Points-Near-a-Point or Cross-Matching Spatial Datasets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Zones Algorithm for Finding Points-Near-a-Point or Cross-Matching Spatial Datasets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Zones Algorithm for Finding Points-Near-a-Point or Cross-Matching Spatial Datasets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-568220