Sciweavers

Share
DKE
2002
94views more  DKE 2002»
8 years 8 months ago
Tie-breaking strategies for fast distance join processing
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...
Hyoseop Shin, Bongki Moon, Sukho Lee
ESANN
2000
8 years 9 months ago
Distributed clustering and local regression for knowledge discovery in multiple spatial databases
Many large -scale spatial data analysis problems involve an investigation of relationships in heterogeneous databases. In such situations, instead of making predictions uniformly a...
Aleksandar Lazarevic, Dragoljub Pokrajac, Zoran Ob...
IPPS
1997
IEEE
9 years 15 days ago
Maintaining Spatial Data Sets in Distributed-Memory Machines
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...
Susanne E. Hambrusch, Ashfaq A. Khokhar
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
9 years 20 days ago
Closest Pair Queries in Spatial Databases
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...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
ICML
2000
IEEE
9 years 9 months ago
Discovering Homogeneous Regions in Spatial Data through Competition
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...
Slobodan Vucetic, Zoran Obradovic
books