Divide-and-approximate: a novel constraint push strategy for iceberg cube mining Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong, and Jiawei Han   View Paper (PDF)   Return to March 2005, Volume 17, Issue 3 Abstract . 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. ©2006 Association for Computing Machinery