Sciweavers

736 search results - page 5 / 148
» Confidence-Aware Join Algorithms
Sort
View
ICC
2011
IEEE
236views Communications» more  ICC 2011»
12 years 8 months ago
0 to 10k in 20 Seconds: Bootstrapping Large-Scale DHT Networks
—A handful of proposals address the problem of bootstrapping a large DHT network from scratch, but they all forgo the standard DHT join protocols in favor of their own distribute...
Jae Woo Lee, Henning Schulzrinne, Wolfgang Kellere...
CIKM
2006
Springer
14 years 8 days ago
Efficient join processing over uncertain data
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar, Ra...
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
13 years 8 days ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
SSD
1999
Springer
97views Database» more  SSD 1999»
14 years 24 days ago
A Performance Evaluation of Spatial Join Processing Strategies
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
Apostolos Papadopoulos, Philippe Rigaux, Michel Sc...
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
14 years 10 months ago
Hash-Merge Join: A Non-blocking Join Algorithm for Producing Fast and Early Join Results
This paper introduces the hash-merge join algorithm (HMJ, for short); a new non-blocking join algorithm that deals with data items from remote sources via unpredictable, slow, or ...
Mohamed F. Mokbel, Ming Lu, Walid G. Aref