Design and evaluation of parallel pipelined join algorithms
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Optimization of large join queries
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Optimization of large join queries
Optimization of large join queries
Exploiting database parallelism in a message-passing multiprocessor
IBM Journal of Research and Development
Distributed query processing in a relational data base system
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
The Gamma Database Machine Project
IEEE Transactions on Knowledge and Data Engineering
The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer
IEEE Transactions on Parallel and Distributed Systems
Optimization of Nonrecursive Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
An Evaluation of Non-Equijoin Algorithms
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
An investigation of multiprocessor structures and algorithms for data base management
An investigation of multiprocessor structures and algorithms for data base management
Concurrent communication among multi-transceiver stations over shared media (computer networks, spread spectrum)
Criss-Cross Hash Joins: Design and Analysis
IEEE Transactions on Knowledge and Data Engineering
Nephele/PACTs: a programming model and execution framework for web-scale analytical processing
Proceedings of the 1st ACM symposium on Cloud computing
Processing theta-joins using MapReduce
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient data distribution strategy for join query processing in the cloud
Proceedings of the third international workshop on Cloud data management
| Hi-index | 0.00 |
It is shown that the fragment and replicate (FR) distributed join algorithm is a specialcase of the symmetric fragment and replicate (SFR) algorithm, which improves the FRalgorithm by reducing its communication. The SFR algorithm, like the FR algorithm, isapplicable to N-way joins and nonequijoins and does tuple balancing automatically. Theauthors derive formulae that show how to minimize the communication in the SFRalgorithm, discuss its performance on a parallel database prototype, and evaluate itspracticality under various conditions. It is claimed that SFR improves the worst-case costfor a distributed join, but it will not displace specialized distributed join algorithms whenthe later are applicable.