Modular path queries with arithmetic

MaRDI QIDQ5155690zbMATH OpenFDO

Authors Jakub Michaliszyn, Jan Otop, Piotr Wieczorek

Publication date 8 October 2021

Full work available at URL https://arxiv.org/abs/2002.04460, https://lmcs.episciences.org/8503

zbMATH Keywords

aggregationrelational databasesgraph databasesqueries

Mathematics Subject Classification ID

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

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

Cites work

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

Describes a project that uses

Uses Software

• GraphLog
• SPARQL

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)