Sciweavers

354 search results - page 2 / 71
» Efficient Processing of Spatial Joins Using R-Trees
Sort
View
SIGMOD
1993
ACM
78views Database» more  SIGMOD 1993»
13 years 9 months ago
Efficient Processing of Spatial Joins Using R-Trees
Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard See...
TKDE
1998
122views more  TKDE 1998»
13 years 5 months ago
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
Ming-Ling Lo, Chinya V. Ravishankar
SSD
2001
Springer
94views Database» more  SSD 2001»
13 years 10 months ago
Selectivity Estimation of Complex Spatial Queries
Several studies have focused on the efficient processing of simple spatial query types such as selections and spatial joins. Little work, however, has been done towards the optimiz...
Nikos Mamoulis, Dimitris Papadias
SIGMOD
1999
ACM
98views Database» more  SIGMOD 1999»
13 years 10 months ago
Integration of Spatial Join Algorithms for Processing Multiple Inputs
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined...
Nikos Mamoulis, Dimitris Papadias
VLDB
1995
ACM
121views Database» more  VLDB 1995»
13 years 9 months ago
Benchmarking Spatial Join Operations with Spatial Output
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
Erik G. Hoel, Hanan Samet