Querying Regular Graph Patterns
From MaRDI portal
Publication:3189642
DOI10.1145/2559905zbMath1295.68125OpenAlexW2090236154MaRDI QIDQ3189642
Juan L. Reutter, Pablo Barceló, Leonid O. Libkin
Publication date: 12 September 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://dl.acm.org/doi/10.1145/2559905
Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Database theory (68P15) Formal languages and automata (68Q45)
Related Items (9)
Querying incomplete information in RDF with SPARQL ⋮ Certain answers as objects and knowledge ⋮ Fuzzy quality-aware queries to graph databases ⋮ Unnamed Item ⋮ Navigational and Rule-Based Languages for Graph Databases ⋮ A navigational logic for reasoning about graph properties ⋮ Complexity of universality and related problems for partially ordered NFAs ⋮ CTL\(^\ast\) with graded path modalities ⋮ Negative Knowledge for Certain Query Answers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Foundations of semantic web databases
- Data exchange: semantics and query answering
- A lower bound technique for the size of nondeterministic finite automata
- Rewriting of regular expressions and regular path queries
- Querying incomplete information in semistructured data
- Elements of finite model theory.
- Testing containment of conjunctive queries under functional and inclusion dependencies
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Adding regular expressions to graph reachability and pattern queries
- Module checking
- Parameterized regular expressions and their languages
- XML with incomplete information
- Relational and XML Data Exchange
- The Complexity of Enriched Mu-Calculi
- Conjunctive queries over trees
- Incomplete Information in Relational Databases
- Database Theory - ICDT 2005
This page was built for publication: Querying Regular Graph Patterns
