MiniCon: a scalable algorithm for answering queries using views

MaRDI QIDQ1606830zbMATH OpenFDO

Authors Rachel Pottinger, A. Levy

Publication date 25 July 2002

Published in The VLDB Journal (Search for Journal in Brave)

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Cited in

(15)

• MiniCon
• Query answering DL-lite knowledge bases from hidden datasets
• Query optimization in information integration
• Computing partial hypergraphs of bounded width
• Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints
• Rewriting XPath queries using materialized XPath views
• HyperBench. A benchmark and tool for hypergraphs and empirical findings
• Schema mappings: a case of logical dynamics in database theory
• XML queries and constraints, containment and reformulation
• Computing optimal hypertree decompositions with SAT
• Rewriting with Acyclic Queries: Mind Your Head
• Rewriting union queries using views
• Rewriting queries using views in the presence of arithmetic comparisons
• Using views to generate efficient evaluation plans for queries
• View selection for real conjunctive queries

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)