On the sequential nature of unification
Journal of Logic Programming
A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
A taxonomy of problems with fast parallel algorithms
Information and Control
Closures of database hypergraphs
Journal of the ACM (JACM)
On the complexity of join dependencies
ACM Transactions on Database Systems (TODS)
Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
Modelling large bases of categorical data with acyclic schemes
Proceedings on International conference on database theory
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Problems complete for deterministic logarithmic space
Journal of Algorithms
Structural complexity 1
Fast parallel algorithms for chordal graphs
SIAM Journal on Computing
Tree clustering for constraint networks (research note)
Artificial Intelligence
Two applications of inductive counting for complementation problems
SIAM Journal on Computing
Easy problems for tree-decomposable graphs
Journal of Algorithms
Properties that characterize LOGCFL
Journal of Computer and System Sciences
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Parallel database systems: the future of high performance database systems
Communications of the ACM
Solving queries by tree projections
ACM Transactions on Database Systems (TODS)
Extensions to Barrington's M-program model
Theoretical Computer Science - Special issue on structure in complexity theory
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
Optimization of parallel query execution plans in XPRS
Distributed and Parallel Databases - Selected papers from the first international conference on parallel and distributed information systems
Journal of Algorithms
Local consistency in parallel constraint satisfaction networks
Artificial Intelligence
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using templates with binding patterns (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Parallel evaluation of multi-join queries
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Efficient Parallel Algorithms for Chordal Graphs
SIAM Journal on Computing
Open issues in parallel query optimization
ACM SIGMOD Record
Computability and complexity: from a programming perspective
Computability and complexity: from a programming perspective
Closure properties of constraints
Journal of the ACM (JACM)
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
Tree queries: a simple class of relational queries
ACM Transactions on Database Systems (TODS)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages
Journal of the ACM (JACM)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
Syntactic Characterization of Tree Database Schemas
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Conjunctive query containment revisited
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
A comparison of structural CSP decomposition methods
Artificial Intelligence
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Effectiveness of Parallel Joins
IEEE Transactions on Knowledge and Data Engineering
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Subsumption Algorithms Based on Search Trees
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Properties of acyclic database schemes
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The Matching Problem for Strongly Chordal Graphs is in $NC$
The Matching Problem for Strongly Chordal Graphs is in $NC$
Graphs and Hypergraphs
Theory of Relational Databases
Theory of Relational Databases
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fixed-parameter complexity in AI and nonmonotonic reasoning
Artificial Intelligence
Computational properties of metaquerying problems
ACM Transactions on Computational Logic (TOCL)
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Weighted hypertree decompositions and optimal query plans
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Computing cores for data exchange: new algorithms and practical solutions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query answering exploiting structural properties
ACM SIGMOD Record
Effective rule induction from labeled graphs
Proceedings of the 2006 ACM symposium on Applied computing
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Prediction-hardness of acyclic conjunctive queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Weighted hypertree decompositions and optimal query plans
Journal of Computer and System Sciences
Generalized hypertree decompositions: np-hardness and tractable variants
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient core computation in data exchange
Journal of the ACM (JACM)
Complexity results for answer set programming with bounded predicate arities and implications
Annals of Mathematics and Artificial Intelligence
ACM Computing Surveys (CSUR)
Heuristic Methods for Hypertree Decomposition
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Ranking Approximate Answers to Semantic Web Queries
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Semantics and complexity of SPARQL
ACM Transactions on Database Systems (TODS)
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
Efficient algorithms for descendant-only tree pattern queries
Information Systems
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Simple and Efficient Minimal RDFS
Web Semantics: Science, Services and Agents on the World Wide Web
The complexity of quantified constraint satisfaction problems under structural restrictions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Finding Top-k Approximate Answers to Path Queries
FQAS '09 Proceedings of the 8th International Conference on Flexible Query Answering Systems
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Efficient algorithms for the tree homeomorphism problem
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Four lessons in versatility or how query languages adapt to the web
Semantic techniques for the web
Machine models for query processing
ACM SIGMOD Record
The complexity of causality and responsibility for query answers and non-answers
Proceedings of the VLDB Endowment
Database theory: query languages
Algorithms and theory of computation handbook
Balanced queries: divide and conquer
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Combining approximation and relaxation in semantic web path queries
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
A self-policing policy language
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
What are real SPARQL queries like?
Proceedings of the International Workshop on Semantic Web Information Management
Characterizing arithmetic circuit classes by constraint satisfaction problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Journal of Computer and System Sciences
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Highly acyclic groups, hypergraph covers, and the guarded fragment
Journal of the ACM (JACM)
Specifying and reasoning about dynamic access-control policies
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Hypertree decompositions: structure, algorithms, and applications
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
On finding acyclic subhypergraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Efficient approximations of conjunctive queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Factorised representations of query results: size bounds and readability
Proceedings of the 15th International Conference on Database Theory
Large hinge width on sparse random hypergraphs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
The fine classification of conjunctive queries and parameterized logarithmic space complexity
Proceedings of the 32nd symposium on Principles of database systems
Semantic acyclicity on graph databases
Proceedings of the 32nd symposium on Principles of database systems
Tractable counting of the answers to conjunctive queries
Journal of Computer and System Sciences
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
The complexity of weighted counting for acyclic conjunctive queries
Journal of Computer and System Sciences
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.01 |
This paper deals with the evaluation of acyclic Booleanconjunctive queries in relational databases. By well-known resultsof Yannakakis[1981], this problem is solvable in polynomial time;its precise complexity, however, has not been pinpointed so far. Weshow that the problem of evaluating acyclic Boolean conjunctivequeries is complete for LOGCFL, the class of decision problems thatare logspace-reducible to a context-free language. Since LOGCFL iscontained in AC1 and NC2, the evaluation problem of acyclic Booleanconjunctive queries is highly parallelizable. We present a paralleldatabase algorithm solving this problem with alogarithmic number ofparallel join operations. The algorithm is generalized to computingthe output of relevant classes of non-Boolean queries. We also showthat the acyclic versions of the following well-known database andAI problems are all LOGCFL-complete: The Query Output Tuple problemfor conjunctive queries, Conjunctive Query Containment, ClauseSubsumption, and Constraint Satisfaction. The LOGCFL-completenessresult is extended to the class of queries of bounded tree widthand to other relevant query classes which are more general than theacyclic queries.