60 search results - page 7 / 12 » Data-Parallel Spatial Join Algorithms |
TKDE
1998
13 years 7 months ago
1998
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
The increasing use of temporal and spatial data in presentday relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms...
ADBIS
1994
Springer
13 years 11 months ago
1994
Springer
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
ICDE
1997
IEEE
14 years 8 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...
SSD
1999
Springer
13 years 11 months ago
1999
Springer
The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are ...