A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Easy problems for tree-decomposable graphs
Journal of Algorithms
On the estimation of join result sizes
EDBT '94 Proceedings of the 4th international conference on extending database technology: Advances in database technology
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Selectivity and cost estimation for joins based on random sampling
Journal of Computer and System Sciences
An overview of query optimization in relational systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
All structured programs have small tree width and good register allocation
Information and Computation
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Random Sampling from Database Files: A Survey
Proceedings of the 5th International Conference SSDBM on Statistical and Scientific Database Management
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Schema mappings, data exchange, and metadata management
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Query reformulation with constraints
ACM SIGMOD Record
A logical approach to multicut problems
Information Processing Letters
Size Bounds and Query Plans for Relational Joins
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Efficient datalog abduction through bounded treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Worst-case optimal join algorithms: [extended abstract]
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Size and Treewidth Bounds for Conjunctive Queries
Journal of the ACM (JACM)
Skew strikes back: new developments in the theory of join algorithms
ACM SIGMOD Record
Hi-index | 0.00 |
This paper provides new worst-case bounds for the size and treewith of the result Q(D) of a conjunctive query Q to a database D. We derive bounds for the result size |Q(D)| in terms of structural properties of Q, both in the absence and in the presence of keys and functional dependencies. These bounds are based on a novel "coloring" of the query variables that associates a coloring number C(Q) to each query Q. Using this coloring number, we derive tight bounds for the size of Q(D) in case (i) no functional dependencies or keys are specified, and (ii) simple (one-attribute) keys are given. These results generalize recent size-bounds for join queries obtained by Atserias, Grohe, and Marx (FOCS 2008). An extension of our coloring technique also gives a lower bound for |Q(D)| in the general setting of a query with arbitrary functional dependencies. Our new coloring scheme also allows us to precisely characterize (both in the absence of keys and with simple keys) the treewidth-preserving queries--the queries for which the output treewidth is bounded by a function of the input treewidth. Finally we characterize the queries that preserve the sparsity of the input in the general setting with arbitrary functional dependencies.