Sciweavers

165 search results - page 7 / 33
» Parallel Processing of Spatial Joins Using R-trees
Sort
View

Publication
344views
12 years 6 months ago
Top-k Similarity Join over Multi-valued Objects
The top-k similarity joins have been extensively studied and used in a wide spectrum of applications such as information retrieval, decision making, spatial data analysis and dat...
Wenjie Zhang, Jing Xu, Xin Liang, Ying Zhang, Xuem...
ICDE
2008
IEEE
116views Database» more  ICDE 2008»
14 years 9 months ago
Network-Aware Join Processing in Global-Scale Database Federations
Abstract-- We introduce join scheduling algorithms that employ a balanced network utilization metric to optimize the use of all network paths in a global-scale database federation....
Xiaodan Wang, Randal C. Burns, Andreas Terzis, Amo...
ISPAN
2002
IEEE
14 years 1 months ago
Parallel Selection Query Processing Involving Index in Parallel Database Systems
Index is an important element in databases, and the existence of index is unavoidable. When an index has been built on a particular attribute, database operations (e.g. selection,...
J. Wenny Rahayu, David Taniar
SIGMOD
2010
ACM
277views Database» more  SIGMOD 2010»
14 years 1 months ago
A comparison of join algorithms for log processing in MaPreduce
The MapReduce framework is increasingly being used to analyze large volumes of data. One important type of data analysis done with MapReduce is log processing, in which a click-st...
Spyros Blanas, Jignesh M. Patel, Vuk Ercegovac, Ju...
DKE
2006
123views more  DKE 2006»
13 years 8 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...