The View Selection Problem for Regular Path Queries

DOI10.1007/978-3-540-78773-0_11zbMATH Open1136.68374OpenAlexW1563740291MaRDI QIDQ5458522FDOQ5458522

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

Recommendations

• A formal perspective on the view selection problem
• View selection for real conjunctive queries
• Rewriting of regular expressions and regular path queries
• Database Theory - ICDT 2005
• Selecting and using views to compute aggregate queries

zbMATH Keywords

view selection problemregular path queriessemigroups of regular languages

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The limitedness problem on distance automata: Hashiguchi's method revisited
• Title not available (Why is that?)
• Representation theorems on regular languages
• Rewriting of regular expressions and regular path queries
• Algebraic rewritings for optimizing regular path queries.
• Title not available (Why is that?)
• Database Theory - ICDT 2005
• A formal perspective on the view selection problem
• MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
• STACS 2004
• A note on finitely generated semigroups of regular languages.

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A formal perspective on the view selection problem
• Algebraic rewritings for optimizing regular path queries.
• Title not available (Why is that?)
• View selection for real conjunctive queries

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

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