Semantic acyclicity on graph databases
From MaRDI portal
Recommendations
- Semantic acyclicity for conjunctive queries: approximations and constraints
- Semantically Acyclic Conjunctive Queries under Functional Dependencies
- The complexity of acyclic conjunctive queries
- Semantic Optimization of Conjunctive Queries
- On the data complexity of consistent query answering over graph databases
Cites work
- A Logical Approach to Constraint Satisfaction
- A note on the reduction of two-way automata to one-way automata
- Adding regular expressions to graph reachability and pattern queries
- Alternating Pushdown and Stack Automata
- Beyond Hypertree Width: Decomposition Methods Without Decompositions
- Conjunctive query containment revisited
- Conjunctive-query containment and constraint satisfaction
- Degrees of acyclicity for hypergraphs and relational database schemes
- Efficient Approximations of Conjunctive Queries
- Enumerating homomorphisms
- Equivalences Among Relational Expressions with the Union and Difference Operators
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 2241908 (Why is no real title available?)
- Hypertree decompositions and tractable queries
- On the expressive power of Datalog: tools and a case study.
- Query evaluation via tree-decompositions
- Regular queries on graph databases
- Relative expressive power of navigational querying on graphs
- Rewriting of regular expressions and regular path queries
- Semantic acyclicity on graph databases
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Structural tractability of enumerating CSP solutions
- The complexity of acyclic conjunctive queries
- The complexity of facets (and some facets of complexity)
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Cited in
(16)- A navigational logic for reasoning about graph properties
- Regular queries on graph databases
- Semantic acyclicity for conjunctive queries: approximations and constraints
- Semantic acyclicity on graph databases
- A more general theory of static approximations for conjunctive queries
- Semantically Acyclic Conjunctive Queries under Functional Dependencies
- scientific article; zbMATH DE number 7501203 (Why is no real title available?)
- Boundedness of conjunctive regular path queries
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
- Counting answers to unions of conjunctive queries: natural tractability criteria and meta-complexity
- Evaluating graph queries using semantic treewidth
- Semantic tree-width and path-width of conjunctive regular path queries
- Fine-grained complexity of ontology mediated queries (invited paper)
- A more general theory of static approximations for conjunctive queries
This page was built for publication: Semantic acyclicity on graph databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3187172)
