AbstractWe consider the problem of rewriting queries using only materialized views. We first show that if the views subsume the query from the point of view of the information content, then the query can be rewritten using only the views, but the resulting query might be extremely inefficient. We then focus on aggregate views and queries over a single relation, which are fundamental in many applications such as data warehousing. We show that in this case, it is possible to guarantee that as soon as the views subsume the query, it can be rewritten in terms of the views in a simple query language. Our main contribution is the conception of rewriting algorithms which run in polynomial time, and the proof of their completeness which relies on c...
AbstractWe study the problem of generating efficient, equivalent rewritings using views to compute t...
OLAP queries involve a lot of aggregations on a large amount of data in data warehouses. To process ...
International audienceIn this paper, we investigate the problem of query rewriting using views in a ...
We consider the problem of rewriting queries using only materialized views. We first show that if th...
AbstractWe consider the problem of rewriting queries using only materialized views. We first show th...
We consider the problem of obtaining equivalent rewritings of aggregate queries using views. We as-s...
Typical queries over data warehouses perform aggregation. One of the main ideas to optimize the exec...
Queries involving aggregation are typical in database applications. One of the main ideas to optimiz...
We investigate the problem of rewriting queries with aggregate operators using views that may or may...
We investigate the problem of rewriting queries with aggregate operators using views that may or may...
We consider the problem of computing answers to queries by using materialized views. Aside from its ...
We study the problem of efficient maintenance of materialized views that may contain duplicates. Thi...
Materialized views offer opportunities for significant performance gain in query evaluation by provi...
We study the complexity of the problem of answering queries using materialized views. This problem h...
AbstractWe study the problem of generating efficient, equivalent rewritings using views to compute t...
OLAP queries involve a lot of aggregations on a large amount of data in data warehouses. To process ...
International audienceIn this paper, we investigate the problem of query rewriting using views in a ...
We consider the problem of rewriting queries using only materialized views. We first show that if th...
AbstractWe consider the problem of rewriting queries using only materialized views. We first show th...
We consider the problem of obtaining equivalent rewritings of aggregate queries using views. We as-s...
Typical queries over data warehouses perform aggregation. One of the main ideas to optimize the exec...
Queries involving aggregation are typical in database applications. One of the main ideas to optimiz...
We investigate the problem of rewriting queries with aggregate operators using views that may or may...
We investigate the problem of rewriting queries with aggregate operators using views that may or may...
We consider the problem of computing answers to queries by using materialized views. Aside from its ...
We study the problem of efficient maintenance of materialized views that may contain duplicates. Thi...
Materialized views offer opportunities for significant performance gain in query evaluation by provi...
We study the complexity of the problem of answering queries using materialized views. This problem h...
AbstractWe study the problem of generating efficient, equivalent rewritings using views to compute t...
OLAP queries involve a lot of aggregations on a large amount of data in data warehouses. To process ...
International audienceIn this paper, we investigate the problem of query rewriting using views in a ...