Sciweavers

354 search results - page 1 / 71
» Efficient Processing of Spatial Joins Using R-Trees
Sort
View
TKDE
2002
127views more  TKDE 2002»
13 years 5 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
SSD
1999
Springer
97views Database» more  SSD 1999»
13 years 9 months ago
A Performance Evaluation of Spatial Join Processing Strategies
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
Apostolos Papadopoulos, Philippe Rigaux, Michel Sc...
ADBIS
1995
Springer
112views Database» more  ADBIS 1995»
13 years 9 months ago
Spatial Joins and R-trees
One of the most important operations in spatial access needed systems are spatial joins. Using for processing such operations R-tree like structures is intensively studies now. Th...
M. G. Martynov
PODS
1999
ACM
133views Database» more  PODS 1999»
13 years 9 months ago
Processing and Optimization of Multiway Spatial Joins Using R-Trees
One of the most important types of query processing in spatial databases and geographic information systems is the spatial join, an operation that selects, from two relations, all...
Dimitris Papadias, Nikos Mamoulis, Yannis Theodori...
DASFAA
2004
IEEE
124views Database» more  DASFAA 2004»
13 years 9 months ago
Polygon and Polyline Join Using Raster Filters
Processing spatial joins efficiently is crucial to rendering the spatial data analysis process feasible. As pointed out in many works, the exact intersection test of two spatial ob...
Rodrigo Salvador Monteiro, Leonardo Guerreiro Azev...