MiniCon: a scalable algorithm for answering queries using views
From MaRDI portal
Cited in
(15)- Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints
- Query optimization in information integration
- Rewriting XPath queries using materialized XPath views
- Rewriting with Acyclic Queries: Mind Your Head
- MiniCon
- Schema mappings: a case of logical dynamics in database theory
- Rewriting queries using views in the presence of arithmetic comparisons
- Using views to generate efficient evaluation plans for queries
- Query answering DL-lite knowledge bases from hidden datasets
- XML queries and constraints, containment and reformulation
- Computing partial hypergraphs of bounded width
- HyperBench. A benchmark and tool for hypergraphs and empirical findings
- Computing optimal hypertree decompositions with SAT
- View selection for real conjunctive queries
- Rewriting union queries using views
This page was built for publication: MiniCon: a scalable algorithm for answering queries using views
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606830)