Querying regular graph patterns
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1149440 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 2241907 (Why is no real title available?)
- A lower bound technique for the size of nondeterministic finite automata
- Adding regular expressions to graph reachability and pattern queries
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Conjunctive queries over trees
- Data exchange: semantics and query answering
- Database Theory - ICDT 2005
- Elements of finite model theory.
- Foundations of semantic web databases
- Incomplete Information in Relational Databases
- Module checking
- Parameterized regular expressions and their languages
- Querying incomplete information in semistructured data
- Relational and XML Data Exchange
- Rewriting of regular expressions and regular path queries
- Testing containment of conjunctive queries under functional and inclusion dependencies
- The Complexity of Enriched Mu-Calculi
- XML with incomplete information
Cited in
(33)- scientific article; zbMATH DE number 2090027 (Why is no real title available?)
- Universal regular path queries
- A navigational logic for reasoning about graph properties
- Regular languages with variables on graphs
- Regular queries on graph databases
- CTL^ with graded path modalities
- Incremental graph pattern matching
- Querying incomplete information in RDF with SPARQL
- \textsc{Kojaph}: visual definition and exploration of patterns in graph databases
- Navigational and rule-based languages for graph databases
- Path logics for querying graphs: combining expressiveness and efficiency
- Graph grammars for querying graph-like data
- Complexity of universality and related problems for partially ordered NFAs
- Adding regular expressions to graph reachability and pattern queries
- Finding Regular Simple Paths in Graph Databases
- The complexity of regular expressions and property paths in SPARQL
- A logical approach to graph databases
- Complexity of conjunctive regular path query homomorphisms
- Regular queries on graph databases
- Foreword: Journal of Computer and System Sciences special issue on query answering on graph-structured data
- Fuzzy quality-aware queries to graph databases
- scientific article; zbMATH DE number 7350780 (Why is no real title available?)
- Regular expressions for querying data graphs
- Regular path queries on large graph data
- Using variable automata for querying data graphs
- Negative knowledge for certain query answers
- Querying graphs
- Certain answers as objects and knowledge
- scientific article; zbMATH DE number 5999572 (Why is no real title available?)
- A rule-based procedure for graph query solving
- Data graphs with incomplete information (and a way to complete them)
- Regular expressions with binding over data words for querying graph databases
- Finding patterns in an unknown graph
This page was built for publication: Querying regular graph patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189642)
