NDLI: Pushing aggregate constraints by divide-and-approximate

Content Provider	IEEE Xplore Digital Library
Author	Ke Wang Yuelong Jiang Jeffrey Xu Yu Guozhu Dong Jiawei Han
Copyright Year	2003
Description	Author affiliation: Simon Fraser Univ., Burnaby, BC, Canada (Ke Wang; Yuelong Jiang)
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.
Sponsorship	IEEE Comput. Soc. Tech. Committee on Data Eng
Starting Page	291
Ending Page	302
File Size	756788
Page Count	12
File Format	PDF
ISBN	078037665X
DOI	10.1109/ICDE.2003.1260800
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2003-03-05
Publisher Place	India
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Aggregates Subspace constraints Arithmetic Councils Databases Decision support systems Prototypes Design engineering Data engineering Humans
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Divide-and-approximate: a novel constraint push strategy for iceberg cube mining

Pushing aggregate constraints by divide-and-approximate (2003).

MLPQ: a linear constraint database system with aggregate operators

Analysis of Problems and Trends of Decision Support Systems Development

MOOLAP: Towards Multi-Objective OLAP

IMPrECISE: Good-is-good-enough data integration

Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions

Aggregate-based query processing in a parallel data warehouse server

Aggregate Skyline: Analysis for Online Users

Pushing aggregate constraints by divide-and-approximate

Similar Documents

Divide-and-approximate: a novel constraint push strategy for iceberg cube mining

Pushing aggregate constraints by divide-and-approximate (2003).

MLPQ: a linear constraint database system with aggregate operators

Analysis of Problems and Trends of Decision Support Systems Development

MOOLAP: Towards Multi-Objective OLAP

IMPrECISE: Good-is-good-enough data integration

Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions

Aggregate-based query processing in a parallel data warehouse server

Aggregate Skyline: Analysis for Online Users

Pushing aggregate constraints by divide-and-approximate