Leah Findlater and Howard J. Hamilton, University of Regina, Canada
The Iceberg-Cube problem is to identify the combinations of values for a set of attributes for which a specified aggregation function yields values over a specified aggregate threshold. We implemented bottom-up and top-down methods for this problem. The bottom-up method included pruning. Results show that the top-down method, with or without pruning, was slower than the bottom-up method because of less effective pruning.