HI all:
anyone can explain the detail of the MonteCarlo algorithm to compute
the tiles of a Lattice?
It seems that MonteCarlo algorithm will simulate every possible query
of all kind of AggregateImpls ,and will choose the lowest cost's ( cost
model determined by the estimateCost() method of LatticeImpl )
AggregateImpl to be the titles.
I also find that the cost benefits of the choose AggregateImpls don't
play any role to the final output AggregateImpl.
please correct my opinion and show me the mathematical theory of the
MonteCarlo algorithm to choose the best aggregates .
Regards.
