Sciweavers

354 search results - page 4 / 71
» Efficient Processing of Spatial Joins Using R-Trees
Sort
View
ICPADS
2000
IEEE
13 years 11 months ago
Parallel Spatial Joins Using Grid Files
The most costly spatial operation in spatial databases is a spatial join with combines objects from two data sets based on spatial predicates. Even if the execution time of sequen...
Jin-Deog Kim, Bonghee Hong
COSIT
1995
Springer
111views GIS» more  COSIT 1995»
13 years 11 months ago
Range Queries Involving Spatial Relations: A Performance Analysis
: Spatial relations are becoming an important aspect of spatial access methods because of the increasing interest on qualitative spatial information processing. In this paper we sh...
Yannis Theodoridis, Dimitris Papadias
GIS
2007
ACM
13 years 11 months ago
Pipelined spatial join processing for quadtree-based indexes
Spatial join is an important yet costly operation in spatial databases. In order to speed up the execution of a spatial join, the input tables are often indexed based on their spa...
Walid G. Aref
GIS
2002
ACM
13 years 7 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
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
14 years 8 months ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...