DKE
2002
13 years 4 months ago
2002
The distance join is a spatial join that finds pairs of closest objects in the order of distance by associating two spatial data sets. The distance join stores node pairs in a pri...
ESANN
2000
13 years 5 months ago
2000
Many large -scale spatial data analysis problems involve an investigation of relationships in heterogeneous databases. In such situations, instead of making predictions uniformly a...
IPPS
1997
IEEE
13 years 8 months ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
SIGMOD
2000
ACM
13 years 9 months ago
2000
ACM
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
ICML
2000
IEEE
14 years 5 months ago
2000
IEEE
If all features causing heterogeneity were observed, a mixture of experts approach (Jacobs et al., 1991) is likely to be superior to using a single model. When unobserved or very n...