60 search results - page 2 / 12 » Data-Parallel Spatial Join Algorithms |
SSD
2001
Springer
13 years 9 months ago
2001
Springer
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...
ICPP
1995
IEEE
13 years 8 months ago
1995
IEEE
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 ...
ICPADS
2000
IEEE
13 years 9 months ago
2000
IEEE
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...
ICPP
1993
IEEE
13 years 9 months ago
1993
IEEE
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 ....
SIGMOD
1998
ACM
13 years 9 months ago
1998
ACM
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...