Pages that link to "Item:Q4644599"

The following pages link to Relative expressive power of navigational querying on graphs using transitive closure (Q4644599):

Displaying 9 items.

• 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)
• The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs (Q2254638) (← links)
• On the Expressive Power of Query Languages for Matrices (Q3305355) (← links)
• Evaluation and Enumeration Problems for Regular Path Queries (Q3305367) (← links)
• Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity (Q4598259) (← links)
• A framework for comparing query languages in their ability to express Boolean queries (Q5919276) (← links)
• Executable first-order queries in the logic of information flows (Q6563053) (← links)