Issue No. 09 - September (1988 vol. 14)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.6175
<p>A reduced cover set of the set of full reducer semijoin programs for an acyclic query graph for a distributed database system is given. An algorithm is presented that determines the minimum cost full reducer program. The computational complexity of finding the optimal full reducer for a single relation is of the same order as that of finding the optimal full reducer for all relations. The optimization algorithm is able to handle query graphs where more than one attribute is common between the relations. A method for determining the optimum profitable semijoin program is presented. A low-cost algorithm which determines a near-optimal profitable semijoin program is outlined. This is done by converting a semijoin program into a partial order graph. This graph also allows one to maximize the concurrent processing of the semijoins. It is shown that the minimum response time is given by the largest cost path of the partial order graph. This reducibility is used as a post optimizer for the SSD-1 query optimization algorithm. It is shown that the least upper bound on the length of any profitable semijoin program is N(N-1) for a query graph of N nodes.</p>
join queries; distributed databases; reduced cover set; acyclic query graph; distributed database; computational complexity; optimization; partial order graph; concurrent processing; minimum response time; computational complexity; database theory; distributed databases; graph theory; optimisation
S. Pramanik and D. Vineyard, "Optimizing Join Queries in Distributed Databases," in IEEE Transactions on Software Engineering, vol. 14, no. , pp. 1319-1326, 1988.