Spatial query processing in geographic database systems

In this paper, we propose a spatial query language, called GSQL, to handle complex spatial objects such as points, fines, rectangles, or polygons. To implement the spatial operators such as nearest, furthest, intersect, cover, adjacent to, end at, and distance, we present a two-phase query processing technique consisting of a filter phase and a refinement phase. The filter phase is based on spatial access methods. However, the filter phase does not exactly evaluate the query and yields a set of candidate objects which may fulfil the query condition. Therefore, the candidate objects have to be examined in the refinement phase. This phase applies complex algorithms used in the field of computational geometry to the original spatial objects and detects exactly those objects finally fulfilling the query condition.
Publisher
IEEE
Issue Date
1994
Citation

EUROMICRO 94. System Architecture and Integration. Proceedings of the 20th EUROMICRO Conference. September 1994. pp.53-60

ISBN
0-8186-6430-4
DOI
10.1109/EURMIC.1994.390406
URI
http://hdl.handle.net/10203/4276
Appears in Collection
KGSM-Conference Papers(학술회의논문)
Files in This Item
1994-007.pdf(817.89 kB)Download
  • Hit : 457
  • Download : 455
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0