Path querying on acyclic graphs using Boolean grammars
From MaRDI portal
Recommendations
- Path logics for querying graphs: combining expressiveness and efficiency
- Path querying with conjunctive grammars by matrix multiplication
- Recursive queries and context-free graph grammars
- Graph grammars for querying graph-like data
- Expressive path queries on graphs with data
- Expressive path queries on graph with data
- Expressiveness and static analysis of extended conjunctive regular path queries
- Graph traversal and top-down evaluation of logic queries
- A trichotomy for regular simple path queries on graphs
Cites work
- An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
- Boolean grammars
- Context-sensitive data-dependence analysis via linear conjunctive language reachability
- Finding Regular Simple Paths in Graph Databases
- General context-free recognition in less than cubic time
- scientific article; zbMATH DE number 1747449 (Why is no real title available?)
- scientific article; zbMATH DE number 1407672 (Why is no real title available?)
- scientific article; zbMATH DE number 3340123 (Why is no real title available?)
- Multiplying matrices faster than coppersmith-winograd
- Parsing by matrix multiplication generalized to Boolean grammars
- Properties of deterministic top-down grammars
- Regular queries on graph databases
Cited in
(5)
This page was built for publication: Path querying on acyclic graphs using Boolean grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2027852)
