MiniCon Algorithm for Aggregate Query Rewriting
Guohua Liu · Microelectronics & Computer · 2006
This paper addresses the aggregate query rewriting problem. An algorithm that can find the maximally-contained rewriting query is presented, when a aggregate query and a set of aggregate views are given. The idea is borrowed from MiniCon. It is shown that the algorithm is correct.