Finding Regular Simple Paths in Graph Databases
From MaRDI portal
DOI10.1137/S009753979122370XzbMATH Open0845.68033OpenAlexW2135282325MaRDI QIDQ4862795FDOQ4862795
Authors: Alberto O. Mendelzon, Peter T. Wood 
Publication date: 15 September 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s009753979122370x
Recommendations
Cited In (46)
- Title not available (Why is that?)
- The \(k\)-distinct language: parameterized automata constructions
- Graph indexing for spatial data traversal in road map databases
- Foundations of RDF Databases
- Fine-Grained Complexity of Regular Path Queries
- Formal languages in information extraction and graph databases
- Universal regular path queries
- Regular queries on graph databases
- Regular languages with variables on graphs
- Evaluation and enumeration problems for regular path queries
- A trichotomy for regular simple path queries on graphs
- Navigational and rule-based languages for graph databases
- Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
- Querying best paths in graph databases
- Queries and computation on the web
- Graph grammars for querying graph-like data
- Querying incomplete information in semistructured data
- Jumping evaluation of nested regular path queries
- Adding regular expressions to graph reachability and pattern queries
- Algebraic rewritings for optimizing regular path queries.
- Fault-tolerant computation of distributed regular path queries
- Path querying on acyclic graphs using Boolean grammars
- Partially ordered regular languages for graph queries
- A Trichotomy for Regular Trail Queries
- Efficient computation of shortest paths in time-dependent multi-modal networks
- Labeled cuts in graphs
- Regular path queries under approximate semantics
- A Parametrized Analysis of Algorithms on Hierarchical Graphs
- Complexity of conjunctive regular path query homomorphisms
- Querying regular graph patterns
- Title not available (Why is that?)
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
- Regular path queries on large graph data
- Modern techniques for querying graph-structured databases
- Weighted path queries on semistructured databases
- Regular path queries with constraints
- Labeled shortest paths in digraphs with negative and positive edge weights
- Regular expressions for data words
- Bounded regular path queries in view-based data integration
- Algorithms for regular tree grammar network search and their application to mining human-viral infection patterns
- Evaluating Datalog via tree automata and cycluits
- Federation and navigation in SPARQL 1.1
- Evaluating regular path queries on compressed adjacency matrices
- User-constrained multimodal route planning
- Formal language constrained path problems
- An Algebra for Path Manipulation in Graph Databases
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)
