Using variable automata for querying data graphs

DOI10.1016/J.IPL.2014.10.019zbMATH Open1317.68048OpenAlexW1972794622MaRDI QIDQ483052FDOQ483052

Authors: Domajoj Vrgoč 

Publication date: 15 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.10.019

Recommendations

• Querying regular graph patterns
• Querying Graphs with Data
• Path logics for querying graphs: combining expressiveness and efficiency
• Regular expressions for querying data graphs
• Graph grammars for querying graph-like data

zbMATH Keywords

databasesquery languagesvariable automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15)

Cites Work

• Finite-memory automata
• Variable automata over infinite alphabets
• Regular expressions with binding over data words for querying graph databases

Uses Software

• nSPARQL
• XPath
• GraphLog

This page was built for publication: Using variable automata for querying data graphs

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