Sciweavers

165 search results - page 3 / 33
» Parallel Processing of Spatial Joins Using R-trees
Sort
View
ICPP
1994
IEEE
13 years 10 months ago
Data-Parallel Spatial Join Algorithms
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
Erik G. Hoel, Hanan Samet
COSIT
1995
Springer
111views GIS» more  COSIT 1995»
13 years 10 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 10 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
TKDE
2002
148views more  TKDE 2002»
13 years 6 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
13 years 10 months ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...