In this pupcar, we propose U spaliul qwrv languagt., called GSQL, to hurdle complex spatial olvects such us points, lines, rectangles, or polygons. To implemcvtt the ypatiul operutors such JS nearest, furthest, intersect, CO ver, adjacent-to, end-at, and distance. we present U two-phase query processing technique ionwt ing of a filter phase urd a refinement phase. The filter phase i s h u e d o...
