A new join algorithm

Authors:
Dong Keun Shin;Arnold Charles Meltzer
Affiliations:
Samsung Electronics Co., Ltd., Communication Systems R&D Center, SongPa P.O.Box 117, Seoul, Korea;Department of Electrical Engineering and Computer Science, The School of Engineering and Applied Science, The George Washington University
Venue:
ACM SIGMOD Record
Year:
1994

Citing 13
Cited 2

Join processing in database systems with large main memories

ACM Transactions on Database Systems (TODS)
Database computers: principle, architectures & techniques

Database computers: principle, architectures & techniques
A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A comparative study of hash functions for a new hash-based relational join algorithm

A comparative study of hash functions for a new hash-based relational join algorithm
Partially preemptible hash joins

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On parallel execution of multiple pipelined hash joins

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Join and Semijoin Algorithms for a Multiprocessor Database Machine

ACM Transactions on Database Systems (TODS)
Processor allocation strategies for multiprocessor database machines

ACM Transactions on Database Systems (TODS)
Parallel algorithms for the execution of relational database operations

ACM Transactions on Database Systems (TODS)
Implementing a relational database by means of specialzed hardware

ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES

ACM Transactions on Database Systems (TODS)
A relational model of data for large shared data banks

Communications of the ACM
Advanced Database Machine Architecture

Advanced Database Machine Architecture

Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new efficient join algorithm to increase the speed of the join relational operation. Using a divide and conquer strategy, stack oriented filter technique in the new join algorithm filters unwanted tuples as early as possible while none of the currently existing join algorithms takes advantage of any filtering concept. Other join algorithms may carry the unnecessary tuples up to the last moment of join attribute comparisons.Four join algorithms are described and discussed in this paper: the nested-loop join algorithm, the sort-merge join algorithm, the hash join algorithm, and the new join algorithm.