Performance evaluations on inner vs. outer decomposition first parallel join algorithms for two nested loop joins

Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to save disk I/Os. However, two different decomposition algorithms are compared, such as inner vs. outer decomposition first algorithms for tuple-based and block-based nested loop joins, showing that the proposed approach is 20% better than general approach. Also lemmas are proved, when we have to use the outer decomposition first parallel join algorithms.

Extracting outer function part from Hardy space function

Any analytic signal fa(e^(it)) can be written as a product of its minimum-phase signal part(the outer function part) and its all-phase signal part(the inner function part). Due to the importance of such decomposition, Kumarasan and Rao(1999), implementing the idea of the Szeg?o limit theorem(see below),proposed an algorithm to obtain approximations of the minimum-phase signal of a polynomial analytic signal fa(e^(it)) = e^(iN0t)M∑k=0a_k^(eikt),(0.1)where a_0≠ 0, a_M≠ 0. Their method involves minimizing the energy E(f_a, h_1, h_2,..., h_H) =1/(2π)∫_0^(2π)|1+H∑k=1h_k^(eikt)|~2|fa(e^(it))|~2dt(0.2) with the undetermined complex numbers hk's by the least mean square error method. In the limiting procedure H →∞, one obtains approximate solutions of the minimum-phase signal. What is achieved in the present paper is two-fold. On one hand, we rigorously prove that, if fa(e^(it)) is a polynomial analytic signal as given in(0.1),then for any integer H≥M, and with |fa(e^(it))|~2 in the integrand part of(0.2) being replaced with 1/|fa(e^(it))|~2,the exact solution of the minimum-phase signal of fa(e^(it)) can be extracted out. On the other hand, we show that the Fourier system e^(ikt) used in the above process may be replaced with the Takenaka-Malmquist(TM) system, r_k(e^(it)) :=((1-|α_k|~2e^(it))/(1-α_ke^(it))^(1/2)∏_(j=1)^(k-1)(e^(it)-α_j/(1-α_je^(it))^(1/2), k = 1, 2,..., r_0(e^(it)) = 1, i.e., the least mean square error method based on the TM system can also be used to extract out approximate solutions of minimum-phase signals for any functions f_a in the Hardy space. The advantage of the TM system method is that the parameters α_1,..., α_n,...determining the system can be adaptively selected in order to increase computational efficiency. In particular,adopting the n-best rational(Blaschke form) approximation selection for the n-tuple {α_1,..., α_n}, n≥N, where N is the degree of the given rational analytic signal, the minimum-phase part of a rational analytic signal can be accurately and efficiently extracted out.