Pushing aggregate constraints by divide-and-approximate

Ke Wang, Yuelong Jiang, Jeffrey Xu Yu, Guozhu Dong, Jiawei Han

Research output: Contribution to conferencePaper

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. In this paper, 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.

Original languageEnglish (US)
Pages291-302
Number of pages12
StatePublished - Dec 1 2003
EventNineteenth International Conference on Data Ingineering - Bangalore, India
Duration: Mar 5 2003Mar 8 2003

Other

OtherNineteenth International Conference on Data Ingineering
CountryIndia
CityBangalore
Period3/5/033/8/03

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Cite this

Wang, K., Jiang, Y., Yu, J. X., Dong, G., & Han, J. (2003). Pushing aggregate constraints by divide-and-approximate. 291-302. Paper presented at Nineteenth International Conference on Data Ingineering, Bangalore, India.