MiniCon: a scalable algorithm for answering queries using views
From MaRDI portal
Publication:1606830
zbMath0991.68702MaRDI QIDQ1606830
Rachel Pottinger, Alon Y. Halevy
Publication date: 25 July 2002
Published in: The VLDB Journal (Search for Journal in Brave)
Related Items (15)
Rewriting queries using views in the presence of arithmetic comparisons ⋮ Query optimization in information integration ⋮ Using views to generate efficient evaluation plans for queries ⋮ HyperBench ⋮ Computing optimal hypertree decompositions with SAT ⋮ Computing partial hypergraphs of bounded width ⋮ Rewriting with Acyclic Queries: Mind Your Head ⋮ Rewriting XPath queries using materialized XPath views ⋮ XML queries and constraints, containment and reformulation ⋮ View selection for real conjunctive queries ⋮ Query answering DL-lite knowledge bases from hidden datasets ⋮ MiniCon ⋮ Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints ⋮ Schema Mappings: A Case of Logical Dynamics in Database Theory ⋮ Rewriting union queries using views
This page was built for publication: MiniCon: a scalable algorithm for answering queries using views
