NDLI: Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions

Please wait, while we are loading the content...

Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions

Content Provider	IEEE Xplore Digital Library
Author	Zhang, Xiuzhen Chou, Pauline Lienhua Dong, Guozhu
Copyright Year	1989
Abstract	The iceberg cubing problem is to compute the multidimensional group-by partitions that satisfy given aggregation constraints. Pruning unproductive computation for iceberg cubing when nonantimonotone constraints are present is a great challenge because the aggregate functions do not increase or decrease monotonically along the subset relationship between partitions. In this paper, we propose a novel bound prune cubing (BP-Cubing) approach for iceberg cubing with nonantimonotone aggregation constraints. Given a cube over n dimensions, an aggregate for any group-by partition can be computed from aggregates for the most specific n--dimensional partitions (MSPs). The largest and smallest aggregate values computed this way become the bounds for all partitions in the cube. We provide efficient methods to compute tight bounds for base aggregate functions and, more interestingly, arithmetic expressions thereof, from bounds of aggregates over the MSPs. Our methods produce tighter bounds than those obtained by previous approaches. We present iceberg cubing algorithms that combine bounding with efficient aggregation strategies. Our experiments on real-world and artificial benchmark data sets demonstrate that BP-Cubing algorithms achieve more effective pruning and are several times faster than state-of-the-art iceberg cubing algorithms and that BP-Cubing achieves the best performance with the top-down cubing approach.
Sponsorship	IEEE IEEE Comput. Soc. Tech. Committee on Data Eng IEEE Computer Society
Starting Page	903
Ending Page	918
Page Count	16
File Size	2812382
File Format	PDF
ISSN	10414347
Volume Number	19
Issue Number	7
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-07-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Aggregates Marketing and sales Cities and towns Multidimensional systems Partitioning algorithms Subspace constraints Arithmetic Data mining Data warehouses Database languages data warehouses. data cube pruning
Content Type	Text
Resource Type	Article
Subject	Information Systems Computational Theory and Mathematics Computer Science Applications

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

Constraint-based, multidimensional data mining

Communication and memory optimal parallel data cube construction

Computing Iceberg Cubes by Top-Down and Bottom-Up Integration: The StarCubing Approach

Using fuzzy linguistic representations to provide explanatory semantics for data warehouses

Multidimensional database technology

Mining constrained gradients in large databases

Measuring the Sky: On Computing Data Cubes via Skylining the Measures

Efficient algorithms for large-scale temporal aggregation

Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions

Similar Documents

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

Constraint-based, multidimensional data mining

Communication and memory optimal parallel data cube construction

Computing Iceberg Cubes by Top-Down and Bottom-Up Integration: The StarCubing Approach

Using fuzzy linguistic representations to provide explanatory semantics for data warehouses

Multidimensional database technology

Mining constrained gradients in large databases

Measuring the Sky: On Computing Data Cubes via Skylining the Measures

Efficient algorithms for large-scale temporal aggregation

Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions