Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,256,227 papers from all fields of science
Search
Sign In
Create Free Account
Hash join
The hash join is an example of a join algorithm and is used in the implementation of a relational database management system. Hash join is similar to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Block nested loop
Hash function
Hash table
Join (SQL)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2002
2002
Hash Join Algorithms on SMPs Clusters: Effects of Netcaches on its Scalability and Performance
E.D.M. Ordonez
2002
Corpus ID: 62339543
We investigate the effect that caches, particularly caches for remote accesses, have on the performance of hash join algorithms…
Expand
1999
1999
The bulk index join: a generic approach to processing non-equijoins
Jochen Van den Bercken
,
B. Seeger
,
P. Widmayer
Proceedings / International Conference on Data…
1999
Corpus ID: 10849566
Presents a new algorithm called the 'bulk index join' that can be applied to a broad class of non-equijoins. Similar to the well…
Expand
1999
1999
The Value of Merge-Join and Hash-Join in SQL Server
G. Graefe
Very Large Data Bases Conference
1999
Corpus ID: 17961265
Microsoft SQL Server was successful for many years for transaction processing and decision sup- port workloads with neither merge…
Expand
1996
1996
A Vectorized Hash-Join
Richard P. Martin
1996
Corpus ID: 18657073
A vector instruction set is a well known method for exposing bandwidth to applications. Although extensively studied in the…
Expand
1994
1994
TID hash joins
R. Marek
,
E. Rahm
International Conference on Information and…
1994
Corpus ID: 12111657
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join…
Expand
1994
1994
Nonstop SQL: scalability and availability for decision support
Susanne Englert
ACM SIGMOD Conference
1994
Corpus ID: 21913167
: In 1989, Tandem introduced intra-query parallelism to NonStop SQL. Table scans and aggregates aswell as nested-loop and merge…
Expand
1993
1993
A truncating hash algorithm for processing band-join queries
V. Soloviev
Proceedings of IEEE 9th International Conference…
1993
Corpus ID: 15095269
The truncating-hash band join algorithm for evaluating band joins is described. This algorithm is based on the idea of truncating…
Expand
1992
1992
Five Performance Enhancements for Hybrid Hash Join
G. Graefe
1992
Corpus ID: 60793740
Abstract : In this paper, we focus on set matching algorithms such as intersection, difference, union, and relational join, using…
Expand
Highly Cited
1989
Highly Cited
1989
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers
E. Omiecinski
,
E. Lin
IEEE Transactions on Knowledge and Data…
1989
Corpus ID: 32881954
The authors compare the performance of two join algorithms on both cube and ring interconnections for message-based…
Expand
Highly Cited
1987
Highly Cited
1987
Design and evaluation of parallel pipelined join algorithms
J. Richardson
,
Hongjun Lu
,
K. Mikkilineni
ACM SIGMOD Conference
1987
Corpus ID: 15786382
The join operation is the most costly operation in relational database management systems. Distributed and parallel processing…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE