Algebraic rewritings for optimizing regular path queries.

DOI10.1016/S0304-3975(02)00739-9zbMath1045.68072OpenAlexW2616344723MaRDI QIDQ1401283

Gösta Grahne, Alex Thomo

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00739-9

zbMATH Keywords

AutomataRegular path queriesSemistructured dataTransducersQuery rewritingQuery optimizationCached views

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

View-based query answering in description logics: semantics and complexity ⋮ The View Selection Problem for Regular Path Queries

Uses Software

• Lorel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rewriting of regular expressions and regular path queries
• On the equivalence, containment, and covering problems for the regular and context-free languages
• Finding Regular Simple Paths in Graph Databases
• Foundations of Information and Knowledge Systems

This page was built for publication: Algebraic rewritings for optimizing regular path queries.