NDLI: Communication and memory optimal parallel data cube construction

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

Communication and memory optimal parallel data cube construction

Content Provider	IEEE Xplore Digital Library
Author	Jin, R. Vaidyanathan, K. Yang, G. Agrawal, G.
Copyright Year	1990
Abstract	Data cube construction is a commonly used operation in data warehouses. Because of the volume of data that is stored and analyzed in a data warehouse and the amount of computation involved in data cube construction, it is natural to consider parallel machines for this operation. This paper addresses a number of algorithmic issues in parallel data cube construction. First, we present an aggregation tree for sequential (and parallel) data cube construction, which has minimally bounded memory requirements. An aggregation tree is parameterized by the ordering of dimensions. We present a parallel algorithm based upon the aggregation tree. We analyze the interprocessor communication volume and construct a closed form expression for it. We prove that the same ordering of the dimensions in the aggregation tree minimizes both the computational and communication requirements. We also describe a method for partitioning the initial array and prove that it minimizes the communication volume. Finally, in the cases when memory may be a bottleneck, we describe how tiling can help scale sequential and parallel data cube construction. Experimental results from implementation of our algorithms on a cluster of workstations show the effectiveness of our algorithms and validate our theoretical results.
Sponsorship	IEEE Computer Society
Starting Page	1105
Ending Page	1119
Page Count	15
File Size	1369155
File Format	PDF
ISSN	10459219
Volume Number	16
Issue Number	12
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-12-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	Data warehouses Marketing and sales Concurrent computing Parallel algorithms Clustering algorithms Performance analysis Aggregates Multidimensional systems Data analysis Parallel machines communication analysis. OLAP parallel algorithms
Content Type	Text
Resource Type	Article
Subject	Signal Processing Computational Theory and Mathematics Hardware and Architecture

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

Communication and memory optimal parallel data cube construction

Using tiling to scale parallel data cube construction

Impact of data distribution, level of parallelism, and communication frequency on parallel data cube construction

A Parallel Algorithm for Closed Cube Computation

Building Fuzzy OLAP Using Multi-attribute Summarization

Parallel cluster identification for multidimensional lattices

Fuzzy OLAP cube for qualitative analysis

Compiling communication-efficient programs for massively parallel machines

Optimal view selection for multidimensional database systems

Communication and memory optimal parallel data cube construction

Similar Documents

Communication and memory optimal parallel data cube construction

Using tiling to scale parallel data cube construction

Impact of data distribution, level of parallelism, and communication frequency on parallel data cube construction

A Parallel Algorithm for Closed Cube Computation

Building Fuzzy OLAP Using Multi-attribute Summarization

Parallel cluster identification for multidimensional lattices

Fuzzy OLAP cube for qualitative analysis

Compiling communication-efficient programs for massively parallel machines

Optimal view selection for multidimensional database systems

Communication and memory optimal parallel data cube construction