Sciweavers

122 search results - page 2 / 25
» Spatial Joins and R-trees
Sort
View
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
GEOINFORMATICA
1998
79views more  GEOINFORMATICA 1998»
13 years 5 months ago
Symbolic Intersect Detection: A Method for Improving Spatial Intersect Joins
Due to the increasing popularity of spatial databases, researchers have focused their efforts on improving the query processing performance of the most expensive spatial database ...
Yun-Wu Huang, Matthew C. Jones, Elke A. Rundenstei...
GIS
2002
ACM
13 years 5 months ago
Search algorithms for multiway spatial joins
This papers deals with multiway spatial joins when (i) there is limited time for query processing and the goal is to retrieve the best possible solutions within this limit (ii) the...
Dimitris Papadias, Dinos Arkoumanis
DKE
2002
94views more  DKE 2002»
13 years 5 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