scientific article; zbMATH DE number 7407799

MaRDI QIDQ5155690

Piotr Wieczorek, Jan Otop, Jakub Michaliszyn

Publication date: 8 October 2021

Full work available at URL: https://arxiv.org/abs/2002.04460

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

aggregationrelational databasesgraph databasesqueries

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Uses Software

• SPARQL
• GraphLog

Cites Work

• Unnamed Item
• Unnamed Item
• Synchronized rational relations of finite and infinite words
• Low-complexity aggregation in GraphLog and Datalog
• On the freeze quantifier in Constraint LTL: Decidability and complexity
• Synchronizing relations on words
• Finite-memory automata
• Regular expressions for data words
• Querying Graphs with Data
• Expressive Path Queries on Graph with Data
• Complexity of Subcases of Presburger Arithmetic
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
• Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
• Finding Regular Simple Paths in Graph Databases
• TriAL
• Finite state machines for strings over infinite alphabets
• On Relations Defined by Generalized Finite Automata