Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,023,954 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.
2016
2016
Accelerating Hash-Based Query Processing Operations on FPGAs by a Hash Table Caching Technique
Behzad Salami
,
Oriol Arcas
,
Nehir Sönmez
,
O. Unsal
,
A. Cristal
Latin American Conference on High Performance…
2016
Corpus ID: 45336225
Extracting valuable information from the rapidly growing field of Big Data faces serious performance constraints, especially in…
Expand
2007
2007
Pipelined hash-join on multithreaded architectures
Philip C. Garcia
,
H. F. Korth
International Workshop on Data Management on New…
2007
Corpus ID: 15999554
Multi-core and multithreaded processors present both opportunities and challenges in the design of database query processing…
Expand
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
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
1989
1989
Parallelisierung von Anfragen auf komplexen Objekten durch Hash Joins
H. Zeller
Datenbanksysteme für Business, Technologie und…
1989
Corpus ID: 44770013
Relationale Datenbanksysteme sind von ihrer Leistungsfahigkeit her noch nicht fur den Einsatz in technischen Datenbanken geeignet…
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