See this document in CiteSeerX!

Design and Implementation of Algorithms for Tree Query Optimization (2000)  (Make Corrections)  
Hegde Hrishikesh P.



  Home/Search   Context   Related

 
View or download:
cse.iitk.ac.in/research...9811108.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cse.iitk.ac.in/research...9811108 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
Algorithms for Tree Query Optimization

Abstract: In this thesis, we consider the problem of finding an optimal join order sequence for tree and star queries. A join between two relations is either performed using the nested 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... (Update)

Similar documents (at the sentence level):
7.4%:   Design and Implementation of Algorithms for Star Query.. - Chakrabarti (2000)   (Correct)

Active bibliography (related documents):   More   All
0.8:   On the Complexity of Database Query Optimization - Evani (2001)   (Correct)
0.3:   On Finding Approximate Solutions to the Query Optimization.. - Chatterji, Datt (2001)   (Correct)
0.1:   The Use of Randomized Search Strategies for Complex Parallel.. - Kosch   (Correct)

Similar documents based on text:   More   All
0.7:   Memory Sensitive Query Optimization: An Introductory Study - Navelkar (2000)   (Correct)
0.5:   Optimal Ordering of Selections and Joins in Acyclic.. - Scheufele, Moerkotte   (Correct)
0.5:   WAAL : A Web-based Algorithm Animation And Learning System. - Mohapatra (2001)   (Correct)

BibTeX entry:   (Update)

@misc{ hrishikesh-design,
  author = "Hegde Hrishikesh P.",
  title = "Design and Implementation of Algorithms for Tree Query Optimization",
  url = "citeseer.ist.psu.edu/hrishikesh00design.html" }
Citations (may not include all citations):
389   Access Path Selection in a Relational Database Management Sy.. (context) - Selinger, Astrahan et al. - 1979
185   Principles of Database Systems (context) - Ullman - 1993
34   Rapid Bushy Join-order Optimization with Cartesian Product - Vance, Maier - 1996
31   Heuristic and Randomized Optimization for the Join Ordering .. - Steinbrunn, Kemper - 1997
29   Optimal Nesting for Computing N-relational Joins (context) - Ibaraki, Kameda - 1984
14   Database System Concepts (context) - Korth, Silberschatz - 1991
7   A New Heuristic for Optimizing Large Queries - Fegaras - 1998
3   the Complexity of Finding Optimal Join Order Sequence for St.. (context) - Ganguly - 2000
2   Design and Implementation of Algorithms for Star Query Optim.. - Chakrabarti - 2000
2   Optimizing Nonrecursive Queries (context) - Krishnamurthy, Boral et al. - 1986

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