scientific article; zbMATH DE number 7650892

DOI10.4230/LIPICS.STACS.2020.7MaRDI QIDQ5874277zbMATH OpenFDO

Authors Wim Martens, Matthias Niewerth, Tina Trautner

Publication date 7 February 2023

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

zbMATH Keywords

complexitydatabasesgraph databasespath queriesquery languagesregular languagessimple pathstrails

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• A trichotomy for regular simple path queries on graphs
• Straight-path queries in trajectory data
• Straight-path queries in trajectory data
• Preferential regular path queries
• Regular path queries with constraints
• scientific article; zbMATH DE number 2090027
• Universal regular path queries
• Regular path queries on large graph data

Cited in

(6)

• Formal languages in information extraction and graph databases
• Fine-Grained Complexity of Regular Path Queries
• Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
• A Trichotomy for Regular Trail Queries
• Fine-grained complexity of regular path queries
• A formal language perspective on factorized representations

This page was built for publication:

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