736 search results - page 19 / 148 » Confidence-Aware Join Algorithms |
SIGMOD
1997
ACM
15 years 3 months ago
1997
ACM
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
VLDB
1994
ACM
15 years 4 months ago
1994
ACM
In order to maximize systemperformancein environments with fluctuating memory contention, memory-intensive algorithms such as hash join must gracefully adapt to variations in avai...
115
Voted
SIGMETRICS
2010
ACM
15 years 17 days ago
2010
ACM
This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
105
click to vote
SIGMOD
1999
ACM
15 years 4 months ago
1999
ACM
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined...