On the complexity of approximate query optimization

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2002, Pages 282-292

  Chatterji, S ^a   Evani, S S K ^a   Ganguly, S ^a   Yemmanuru, M D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

POLYLOGARITHMIC FACTOR; QUERY GRAPH; QUERY OPTIMIZATION;

QUERY LANGUAGES;

EID: 0036039108     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/543649.543650     Document Type: Conference Paper

References (7)

1. On the optimal nesting order for computing n-relational joins
2. On the complexity of generating optimal left-deep processing trees with cross products
3. On the complexity of distributed query optimization
4. Optimization of non-recursive queries
5. On the complexity of approximate query optimization