The View Selection Problem for Regular Path Queries

DOI10.1007/978-3-540-78773-0_11zbMath1136.68374OpenAlexW1563740291MaRDI QIDQ5458522

Sergey Afonin

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_11

zbMATH Keywords

view selection problemregular path queriessemigroups of regular languages

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rewriting of regular expressions and regular path queries
• Representation theorems on regular languages
• Algebraic rewritings for optimizing regular path queries.
• A formal perspective on the view selection problem
• The limitedness problem on distance automata: Hashiguchi's method revisited
• STACS 2004
• Database Theory - ICDT 2005
• MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES

This page was built for publication: The View Selection Problem for Regular Path Queries