The View Selection Problem for Regular Path Queries

DOI10.1007/978-3-540-78773-0_11MaRDI QIDQ5458522zbMATH OpenOpenAlexFDO

Authors 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

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

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

Cites work

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

Cited in

(9)

• scientific article; zbMATH DE number 2080467 (Why is no real title available?)
• View selection for real conjunctive queries
• scientific article; zbMATH DE number 1953135 (Why is no real title available?)
• scientific article; zbMATH DE number 2080479 (Why is no real title available?)
• A formal perspective on the view selection problem
• Asymptotic determinacy of path queries using union-of-paths views
• Bounded regular path queries in view-based data integration
• XML reconstruction view selection in XML databases: complexity analysis and approximation scheme
• Algebraic rewritings for optimizing regular path 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)