Sciweavers

165 search results - page 6 / 33
» Parallel Processing of Spatial Joins Using R-trees
Sort
View
COMAD
1994
13 years 9 months ago
An Adaptive, Load Balancing Parallel Join Algorithm
Many parallel join algorithms have been proposed in the last several years. However, most of these algorithms require that the amount of data to be joined is known in advance in o...
Minesh B. Amin, Donovan A. Schneider, V. Singh
ADBIS
2003
Springer
95views Database» more  ADBIS 2003»
14 years 1 months ago
Distance Join Queries of Multiple Inputs in Spatial Databases
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
SIGMOD
2006
ACM
158views Database» more  SIGMOD 2006»
14 years 8 months ago
Continuous query processing in data streams using duality of data and queries
Recent data stream systems such as TelegraphCQ have employed the well-known property of duality between data and queries. In these systems, query processing methods are classified...
Hyo-Sang Lim, Jae-Gil Lee, Min-Jae Lee, Kyu-Young ...
SIGMOD
2012
ACM
288views Database» more  SIGMOD 2012»
11 years 11 months ago
Exploiting MapReduce-based similarity joins
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Sim...
Yasin N. Silva, Jason M. Reed
PVLDB
2008
182views more  PVLDB 2008»
13 years 8 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...