The View Selection Problem for Regular Path Queries
From MaRDI portal
Recommendations
Cites work
- A formal perspective on the view selection problem
- A note on finitely generated semigroups of regular languages.
- Algebraic rewritings for optimizing regular path queries.
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES
- Minimizing view sets without losing query-answering power
- Representation theorems on regular languages
- Rewriting of regular expressions and regular path queries
- STACS 2004
- Syntactic semiring and language equations
- The limitedness problem on distance automata: Hashiguchi's method revisited
- View-based query processing: On the relationship between rewriting, answering and losslessness
Cited in
(9)- Algebraic rewritings for optimizing regular path queries.
- A formal perspective on the view selection problem
- XML reconstruction view selection in XML databases: complexity analysis and approximation scheme
- New rewritings and optimizations for regular path queries
- Minimizing view sets without losing query-answering power
- Algebraic rewritings for optimizing regular path queries
- Asymptotic determinacy of path queries using union-of-paths views
- Bounded regular path queries in view-based data integration
- 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)