59 search results - page 8 / 12 » Multi-Step Processing of Spatial Joins |
SSDBM
2006
IEEE
14 years 1 months ago
2006
IEEE
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML repres...
DKE
2006
13 years 7 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
GIS
2005
ACM
14 years 8 months ago
2005
ACM
When integrating geo-spatial datasets, a join algorithm is used for finding sets of corresponding objects (i.e., objects that represent the same real-world entity). Algorithms for...
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 ...
MDM
2005
Springer
14 years 1 months ago
2005
Springer
The ever-increasing popularity of mobile applications coupled with the prevalence of spatial data has created the need for efficient processing of spatial queries in mobile enviro...