Sciweavers

122 search results - page 1 / 25
» Spatial Joins and R-trees
Sort
View
SSD
1999
Springer
97views Database» more  SSD 1999»
13 years 12 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 11 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
VLDB
1995
ACM
121views Database» more  VLDB 1995»
13 years 11 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
ICDE
1997
IEEE
130views Database» more  ICDE 1997»
14 years 9 months ago
High-Dimensional Similarity Joins
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal
TKDE
2002
127views more  TKDE 2002»
13 years 7 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...