Issue No. 03 - March (2005 vol. 17)

ISSN: 1041-4347

pp: 354-368

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2005.45

Jiawei Han , IEEE

Guozhu Dong , IEEE

ABSTRACT

The iceberg cube mining computes all cells v, corresponding to GROUP BY partitions, that satisfy a given constraint on aggregated behaviors of the tuples in a GROUP BY partition. The number of cells often is so large that the result cannot be realistically searched without pushing the constraint into the search. Previous works have pushed antimonotone and monotone constraints. However, many useful constraints are neither antimonotone nor monotone. We consider a general class of aggregate constraints of the form f(v)\theta \sigma, where f is an arithmetic function of SQL-like aggregates and \theta is one of <,\leq,\geq,>. We propose a novel pushing technique, called Divide-and-Approximate, to push such constraints. The idea is to recursively divide the search space and approximate the given constraint using antimonotone or monotone constraints in subspaces. This technique applies to a class called separable constraints, which properly contains all constraints built by an arithmetic function f of all SQL aggregates.

INDEX TERMS

Aggregate constraint, constrained data mining, data cube, iceberg cube mining, iceberg query.

CITATION

Jiawei Han, Ke Wang, Jeffrey Xu Yu, Yuelong Jiang, Guozhu Dong, "Divide-and-Approximate: A Novel Constraint Push Strategy for Iceberg Cube Mining",

*IEEE Transactions on Knowledge & Data Engineering*, vol. 17, no. , pp. 354-368, March 2005, doi:10.1109/TKDE.2005.45SEARCH