NDLI: Minimal Condensed Cube: Data Organization, Fast Computation, and Incremental Update

Content Provider	IEEE Xplore Digital Library
Author	Zhuo Wang Ye Xu
Copyright Year	2008
Description	Author affiliation: Sch. of Inf. Sci. & Eng., Shenyang Ligong Univ., Shenyang (Zhuo Wang; Ye Xu)
Abstract	The condensed cube has been proposed to reduce the huge size of data cubes in OLAP system. The intuition of condensed cube is to compress semantically redundant tuples into their representative base single tuples (BSTs). However, previous studies showed that a minimal condensed cube is expensive to compute, and thus mainly concentrated on alternative computation methods for non-minimal condensed cube, which does not guarantee to find and compress all BSTs. In this paper, we focus on the minimal condensed cube and address several practical issues, including physical organization, fast computation, and incremental update. Experiments on both synthetic and real-world datasets show that our proposed algorithms outperform previous methods by a large margin.
Starting Page	60
Ending Page	67
File Size	210845
Page Count	8
File Format	PDF
ISBN	9780769531120
DOI	10.1109/ICICSE.2008.35
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-01-28
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Tree data structures data warehouse Lattices Binary search trees Data engineering Partitioning algorithms online analytical processing Information science Upper bound Aggregates Physics computing Internet data cube
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

A Parallel Algorithm for Closed Cube Computation

Efficient Computation of Iceberg Quotient Cube by Bounding

A Fast Search Algorithm of Anomaly in Data Streams Based on Shifted Wavelet Tree

Parallel construction of multidimensional binary search trees

Indexing and incremental updating condensed data cube

On optimal binary search trees.

Optimal search in random quantizers

Embedding complete binary trees in faulty hypercubes

Organization of associative memory operations with lattice structures

Minimal Condensed Cube: Data Organization, Fast Computation, and Incremental Update

Similar Documents

A Parallel Algorithm for Closed Cube Computation

Efficient Computation of Iceberg Quotient Cube by Bounding

A Fast Search Algorithm of Anomaly in Data Streams Based on Shifted Wavelet Tree

Parallel construction of multidimensional binary search trees

Indexing and incremental updating condensed data cube

On optimal binary search trees.

Optimal search in random quantizers

Embedding complete binary trees in faulty hypercubes

Organization of associative memory operations with lattice structures

Minimal Condensed Cube: Data Organization, Fast Computation, and Incremental Update