Sciweavers

91 search results - page 1 / 19
» Improving Hash Join Performance through Prefetching
Sort
View
ICDE
2004
IEEE
88views Database» more  ICDE 2004»
14 years 6 months ago
Improving Hash Join Performance through Prefetching
Shimin Chen, Anastassia Ailamaki, Phillip B. Gibbo...
CIKM
1994
Springer
13 years 9 months ago
TID Hash Joins
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
Robert Marek, Erhard Rahm
ICPP
2003
IEEE
13 years 10 months ago
Enabling Partial Cache Line Prefetching Through Data Compression
Hardware prefetching is a simple and effective technique for hiding cache miss latency and thus improving the overall performance. However, it comes with addition of prefetch buff...
Youtao Zhang, Rajiv Gupta
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 5 months ago
Improving Index Performance through Prefetching
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...
Shimin Chen, Phillip B. Gibbons, Todd C. Mowry
NGITS
1997
Springer
13 years 9 months ago
Faster Joins, Self Joins and Multi-Way Joins Using Join Indices
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross....
Hui Lei, Kenneth A. Ross