Algebraic rewritings for optimizing regular path queries
From MaRDI portal
Recommendations
- Algebraic rewritings for optimizing regular path queries.
- New rewritings and optimizations for regular path queries
- Rewriting of regular expressions and regular path queries
- Rewriting queries using views with access patterns under integrity constraints
- The View Selection Problem for Regular Path Queries
Cited in
(12)- Algebraic rewritings for optimizing regular path queries.
- Regular path queries under approximate semantics
- scientific article; zbMATH DE number 5808834 (Why is no real title available?)
- New rewritings and optimizations for regular path queries
- Applying low-level query optimization techniques by rewriting
- scientific article; zbMATH DE number 2166726 (Why is no real title available?)
- Write it recursively
- On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
- View-based tree-language rewritings for XML
- Optimization properties for classes of conjunctive regular path queries
- Rewriting of regular expressions and regular path queries
- Rewriting of visibly pushdown languages for XML data integration
This page was built for publication: Algebraic rewritings for optimizing regular path queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473277)