Sciweavers

Share
91 search results - page 1 / 19
» TID Hash Joins
Sort
View
CIKM
1994
Springer
9 years 11 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
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
10 years 8 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
VLDB
1999
ACM
107views Database» more  VLDB 1999»
9 years 11 months ago
The Value of Merge-Join and Hash-Join in SQL Server
Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loop...
Goetz Graefe
VLDB
1998
ACM
121views Database» more  VLDB 1998»
9 years 11 months ago
Hash Joins and Hash Teams in Microsoft SQL Server
The query execution engine in Microsoft SQL Server employs hash-based algorithms for inner and outer joins, semi-joins, set operations (such as intersection), grouping, and duplic...
Goetz Graefe, Ross Bunker, Shaun Cooper
NGITS
1997
Springer
9 years 11 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
books