A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conjunctive query containment revisited
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
A comparison of structural CSP decomposition methods
Artificial Intelligence
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Database System Implementation
Database System Implementation
Theoretical Computer Science
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Constraint Processing
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Reducing Redundancy in the Hypertree Decomposition Scheme
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Theory of Relational Databases
Theory of Relational Databases
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
A backtracking-based algorithm for hypertree decomposition
Journal of Experimental Algorithmics (JEA)
A greedy algorithm for constructing a low-width generalized hypertree decomposition
Proceedings of the 13th International Conference on Database Theory
Optimizing the distributed evaluation of stratified programs via structural analysis
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
H-DB: a hybrid quantitative-structural sql optimizer
Proceedings of the 20th ACM international conference on Information and knowledge management
Distributed ontology based data access via logic programming
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Hypertree width is a measure of the degree of cyclicity of hypergraphs. A number of relevant problems from different areas, e.g., the evaluation of conjunctive queries in database theory or the constraint satisfaction in AI, are tractable when their underlying hypergraphs have bounded hypertree width. However, in practical contexts like the evaluation of database queries, we have more information besides the structure of queries. For instance, we know the number of tuples in relations, the selectivity of attributes and so on. In fact, all commercial query-optimizers are based on quantitative methods and do not care on structural properties. In this paper, in order to combine structural decomposition methods with quantitative approaches, the notion of weighted hypertree decomposition is defined. Weighted hypertree decompositions are equipped with cost functions, that can be used for modeling many situations where there is further information on the given problem, besides its hypergraph representation. The complexity of computing hypertree decompositions having the smallest weights, called minimal hypertree decompositions, is analyzed. It is shown that in many cases tractability is lost if weights are added. However, it is proven that, under some-not very severe-restrictions on the allowed cost functions and on the target hypertrees, optimal weighted hypertree decompositions can be computed in polynomial time. For some easier hypertree weighting functions, this problem is also highly parallelizable. Then, a cost function modeling query evaluation costs is provided, and it is shown how to exploit weighted hypertree decompositions for determining (logical) query plans for answering conjunctive queries. Finally, some preliminary results of an experimental comparison of this query optimization technique with the query optimizer of a commercial DBMS are presented.