A backtracking-based algorithm for hypertree decomposition

ACM Journal of Experimental Algorithmics

Volumn 13, Issue , 2008, Pages

  Gottlob, Georg ^a   Samer, Marko ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Constraint satisfaction; Hypertree decomposition

Indexed keywords

EID: 53849083114     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1412228.1412229     Document Type: Conference Paper

References (13)

1. BODLAENDBR, H. L. 2005. Discovering treewidth. In Proceedings of the 31st Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'05). Lecture Notes in Computer Science, vol. 3381. Springer-Verlag, New York. 1-16.
2. DECHTBR, R. 2003. Constraint Processing, Chapt. 4, Morgan Kaufmann, Burlington, MA. 85-115.
3. GANZOW, T., GOTTLOB, G., MUSLIU, N., AND SAMEE, M. 2005. A CSP hypergraph library. Tech. Rept. DBAI-TR-2005-50, Institute of Information Systems (DBAI), TU Vienna.
4. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 1999. On tractable queries and constraints. In Proceedings of 10th International Conference on Database and Expert System Applications (DEXA). Lecture Notes in Computer Science, vol. 1677. Springer-Verlag, New York. 1-15.
5. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 2002. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64, 3, 579-627.
6. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 2003. Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. J. Comput. Syst. Sci. 66, 4, 775-808.
7. GOTTLOB, G., MIKLÓS, Z., AND SCHWENTICK, T. 2007. Generalized hypertree decompositions: NPhardness and tractable variants. In Proceedings of the 26th ACM Symposium on Principles of Database Systems (PODS'07). ACM Press, New York. 13-22.
8. HARVEY, P. AND GHOSE, A. 2003. Reducing redundancy in the hypertree decomposition scheme. In Proceedings of 15th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE Computer Society, Los Alamitos, CA. 474-481.
9. KORIMORT, T. 2003. Constraint satisfaction problems - heuristic decomposition. Ph.D. thesis, Institute of Information Systems (DBAI), TU Vienna.
10. KOSTER, A. M. C. A., BODLAENDER, H. L., AND VAN HOESEL, S. P. M. 2001. Treewidth: Computational experiments. Tech. Rept. ZIB-Report 01-38, Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB).
11. LEONE, N., MAZZITELLI, A., AND SCARCELLO, F. 2002. Cost-based query decompositions. In Proceedings of the 10th Italian Symposium on Advanced Database Systems (SEBD).
12. MCMAHAN, B. 2004. Bucket elimination and hypertree decompositions. Implementation rept. Institute of Information Systems (DBAI), TU Vienna.
13. SCARCELLO, F., GRECO, G., AND LEONE, N. 2007. Weighted hypertree decompositions and optimal query plans. J. Comput. Syst. Sci. 73, 3, 475-506.