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
- The View Selection Problem for Regular Path Queries
- Rewriting queries using views with access patterns under integrity constraints
Cites work
- Finding Regular Simple Paths in Graph Databases
- Foundations of Information and Knowledge Systems
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Rewriting of regular expressions and regular path queries
Cited in
(12)- scientific article; zbMATH DE number 5808834 (Why is no real title available?)
- View-based query answering in description logics: semantics and complexity
- Rewriting XPath queries using materialized XPath views
- New rewritings and optimizations for regular path queries
- A family of efficient regular arrays for algebraic path problem
- Algebraic rewritings for optimizing 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
- View-based tree-language rewritings for XML
- The View Selection Problem for Regular Path Queries
- Rewriting of regular expressions and regular path queries
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 Q1401283)