Sciweavers

354 search results - page 5 / 71
» Efficient Processing of Spatial Joins Using R-Trees
Sort
View
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
13 years 11 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...
TKDE
2002
148views more  TKDE 2002»
13 years 7 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...
DKE
2006
123views more  DKE 2006»
13 years 7 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
DANTE
1999
IEEE
149views Database» more  DANTE 1999»
13 years 11 months ago
Parallel R-Tree Spatial Join for a Shared-Nothing Architecture
The growing importance of spatial data has made it imperative that spatial operations be executed efficiently. The most expensive operation is the join for spatial databases. This...
Lawrence Mutenda, Masaru Kitsuregawa
ICDE
2003
IEEE
157views Database» more  ICDE 2003»
14 years 8 months ago
Energy Efficient Index for Querying Location-Dependent Data in Mobile Broadcast Environments
We are witnessing in recent years growing interest for location-dependent information services among mobile users. This paper examines the issue of processing locationdependent qu...
Jianliang Xu, Baihua Zheng, Wang-Chien Lee, Dik Lu...