The complexity of acyclic conjunctive queries
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 32 references indexed in Scilit:
- Effect of Skew on Join Performance in Parallel ArchitecturesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On the complexity of database queries (extended abstract)Published by Association for Computing Machinery (ACM) ,1997
- Subsumption algorithms based on search treesPublished by Springer Nature ,1996
- Answering queries using views (extended abstract)Published by Association for Computing Machinery (ACM) ,1995
- Symmetric logspace is closed under complementPublished by Association for Computing Machinery (ACM) ,1995
- Decomposing constraint satisfaction problems using database techniquesArtificial Intelligence, 1994
- Solving queries by tree projectionsACM Transactions on Database Systems, 1993
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- Tree-size bounded alternationJournal of Computer and System Sciences, 1980