Finding Regular Simple Paths in Graph Databases
From MaRDI portal
Publication:4862795
Recommendations
Cited in
(52)- Fault-tolerant computation of distributed regular path queries
- Regular path queries with constraints
- A data structure for arc insertion and regular path finding
- Algebraic rewritings for optimizing regular path queries.
- Universal regular path queries
- Queries and computation on the web
- Graph indexing for spatial data traversal in road map databases
- Adding regular expressions to graph reachability and pattern queries
- Partially ordered regular languages for graph queries
- A trichotomy for regular simple path queries on graphs
- Path querying on acyclic graphs using Boolean grammars
- Formal languages in information extraction and graph databases
- Complexity of conjunctive regular path query homomorphisms
- Evaluating Datalog via tree automata and cycluits
- Regular expressions for data words
- Weighted path queries on semistructured databases
- Regular path queries under approximate semantics
- Efficient computation of shortest paths in time-dependent multi-modal networks
- User-constrained multimodal route planning
- The complexity of regular expressions and property paths in SPARQL
- Navigational and rule-based languages for graph databases
- Labeled cuts in graphs
- Querying regular graph patterns
- Evaluation and enumeration problems for regular path queries
- Foundations of RDF Databases
- Regular languages with variables on graphs
- Federation and navigation in SPARQL 1.1
- Regular path queries on large graph data
- scientific article; zbMATH DE number 2090027 (Why is no real title available?)
- Graph grammars for querying graph-like data
- Formal language constrained path problems
- Querying best paths in graph databases
- Modular path queries with arithmetic
- A Parametrized Analysis of Algorithms on Hierarchical Graphs
- Algorithms for regular tree grammar network search and their application to mining human-viral infection patterns
- Labeled shortest paths in digraphs with negative and positive edge weights
- Regular queries on graph databases
- The \(k\)-distinct language: parameterized automata constructions
- Fine-Grained Complexity of Regular Path Queries
- Jumping evaluation of nested regular path queries
- Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
- A Trichotomy for Regular Trail Queries
- An Algebra for Path Manipulation in Graph Databases
- Evaluating regular path queries on compressed adjacency matrices
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
- Modern techniques for querying graph-structured databases
- Evaluating graph queries using semantic treewidth
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
- Querying incomplete information in semistructured data
- Fine-grained complexity of regular path queries
- Answering path queries under linear and guarded existential rules
- Bounded regular path queries in view-based data integration
This page was built for publication: Finding Regular Simple Paths in Graph Databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862795)
