See this document in CiteSeerX!

On the Complexity of Database Query Optimization (2001)  (Make Corrections)  
Sai Surya Kiran Evani



  Home/Search   Context   Related

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

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

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this thesis, we consider the complexity of computing the optimal join order sequences for star queries and general queries. We consider the following join methods in our thesis - indexed nested loop joins, sort-merge joins, hash joins and block nested loop joins. The use of cartesian products is avoided and only linear trees are considered for query execution. (Update)

Active bibliography (related documents):   More   All
0.8:   Design and Implementation of Algorithms for Tree Query Optimization - P. (2000)   (Correct)
0.4:   On Finding Approximate Solutions to the Query Optimization.. - Chatterji, Datt (2001)   (Correct)
0.2:   A Corrected 5NF Definition for Relational Database Design - Vincent (1997)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:   More   All
0.1:   Demand-based Coscheduling of Parallel Jobs on Multiprogrammed.. - Sobalvarro (1997)   (Correct)
0.1:   Automatic Acquisition of Language Models for Speech recognition - McCandless (1994)   (Correct)
0.1:   Building an Active Node on the Internet - Murphy (1997)   (Correct)

BibTeX entry:   (Update)

@misc{ evani-complexity,
  author = "Sai Surya Kiran Evani",
  title = "On the Complexity of Database Query Optimization",
  url = "citeseer.ist.psu.edu/evani01complexity.html" }
Citations (may not include all citations):
4212   Computers and Intractability : A Guide to the Theory of NP-C.. (context) - Garey, Johnson - 1979
318   Approximation Algorithms for NP-Hard Problems (context) - Hochbaum - 1997
263   Database Systems Concepts (context) - Silberschatz, Korth et al.
42   Probabilistic Checking of Proofs and Hardness of Approximati.. (context) - Arora
24   the Optimal Nesting Order for Computing N-Relational Joins (context) - Ibaraki, Kameda - 1984
12   the complexity of generating optimal left-deep processing tr.. - Cluet, Moerkotte - 1995
4   Fundamentals of Database Systems (context) - Masri
3   the Complexity of Finding the Optimal Join Order Sequence wi.. (context) - Ganguly
2   Design and Implementation of Algorithms for Star Query Optim.. - Chakrabarthi - 2000
1   Carlo Zaniolo (context) - Krishnamurthy, Boral - 1986
1   Access Path Selection in Relational Database System (context) - Gri, Sellinger et al. - 1979
1   Memory Sensitive Query Optimization : An Introductory Study - Navelkar - 2000
www.nada.kth.se/

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