91 search results - page 1 / 19 » TID Hash Joins |
CIKM
1994
Springer
13 years 8 months ago
1994
Springer
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...
ICDE
2004
IEEE
14 years 5 months ago
2004
IEEE
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 ...
SIGMOD
2012
ACM
11 years 7 months ago
2012
ACM
There exists a need for high performance, read-only mainmemory database systems for OLAP-style application scenarios. Most of the existing works in this area are centered around t...
VLDB
1999
ACM
13 years 8 months ago
1999
ACM
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...
NGITS
1997
Springer
13 years 8 months ago
1997
Springer
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....