Jumping evaluation of nested regular path queries

MaRDI QIDQ6142035zbMATH OpenFDO

Authors Joachim Niehren, S. Salvati, Rustam Azimov

Publication date 23 January 2024

Full work available at URL https://arxiv.org/abs/2208.03088, https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?ICLP2022.8

zbMATH Keywords

Dataloggraph databasespath queriespropositional dynamic logic

Mathematics Subject Classification ID

Logic programming (68N17) Data structures (68P05) Database theory (68P15)

Recommendations

• Fine-Grained Complexity of Regular Path Queries
• Regular queries on graph databases
• Regular queries on graph databases
• Evaluation and enumeration problems for regular path queries
• Finding Regular Simple Paths in Graph Databases

Cites work

• A linear-time model-checking algorithm for the alternation-free modal mu- calculus
• Evaluation and enumeration problems for regular path queries
• Extended magic for negation: efficient demand-driven evaluation of stratified Datalog with precise complexity guarantees
• Propositional dynamic logic of regular programs

Cited in

(1)

• Evaluating regular path queries on compressed adjacency matrices

This page was built for publication: Jumping evaluation of nested regular path queries

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