Hypertree decompositions for query optimization

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2007, Pages 36-45

  Ghionna, Lucantonio ^a   Granata, Luigi ^a   Greco, Gianluigi ^a   Scarcello, Francesco ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; INFORMATION DISSEMINATION; MATHEMATICAL OPERATORS; OPTIMIZATION; POLYNOMIALS; TREES (MATHEMATICS);

COMPUTATIONAL PROPERTIES; HYPERTREE DECOMPOSITION; POLYNOMIAL TIME; QUERY OPTIMIZATION;

QUERY PROCESSING;

EID: 34548745748     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367849     Document Type: Conference Paper

References (12)

1. J. Flum, M. Prick, and M. Grohe. Query evaluation via treedecompositions. J.ACM, 49(6):716-752, 2002.
2. E.C. Freuder. A sufficient condition for backtrack-bounded search. J.ACM, 32(4):755-761, 1985.
3. H. Garcia-Molina, J. Ullman, and J. Widom. Database system implementation. Prentice Hall, 2000.
4. YE. Ioannidis. Query Optimization. The Computer Science and Engineering Handbook, pp. 1038-1057, 1997.
5. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. JCSS, 64(3):579-627, 2002.
6. G. Gottlob, N. Leone, and F. Scarcello. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. JCSS, 66(4):775-808, 2003.
7. M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable? In Proc. of STOC'01, pp. 657-666, Heraklion, Crete, Greece, 2001.
8. M. Gyssens, P.O. Jeavons, and D.A. Cohen. Decomposing constraint satisfaction problems using database techniques. J. of Algorithms, 66:57-89, 1994.
9. N. Robertson and P.D. Seymour. Graph minors ii. algorithmic aspects of tree width. J. of Algoritms, 7:309-322, 1986.
10. Francesco Scarcello and Alfredo Mazzitelli. The hypertree decompositions homepage, since 2002: http://www.deis.unical.it/scarcello/Hypertrees/
11. Francesco Scarcello, Gianluigi Greco, and Nicola Leone. Weighted Hypertree Decompositions and Optimal Query Plans. In Proc. of PODS'04, pp. 210-221, Paris, 2004.
12. M. Yannakakis. Algorithms for acyclic database schemes. In Proc. of VLDB'81, pp. 82-94, Cannes, France, 1981.