There Goes the Neighborhood: Relational Algebra for Spatial Data Search

Simple item page
dc.creatorGray, Jim
dc.creatorSzalay, Alexander S.
dc.creatorThakar, Aniruddha R.
dc.creatorFekete, Gyorgy
dc.creatorO'Mullane, William
dc.creatorNieto-Santisteban, Maria A.
dc.creatorHeber, Gerd
dc.creatorRots, Arnold H.
dc.date2004-08-14
dc.date.accessioned2026-07-07T03:21:39Z
dc.date.available2026-07-07T03:21:39Z
dc.descriptionWe 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.
dc.descriptionOriginal at http://research.microsoft.com/research/pubs/view.aspx?tr_id=736
dc.identifierhttps://arxiv.org/abs/cs/0408031
dc.identifierhttp://arxiv.org/abs/cs/0408031
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32288
dc.subjectDatabases
dc.subjectC.4
dc.titleThere Goes the Neighborhood: Relational Algebra for Spatial Data Search
dc.typetext

Files

Collections

arXiv