Sciweavers

7 search results - page 1 / 2
» Memory-Contention Responsive Hash Joins
Sort
View
VLDB
1994
ACM
101views Database» more  VLDB 1994»
13 years 9 months ago
Memory-Contention Responsive Hash Joins
In order to maximize systemperformancein environments with fluctuating memory contention, memory-intensive algorithms such as hash join must gracefully adapt to variations in avai...
Diane L. Davison, Goetz Graefe
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
14 years 7 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
EDBT
2008
ACM
129views Database» more  EDBT 2008»
14 years 5 months ago
Continuous multi-way joins over distributed hash tables
This paper studies the problem of evaluating continuous multi-way joins on top of Distributed Hash Tables (DHTs). We present a novel algorithm, called recursive join (RJoin), that...
Stratos Idreos, Erietta Liarou, Manolis Koubarakis
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
13 years 10 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
TELETRAFFIC
2007
Springer
13 years 11 months ago
Estimating Churn in Structured P2P Networks
In structured peer-to-peer (P2P) networks participating peers can join or leave the system at arbitrary times, a process which is known as churn. Many recent studies revealed that ...
Andreas Binzenhöfer, Kenji Leibnitz