| Pinaki Chakrabarthi. Design and Implementation of Algorithms for Star Query Optimization, M.Tech Thesis, I.I.T, Kanpur, April'2000. |
....loop method or the sort merge method. The problem considered in our thesis is an extension of the work studied by Ibaraki and Kameda [IK84] and Ravi Krishnamurthy, Boral and Zaniolo [KBZ86] The algorithm for obtaining an optimal join order sequence for star query has exponential time complexity [Cha00] In this thesis we present a greedy heuristic, GHGS, that outputs join sequence that is very close to the optimal solution. These results are based on the experimental analysis performed on GHGS with 10000 di erent Catalogs. The greedy algorithm, GHGS, has O(m ) time complexity and O(m) ....
....size for every relation R r , we can assume that t i = 0 for i = 1; 2 : m. We consider this assumption while de ning our problem in Section 2.5. The following examples give a cost expression for the feasible sequence. A detailed analysis of the terms discussed above is given by P. Chakrabarti[Cha00] Example 2.5: For the star query shown in Figure 2.3, let Z = R 0 S 1 S 3 S 2 N 4 be a R R R R R 0 feasible sequence. Since Z begins with R 0 , the query graph is rooted at R 0 . We now give the expressions for the cost of each of the joins below. In our example b 01 is the page size of the ....
[Article contains additional citation context not shown here]
Pinaki Chakrabarti. Design and Implementation of Algorithms for Star Query Optimization. M.Tech Thesis,, Deptt. of C.S.E., IIT-Kanpur, 2000.
No context found.
Pinaki Chakrabarthi. Design and Implementation of Algorithms for Star Query Optimization, M.Tech Thesis, I.I.T, Kanpur, April'2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC