354 search results - page 7 / 71 » Efficient Processing of Spatial Joins Using R-Trees |
GIS
2006
ACM
14 years 8 months ago
2006
ACM
Efficient evaluation of spatial queries is an important issue in spatial database. Among spatial operations, spatial join is very useful, intersection being the most common predic...
PVLDB
2010
13 years 2 months ago
2010
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
SIGMOD
1997
ACM
13 years 11 months ago
1997
ACM
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
GIS
1997
ACM
13 years 11 months ago
1997
ACM
Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve...