GraphLog
From MaRDI portal
Cited in
(42)- Fault-tolerant computation of distributed regular path queries
- Regular path queries with constraints
- Towards an efficient evaluation of recursive aggregates in deductive databases
- Query languages for bags and aggregate functions
- Expressive power of SQL.
- Queries and computation on the web
- Local properties of query languages
- Operational and abstract semantics of the query language G-Log
- Containment of queries for graphs with data
- Applying model-checking to solve queries on semistructured data
- Partially ordered regular languages for graph queries
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
- How expressive is stratified aggregation?
- SPARQL
- Recursive rules with aggregation: a simple unified semantics
- nSPARQL
- Regular queries on graph databases
- Static analysis of navigational XPath over graph databases
- XPath
- Document spanners: a formal approach to information extraction
- Graph logics with rational relations
- Navigational and rule-based languages for graph databases
- UnQL
- Datalog
- Semantic acyclicity on graph databases
- Querying regular graph patterns
- Evaluation and enumeration problems for regular path queries
- DryadLINQ
- SPARQ2L
- Regular languages with variables on graphs
- Lorel
- scientific article; zbMATH DE number 622433 (Why is no real title available?)
- openCypher
- scientific article; zbMATH DE number 219218 (Why is no real title available?)
- Using variable automata for querying data graphs
- Graph grammars for querying graph-like data
- Querying best paths in graph databases
- Modular path queries with arithmetic
- TGraphs
- Monadic partition logics and finite automata
- Low-complexity aggregation in GraphLog and Datalog
- Rewriting of regular expressions and regular path queries
This page was built for software: GraphLog
