Using variable automata for querying data graphs

DOI10.1016/j.ipl.2014.10.019zbMath1317.68048OpenAlexW1972794622MaRDI QIDQ483052

Domagoj 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

query languagesdatabasesvariable automata

Mathematics Subject Classification ID

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

Uses Software

• nSPARQL
• XPath
• GraphLog

Cites Work

• Finite-memory automata
• Variable Automata over Infinite Alphabets
• Regular Expressions with Binding over Data Words for Querying Graph Databases

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