GraphLog

swMATH20098MaRDI QIDQ31920FDOQ31920

Author name not available (Why is that?)

Cited In (32)

• Rewriting of regular expressions and regular path queries
• 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
• Title not available (Why is that?)
• Applying model-checking to solve queries on semistructured data
• Query languages for bags and aggregate functions
• Queries and computation on the web
• 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
• Evaluation and Enumeration Problems for Regular Path Queries
• Title not available (Why is that?)
• Navigational and Rule-Based Languages for Graph Databases
• Towards an efficient evaluation of recursive aggregates in deductive 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?)
• Querying Regular Graph Patterns
• Graph Grammars for Querying Graph-like Data
• Semantic Acyclicity on Graph Databases
• Title not available (Why is that?)
• Monadic partition logics and finite automata

This page was built for software: GraphLog