Modular path queries with arithmetic

MaRDI QIDQ5155690FDOQ5155690

Authors: Jakub Michaliszyn, Jan Otop, Piotr Wieczorek 

Publication date: 8 October 2021

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

Recommendations

• Querying best paths in graph databases
• Path logics for querying graphs: combining expressiveness and efficiency
• Finding Regular Simple Paths in Graph Databases
• Querying Graphs with Data
• Relative expressive power of navigational querying on graphs

zbMATH Keywords

aggregationrelational databasesgraph databasesqueries

Mathematics Subject Classification ID

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

Cites Work

• Automata and Logics for Words and Trees over an Infinite Alphabet
• On Relations Defined by Generalized Finite Automata
• Finding Regular Simple Paths in Graph Databases
• Finite-memory automata
• Synchronized rational relations of finite and infinite words
• Title not available (Why is that?)
• Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
• Finite state machines for strings over infinite alphabets
• Expressive path queries on graph with data
• Path logics for querying graphs: combining expressiveness and efficiency
• Querying best paths in graph databases
• Low-complexity aggregation in GraphLog and Datalog
• Complexity of Subcases of Presburger Arithmetic
• On the freeze quantifier in Constraint LTL: Decidability and complexity
• Synchronizing relations on words
• Regular expressions for data words
• Querying Graphs with Data
• TriAL: a navigational algebra for RDF triplestores

Uses Software

• SPARQL
• GraphLog

This page was built for publication: Modular path queries with arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155690)