Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,387,473 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
Planning Your SQL-on-Hadoop Deployment Using a Low-Cost Simulation-Based Approach
Jun Liu
,
Bianny Bian
,
Samantika Sury
Symposium on Computer Architecture and High…
2016
Corpus ID: 17666678
The term "SQL-on-Hadoop" has recently gained significant traction [19]. Impala represents a new emerging class of SQL-on-Hadoop…
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
1998
1998
Parallelizing the Index-Nested-Loops Database Join Primitive on a Shared-Nothing Cluster
Aaron B. Brown
,
Christos Kozyrakis
1998
Corpus ID: 15056887
We describe an optimized parallel implementation of the index-nested-loops database join primitive for the Berkeley NOW, a shared…
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
1996
1996
Hash Join Processing on Shared Memory Multiprocessors
A. Shatdal
,
J. F. Naughton
1996
Corpus ID: 15288353
While most scalable database systems are designed for a shared nothing architecture, advances in hardware technology suggest that…
Expand
1996
1996
Bucket Skip Merge Joi: A Scalable Algorithm for Join Processing in Very Large Databases using Indexes
M. Kamath
,
K. Ramamritham
Very Large Data Bases Conference
1996
Corpus ID: 60961175
Join processing algorithms play a critical role in efficient query processing. Popular join processing algorithms like merge join…
Expand
1995
1995
Comparison and Benchmarks for Import of VPF Geographic Data from Object-Oriented and Relational Database Files
D. Arctur
,
E. Anwar
,
+4 authors
K. Shaw
International Multi-Conference on Systems…
1995
Corpus ID: 113427
This paper presents some of the advantages accrued from adopting an object-oriented (OO) data model versus the relational data…
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