Sciweavers

16 search results - page 1 / 4
» Cluster Based Hybrid Hash Join: Analysis and Evaluation
Sort
View
CLUSTER
2002
IEEE
13 years 9 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
VLDB
1989
ACM
140views Database» more  VLDB 1989»
13 years 8 months ago
The Effect of Bucket Size Tuning in the Dynamic Hybrid GRACE Hash Join Method
In this paper, we show detailed analysis and performance evaluation of the Dynamic Hybrid GRACE Hash Join Method (DHGH Method) when the tuple distribution in buckets is unbalanced...
Masaru Kitsuregawa, Masaya Nakayama, Mikio Takagi
CN
2010
136views more  CN 2010»
13 years 4 months ago
PCIR: Combining DHTs and peer clusters for efficient full-text P2P indexing
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
BMCBI
2004
208views more  BMCBI 2004»
13 years 4 months ago
Hybrid clustering for microarray image analysis combining intensity and shape features
Background: Image analysis is the first crucial step to obtain reliable results from microarray experiments. First, areas in the image belonging to single spots have to be identif...
Jörg Rahnenführer, Daniel Bozinov
AINA
2007
IEEE
13 years 11 months ago
DHTs over Peer Clusters for Distributed Information Retrieval
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
Odysseas Papapetrou, Wolf Siberski, Wolf-Tilo Balk...