Issue No. 12 - December (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.250116
<p>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.</p>
Index Termsfragment and replicate algorithm; distributed joins; symmetric fragment and replicate;SFR; tuple balancing; parallel database; worst case cost; distributed join; intratransaction parallelism; load balancing; multicast communication; performance evaluation; relational data model; symmetry; computational complexity; database theory; distributed algorithms
J. Stamos and H. Young, "A Symmetric Fragment and Replicate Algorithm for Distributed Joinsyout," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 1345-1354, 1993.