165 search results - page 1 / 33 » Parallel Processing of Spatial Joins Using R-trees |
SSD
1999
Springer
15 years 1 months ago
1999
Springer
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
ADBIS
1995
Springer
15 years 1 months ago
1995
Springer
One of the most important operations in spatial access needed systems are spatial joins. Using for processing such operations R-tree like structures is intensively studies now. Th...
151
Voted
ICDE
1996
IEEE
15 years 11 months ago
1996
IEEE
ICPADS
2000
IEEE
15 years 1 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...
TKDE
2002
14 years 9 months ago
2002
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...