Multiprocessor Hash-Based Join Algorithms
نویسندگان
چکیده
This paper extends earlier research on hash-join algorithms to a multiprocessor architecture. Implementations of a number of centralized join algorithms are described and measured. Evaluation of these algorithms served to verify earlier analytical results. In addition, they demonstrate that bit vector filtering provides dramatic improvement in the performance of all algorithms including the sort merge join algorithm. Multiprocessor configurations of the centralized Grace and Hybrid hash-join algorithms are also presented. Both algorithms are shown to provide linear increases in throughput with corresponding increases in processor and disk resources.
منابع مشابه
Hash-Based Join Algorithms for Multiprocessor Computers with Shared Memory
This paper studies a number of hash-based join algorithms for general purpose multiprocessor computers with shared memory where the amount of memory allocated to the join operation is proportional to the number of processors assigned to the operation and a global hash table is built in this shared memory. The concurrent update and access to this global hash table is studied. The elapsed time an...
متن کاملPerformance of Grace Hash Join Algorithm on the Ksr-1 Multiprocessor: Evaluation and Analysis Performance of Grace Hash Join Algorithm on the Ksr-1 Multiprocessor: Evaluation and Analysis
In relational database systems, the join is one of the most expensive but fundamental query operations. Among various join methods, the hash-based join algorithms show great potential as they lend themselves for parallelization. Although performance of the hash join algorithm has been evaluated for many architectures, to the best of our knowledge, it has not been evaluated for the COMA memory a...
متن کاملA Truncating Hash Algorithm for Processing Band-Join Queries
A non-equijoin of relations R and S is a band join if the join predicate requires values in the join attribute of R to fall within a specified band about the values in the join attribute of S. This paper describes a new algorithm, termed a truncating-hash band join, for evaluating band joins. This algorithm is based on the idea of truncating join attribute values in order to ezecute band joins ...
متن کاملTradeoffs in Processing Complex Join Queries via Hashing Multiprocessor Database Machines
In this paper we examine the problem of processing multi-way join queries (on the order of 10 joins) through hash-based join methods in a shared-nothing database machine. We first discuss how the choice of a format for a complex query can significantly affect performance in a multiprocessor database machine. Several query processing algorithms are then proposed and experimental results obtained...
متن کاملParallel Hash-Based Join Algorithms for a Shared-Everything
We analyze the costs, and describe the implementation, of three hashed-based join algorithms for a general-purpose shared-memory multiprocessor. The three algorithms considered are the Hashed Loops, GRACE and Hybrid algorithms. We also describe the results of a set of experiments which validate the cost models presented and demonstrate the relative performance of the three algorithms.
متن کامل