Dynamic graph queries

DOI10.4230/LIPICS.ICDT.2016.14MaRDI QIDQ5276194zbMATH OpenFDO

Authors Pablo R. Muñoz, Nils Vortmeier, Thomas Zeume

Publication date 14 July 2017

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

zbMATH Keywords

dynamic descriptive complexitygraph databasesgraph productspath queriesreachability

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• Reachability and distances under multiple changes
• Dynamic complexity under definable changes
• On the Quantifier-Free Dynamic Complexity of Reachability
• On the quantifier-free dynamic complexity of reachability
• Querying Graphs with Data

Cited in

(14)

• Dynamic graphs
• A data structure for arc insertion and regular path finding
• Dynamic graph models
• Adding regular expressions to graph reachability and pattern queries
• Dynamic complexity of expansion
• Regular queries on graph databases
• The dynamic complexity of acyclic hypergraph homomorphisms
• Dynamic complexity of the Dyck reachability
• Difference Map Readability for Dynamic Graphs
• Querying Graphs with Data
• Data engineering in graph databases
• Reachability and distances under multiple changes
• Querying best paths in graph databases
• Query maintenance under batch changes with small-depth circuits

This page was built for publication: Dynamic graph queries

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