g*****u 发帖数: 298 | 1 在Implementing Data Cubes (Venky Harinarayan, Anand Rajaraman,Jeffery
Ullman,
Stanford University)这篇文章中,提到对于OLAP cube lattice,给定常数k,如何选
择k个节点view,以minimize the total query cost。说这个问题是straightforward
redcution from set cover problem。哪位大虾读过这几篇paper,能讲一下具体怎么
reduce from set cover?谢了。 |
|