Title

Pushing Aggregate Constraints by Divide-and-Approximate

Document Type

Article

Publication Date

3-2003

Find in a Library

Catalog Record

Abstract

Iceberg-cube mining is to compute the GROUP BY partitions, for all GROUP BY dimension lists, that satisfy a given aggregate constraint. Previous works have pushed anti-monotone constraints into iceberg-cube mining. However, many useful constraints are not anti-monotone. We propose a novel strategy for pushing general aggregate constraints, called divide-and-approximate. This strategy divides the search space and approximates the constraint in subspaces by a pushable constraint. As the strategy is recursively applied, the approximation approaches the given constraint and the pruning tights up. We show that all constraints defined by SQL aggregates, arithmetic operators and comparison operators can be pushed by divide-and-approximate. We present an efficient implementation for an important subclass and evaluate it on both synthetic and real life databases.

Comments

Paper presented at the 19th International Conference on Data Engineering, Bangalore, India, March 5-8, 2003.

DOI

10.1109/ICDE.2003.1260800

Catalog Record

Share

COinS