Hypertree Decompositions and Tractable Queries
Top Cited Papers
- 31 May 2002
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 64 (3), 579-627
- https://doi.org/10.1006/jcss.2001.1809
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Constraint NetworksPublished by Elsevier BV ,2003
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Conjunctive query containment revisitedLecture Notes in Computer Science, 1996
- Tree clustering for constraint networksArtificial Intelligence, 1989
- Constraint satisfaction from a deductive viewpointArtificial Intelligence, 1988
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 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
- Power of Natural SemijoinsSIAM Journal on Computing, 1981
- AlternationJournal of the ACM, 1981