Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
Data-parallel primitives for performing operations on the PM1 quadtree and the bucket PMR quadtree are presented using the scan model. Algorithms are described for building these ...
The most costly spatial operation in spatial databases is a spatial join with combines objects from two data sets based on spatial predicates. Even if the execution time of sequen...
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les....
Two new spatial join operations, distance join and distance semijoin, are introduced where the join output is ordered by the distance betweenthe spatialattribute values ofthe join...