Hypertree decompositions and tractable queries
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Closure properties of constraintsJournal of the ACM, 1997
- Decomposing constraint satisfaction problems using database techniquesArtificial Intelligence, 1994
- Constraint satisfaction from a deductive viewpointArtificial Intelligence, 1988
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- A sufficient condition for backtrack-bounded searchJournal of the ACM, 1985
- A complexity theory based on Boolean algebraJournal of the ACM, 1985
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Degrees of acyclicity for hypergraphs and relational database schemesJournal of the ACM, 1983
- Tree queriesACM Transactions on Database Systems, 1982
- A simplied universal relation assumption and its propertiesACM Transactions on Database Systems, 1982