Using variable automata for querying data graphs

DOI10.1016/J.IPL.2014.10.019MaRDI QIDQ483052zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Describes a project that uses

Uses Software

• GraphLog
• XPath
• nSPARQL

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)