Pages that link to "Item:Q528686"
From MaRDI portal
The following pages link to Relative expressive power of navigational querying on graphs (Q528686):
Displaying 16 items.
- Static analysis of navigational XPath over graph databases (Q269725) (← links)
- Relative expressive power of navigational querying on graphs (Q528686) (← links)
- Structural characterizations of the navigational expressiveness of relation algebras on a tree (Q896017) (← links)
- The power of Tarski's relation algebra on trees (Q1647492) (← links)
- A navigational logic for reasoning about graph properties (Q1996850) (← links)
- On the expressive power of linear algebra on graphs (Q2035472) (← links)
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs (Q2254638) (← links)
- Regular queries on graph databases (Q2402613) (← links)
- Navigational and Rule-Based Languages for Graph Databases (Q2970302) (← links)
- Semantic Acyclicity on Graph Databases (Q3187172) (← links)
- Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity (Q4598259) (← links)
- Relative expressive power of navigational querying on graphs using transitive closure (Q4644599) (← links)
- TriAL (Q5012588) (← links)
- A framework for comparing query languages in their ability to express Boolean queries (Q5919276) (← links)
- Inputs, Outputs, and Composition in the Logic of Information Flows (Q6082230) (← links)
- An Algebra for Path Manipulation in Graph Databases (Q6487410) (← links)