Querying Graphs with Data
From MaRDI portal
Recommendations
- Querying graphs
- Dynamic graph queries
- Expressive path queries on graph with data
- Containment of queries for graphs with data
- Expressive path queries on graphs with data
- Regular queries on graph databases
- Regular queries on graph databases
- Graph grammars for querying graph-like data
- scientific article; zbMATH DE number 1203020
Cited in
(33)- Containment of queries for graphs with data
- Adding regular expressions to graph reachability and pattern queries
- Formal languages in information extraction and graph databases
- Deterministic regular expressions with back-references
- Regular queries on graph databases
- Complexity results on register context-free grammars and related formalisms
- Expressive path queries on graphs with data
- Complete abstractions and subclassical modal logics
- Navigational and rule-based languages for graph databases
- Querying regular graph patterns
- Expressive path queries on graph with data
- Satisfiability for SCULPT-schemas for CSV-like data
- Evaluation and enumeration problems for regular path queries
- Path logics for querying graphs: combining expressiveness and efficiency
- Using variable automata for querying data graphs
- Graph grammars for querying graph-like data
- Data engineering in graph databases
- Querying graphs
- Querying best paths in graph databases
- scientific article; zbMATH DE number 7407777 (Why is no real title available?)
- Modular path queries with arithmetic
- Dynamic graph queries
- Regular expressions with binding over data words for querying graph databases
- On the Complexity of Finding Set Repairs for Data-Graphs
- Fine-Grained Complexity of Regular Path Queries
- An epistemic approach to model uncertainty in data-graphs
- Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
- An Algebra for Path Manipulation in Graph Databases
- Data graphs with incomplete information (and a way to complete them)
- Automata and grammars for data words
- Reachability and bounded emptiness problems of constraint automata with prefix, suffix and infix
- Efficient iterative programs with distributed data collections
- Fine-grained complexity of regular path queries
This page was built for publication: Querying Graphs with Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177771)
