Sciweavers

91 search results - page 4 / 19
» TID Hash Joins
Sort
View
CLUSTER
2002
IEEE
13 years 10 months ago
Cluster Based Hybrid Hash Join: Analysis and Evaluation
The join is the most important, but also the most time consuming operation in relational database systems. We implemented the parallel Hybrid Hash Join algorithm on a PC-cluster a...
Erich Schikuta, Peter Kirkovits
SIGMOD
2002
ACM
91views Database» more  SIGMOD 2002»
14 years 5 months ago
A scalable hash ripple join algorithm
Recently, Haas and Hellerstein proposed the hash ripple join algorithm in the context of online aggregation. Although the algorithm rapidly gives a good estimate for many join-agg...
Gang Luo, Curt J. Ellmann, Peter J. Haas, Jeffrey ...
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
IPPS
2003
IEEE
13 years 10 months ago
Performance Modeling of the Grace Hash Join on Cluster Architectures
Aim of the paper is to develop a concise but comprehensive analytical model for the well-known Grace Hash Join algorithm on cost effective cluster architectures. This approach is ...
Erich Schikuta
EDBTW
2006
Springer
13 years 9 months ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder