swMATH20098MaRDI QIDQ31920FDOQ31920
Author name not available (Why is that?)
Official website: http://dl.acm.org/citation.cfm?id=298591
Cited In (42)
- Rewriting of regular expressions and regular path queries
- TGraphs
- Low-complexity aggregation in GraphLog and Datalog
- Document spanners: a formal approach to information extraction
- Operational and abstract semantics of the query language G-Log
- Expressive power of SQL.
- Local properties of query languages
- Static analysis of navigational XPath over graph databases
- Regular languages with variables on graphs
- Evaluation and enumeration problems for regular path queries
- Title not available (Why is that?)
- Applying model-checking to solve queries on semistructured data
- Query languages for bags and aggregate functions
- Navigational and rule-based languages for graph databases
- Querying best paths in graph databases
- Queries and computation on the web
- Graph grammars for querying graph-like data
- Fault-tolerant computation of distributed regular path queries
- Partially ordered regular languages for graph queries
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
- Graph logics with rational relations
- Recursive rules with aggregation: a simple unified semantics
- Regular queries on graph databases
- Querying regular graph patterns
- SPARQL
- Title not available (Why is that?)
- nSPARQL
- XPath
- Towards an efficient evaluation of recursive aggregates in deductive databases
- Datalog
- UnQL
- DryadLINQ
- SPARQ2L
- Lorel
- openCypher
- Semantic acyclicity on graph databases
- Containment of queries for graphs with data
- Regular path queries with constraints
- Using variable automata for querying data graphs
- How expressive is stratified aggregation?
- Title not available (Why is that?)
- Monadic partition logics and finite automata
This page was built for software: GraphLog
