Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Scalable Algorithm for Answering Queries Using Views
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Answering queries from statistics and probabilistic views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Answering top-k queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Rewriting queries using views in the presence of arithmetic comparisons
Theoretical Computer Science
Data integration with uncertainty
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Bootstrapping pay-as-you-go data integration systems
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Computational aspects of monotone dualization: A brief survey
Discrete Applied Mathematics
FORUM: a flexible data integration system based on data semantics
ACM SIGMOD Record
| Hi-index | 0.00 |
This paper considers the problem of rewriting queries using views by means of a tolerant method. The approach proposed is based on an approximate matching between the constraints from the query and those from the views, in the case where both the query and the views contain arithmetical constraints expressed as intervals. In such a context, the answers obtained are not certain anymore but only more or less probable. An algorithm which retrieves the top-k rewritings of a given query is described. Experimentations are reported, which show that the extra cost induced by the approximate nature of the rewriting process is perfectly acceptable.