110 search results - page 7 / 22 » Data-Parallel R-Tree Algorithms |
158
click to vote
ADBIS
1995
Springer
15 years 9 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...
160
click to vote
SSD
1999
Springer
15 years 10 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...
153
click to vote
CCCG
2006
15 years 7 months ago
2006
A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we in...
282
click to vote
ICDE
1997
IEEE
16 years 7 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...
147
click to vote
SIGMOD
2000
ACM
15 years 10 months ago
2000
ACM
The coming years will witness dramatic advances in wireless communications as well as positioning technologies. As a result, tracking the changing positions of objects capable of ...