ABSTRACT
Enforcing local consistency is a well-known technique to simplify the evaluation of conjunctive queries. It consists of repeatedly taking the semijion between every pair of (relations associated with) query atoms, until the procedure stabilizes. If some relation becomes empty, then the query has an empty answer. Otherwise, we cannot say anything in general, unless we have some information on the structure of the given query. In fact, a fundamental result in database theory states that the class of queries for which---on every database---local consistency entails global consistency is precisely the class of acyclic queries. In the last few years, several efforts have been made to define structural decomposition methods isolating larger classes of nearly-acyclic queries, yet retaining the same nice properties as acyclic ones. In particular, it is known that queries having bounded (generalized) hypertree-width can be evaluated in polynomial time, and that this structural property is also sufficient to guarantee that local consistency solves the problem, as for acyclic queries. However, the precise power of such an approach was an open problem: Is it the case that bounded generalized hypertree-width is also a necessary condition to guarantee that local consistency entails global consistency?
In this paper, we positively answer this question, and go beyond. Firstly, we precisely characterize the power of local consistency procedures in the more general framework of tree projections, where a query Q and a set V of views (i.e., resources that can be used to answer Q) are given, and where one looks for an acyclic hypergraph covering Q and covered by Q---all known structural decomposition methods are just special cases of this framework, defining their specific set of resources. We show that the existence of tree projections of certain subqueries is a necessary and sufficient condition to guarantee that local consistency entails global consistency. In particular, tight characterizations are given not only for the decision problem, but also when answers restricted to variables covered by some view have to be computed. Secondly, we consider greedy tree-projections that are easy to compute, and we study how far they can be from arbitrary tree-projections, which are intractable in general. Finally, we investigate classes of instances not included in those having tree projections, and which can be easily recognized and define either new islands of tractability, or islands of quasi-tractability.
- S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995. Google Scholar
Digital Library
- I. Adler. Width Functions for Hypertree Decompositions. PhD Thesis, University of Freiburg, 2006.Google Scholar
- I. Adler. Tree-Related Widths of Graphs and Hypergraphs. SIAM Journal Discrete Mathematics, 22(1), pp. 102--123, 2008. Google Scholar
Digital Library
- I. Adler, G. Gottlob, and M. Grohe. Hypertree-Width and Related Hypergraph Invariants. European Journal of Combinatorics, 28, pp. 2167--2181, 2007. Google Scholar
Digital Library
- A. Atserias, A. Bulatov, and V. Dalmau. On the Power of k-Consistency, In Proc. of ICALP'07, pp. 279--290, 2007. Google Scholar
Digital Library
- C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the Desirability of Acyclic Database Schemes. Journal of the ACM, 30(3), pp. 479--513, 1983. Google Scholar
Digital Library
- P.A. Bernstein and N. Goodman. The power of natural semijoins. SIAM Journal on Computing, 10(4), pp. 751--771, 1981.Google Scholar
Cross Ref
- A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the ACM, 26:114--133, 1981. Google Scholar
Digital Library
- H. Chen and V. Dalmau. Beyond Hypertree Width: Decomposition Methods Without Decompositions. In Proc. of CP'05, pp. 167--181, 2005.Google Scholar
Digital Library
- D. A. Cohen, P. Jeavons, and M. Gyssens. A unified theory of structural tractability for constraint satisfaction problems. Journal of Computer and System Sciences, 74(5), pp. 721--743, 2008. Google Scholar
Digital Library
- V. Dalmau, Ph.G. Kolaitis, and M.Y. Vardi. Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. In Proc. of CP'02, pp. 310--326, 2002. Google Scholar
Digital Library
- R. Fagin. Degrees of acyclicity for hypergraphs and relational database schemes. Journal of the ACM, 30(3):514--550, 1983. Google Scholar
Digital Library
- G. Gottlob, N. Leone, and F. Scarcello. The complexity of acyclic conjunctive queries. Journal of the ACM, 48(3), pp. 431--498, 2001. Google Scholar
Digital Library
- G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences, 64(3), pp. 579--627, 2002.Google Scholar
Digital Library
- G. Gottlob, N. Leone, and F. Scarcello. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. Journal of Computer and System Sciences, 66(4), pp. 775--808, 2003. Google Scholar
Digital Library
- G. Gottlob, Z. Miklos, and T. Schwentick. Generalized hypertree decompositions: NP-hardness and tractable variants. Journal of the ACM, 56(6), 2009. Google Scholar
Digital Library
- G. Gottlob and A. Nash. Efficient Core Computation in Data Exchange. Journal of the ACM, 55(2), Article 9, 2008. Google Scholar
Digital Library
- N. Goodman and O. Shmueli. The tree projection theorem and relational query processing. Journal of Computer and System Sciences, 29(3), pp. 767--786, 1984. Google Scholar
Digital Library
- G. Greco and F. Scarcello. Tree Projections: Hypergraph Games and Minimality. In Proc. of ICALP'08, pp. 736--747, 2008. Google Scholar
Digital Library
- G. Greco and F. Scarcello. The Power of Tree Projections. Technical Report at the Computing Research Repository, arXiv.org, 2010.Google Scholar
Digital Library
- M. Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM, 54(1), 2007. Google Scholar
Digital Library
- M. Grohe and D. Marx. Constraint solving via fractional edge covers. In Proc. of SODA '06, pp. 289--298, 2006. Google Scholar
Digital Library
- D. Johnson and A. Klug. Testing containment of Conjunctive Queries Under Functional and Inclusion Dependencies. Journal of Computer and System Sciences, 28(1), pp. 167--189, 1984Google Scholar
Cross Ref
- D. Marx. Approximating fractional hypertree width. In Proc. of SODA'09, pp. 902--911, 2008. Google Scholar
Digital Library
- N. Robertson and P.D. Seymour. Graph minors III: Planar tree-width. Journal of Combinatorial Theory, Series B, 36, pp. 49--64, 1984.Google Scholar
Cross Ref
- R. Rosati. On the Decidability and Finite Controllability of Query Processing in Databases with Incomplete Information. In Proc. of PODS'06, pp. 356--365, 2006. Google Scholar
Digital Library
- Y. Sagiv and O Shmueli. Solving Queries by Tree Projections. ACM Transaction on Database Systems, 18(3), pp. 487--511, 1993. Google Scholar
Digital Library
- O. Reingold. Undirected ST-connectivity in log-space, Journal of the ACM, 55(4), 2008. Google Scholar
Digital Library
- W.L. Ruzzo. Tree-size bounded alternation. Journal of Cumputer and System Sciences, 21, pp. 218--235, 1980.Google Scholar
Cross Ref
- R.E. Tarjan, and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13(3):566--579, 1984. Google Scholar
Digital Library
- J. D. Ullman. Principles of Database and Knowledge Base Systems. Computer Science Press, 1989.Google Scholar
Digital Library
- M. Yannakakis. Algorithms for acyclic database schemes. In Proc. of VLDB'81, pp. 82--94, 1981. Google Scholar
Digital Library
Index Terms
The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability
Recommendations
The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
Answering conjunctive queries is a fundamental problem in database theory, and it is equivalent to solving constraint satisfaction problems in artificial intelligence and to other fundamental problems arising in computer science, which can be recast in ...
Tree projections and structural decomposition methods: Minimality and game-theoretic characterization
Tree projections provide a mathematical framework that encompasses all the various (purely) structural decomposition methods that have been proposed in the literature to single out classes of nearly-acyclic (hyper)graphs, such as the tree decomposition ...
Structural tractability of enumerating CSP solutions
The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a computation problem ...






Comments