Computer Science – Databases
Scientific paper
2004-08-14
Computer Science
Databases
Original at http://research.microsoft.com/research/pubs/view.aspx?tr_id=736
Scientific paper
We explored ways of doing spatial search within a relational database: (1) hierarchical triangular mesh (a tessellation of the sphere), (2) a zoned bucketing system, and (3) representing areas as disjunctive-normal form constraints. Each of these approaches has merits. They all allow efficient point-in-region queries. A relational representation for regions allows Boolean operations among them and allows quick tests for point-in-region, regions-containing-point, and region-overlap. The speed of these algorithms is much improved by a zone and multi-scale zone-pyramid scheme. The approach has the virtue that the zone mechanism works well on B-Trees native to all SQL systems and integrates naturally with current query optimizers - rather than requiring a new spatial access method and concomitant query optimizer extensions. Over the last 5 years, we have used these techniques extensively in our work on SkyServer.sdss.org, and SkyQuery.net.
Fekete Gyorgy
Gray Jim
Heber Gerd
Nieto-Santisteban Maria A.
O'Mullane William
No associations
LandOfFree
There Goes the Neighborhood: Relational Algebra for Spatial Data Search 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 There Goes the Neighborhood: Relational Algebra for Spatial Data Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and There Goes the Neighborhood: Relational Algebra for Spatial Data Search will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-696651