The Complexity of Acyclic Conjunctive Queries

Authors:
Georg Gottlob;Nicola Leone;Francesco Scarcello
Affiliations:
-;-;-
Venue:
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Year:
1998

Citing 0
Cited 22

Hypertree decompositions and tractable queries

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Constraint satisfaction and database theory: a tutorial

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computational properties of metaquerying problems

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
When is the evaluation of conjunctive queries tractable?

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Monotonic reductions, representative equivalence, and compilation of intractable problems

Journal of the ACM (JACM)
Computing LOGCFL certificates

Theoretical Computer Science
Query evaluation via tree-decompositions

Journal of the ACM (JACM)
Query Evaluation via Tree-Decompositions

ICDT '01 Proceedings of the 8th International Conference on Database Theory
Towards Aggregated Answers for Semistructured Data

ICDT '01 Proceedings of the 8th International Conference on Database Theory
Computing LOGCFL Certificates

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
On the Parallel Complexity of Tree Automata

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
On the Hardness of Learning Acyclic Conjunctive Queries

ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
On Tractable Queries and Constraints

DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Towards Discovery of Deep and Wide First-Order Structures: A Case Study in the Domain of Mutagenicity

DS '01 Proceedings of the 4th International Conference on Discovery Science
Scalability and efficiency in multi-relational data mining

ACM SIGKDD Explorations Newsletter
Conjunctive query evaluation by search-tree revisited

Theoretical Computer Science
A Logical Approach to Constraint Satisfaction

Complexity of Constraints
A comparison of structural CSP decomposition methods

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Conjunctive query evaluation by search tree revisited

ICDT'05 Proceedings of the 10th international conference on Database Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the problem of evaluating acyclic Boolean database-queries is LOGCFL-complete and thus highly parallelizable. We present a parallel database algorithm solving this problem with a logarithmic number of parallel join operations. We also show that the acyclic versions of the following important database and AI problems are LOGCFL-complete: The Query Output Tuple problem for conjunctive queries, Conjunctive Query Containment, Clause Subsumption, and Constraint Satisfaction.