165 search results - page 2 / 33 » Parallel Processing of Spatial Joins Using R-trees |
PODS
1999
ACM
13 years 9 months ago
1999
ACM
One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all...
VLDB
1995
ACM
13 years 9 months ago
1995
ACM
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
ICDE
1997
IEEE
14 years 6 months ago
1997
IEEE
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
DASFAA
2004
IEEE
13 years 9 months ago
2004
IEEE
Processing spatial joins efficiently is crucial to rendering the spatial data analysis process feasible. As pointed out in many works, the exact intersection test of two spatial ob...
DANTE
1999
IEEE
13 years 9 months ago
1999
IEEE
The growing importance of spatial data has made it imperative that spatial operations be executed efficiently. The most expensive operation is the join for spatial databases. This...