NDLI: Efficient storage scheme for n-dimensional sparse array: GCRS/GCCS

Content Provider	IEEE Xplore Digital Library
Author	Abu Hanif Shaikh, M. Azharul Hasan, K.M.
Copyright Year	2015
Description	Author affiliation: Comput. Sci. & Eng. Dept., Khulna Univ. of Eng. & Technol., Khulna, Bangladesh (Abu Hanif Shaikh, M.; Azharul Hasan, K.M.)
Abstract	Degree of data sparsity increases with the increase of number of dimensions in high performance scientific computing. Storing and applying operations on this highly sparse multidimensional data is still a challenge for data scientists. Experts suggest special storage scheme over sparse array. In traditional sparse array storage scheme, (n+l) one dimensional arrays are necessary to store n-dimensional array. In this paper, we propose `Generalized Row/Column Storage (GCRS/GCCS)' scheme which requires three one dimensional arrays only for storing a n-dimensional array. The superiority of the GCRS/GCCS over traditional Compressed Row/Column Storage (CRS/CCS) is shown by both theoretical analysis and experimental results. In theoretical analysis, we derive equations for space and time complexity as well as the range of usability for GCRS/GCCS. It is shown that the GCRS/GCCS scheme yields to support minimum 50% data density where as the range of usability is inversely proportional with the number of dimensions for CRS/CCS scheme. The experimental result shows that the proposed GCRS/GCCS scheme outperforms the CRS/CCS scheme with respect to space complexity, time complexity and range of usability.
Starting Page	137
Ending Page	142
File Size	10791465
Page Count	6
File Format	PDF
ISBN	9781467378123
e-ISBN	9781467378130
DOI	10.1109/HPCSim.2015.7237032
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-07-20
Publisher Place	Netherlands
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	High Performance Computing Array Compression CRS Array Storage Array operations Indexes Sparse Array Tensile stress CCS Arrays Mathematical model Time complexity Usability Multidimensional Array
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

Efficient data compression methods for multi- dimensional sparse array operations based on the EKMR scheme

EaChOff: Chunk offset compression scheme for high dimensional data based on Extendible Multidimensional Array

Efficient data compression methods for multi-dimensional sparse array operations

Memory-Efficient Computation of High-Dimensional Integral Images

Minimal Quadtree Format for Compression of Sparse Matrices Storage

A new approach for representation of multidimensional matrix multiplication operations.

Efficient data compression methods for multidimensional sparse array operations based on the EKMR scheme

Efficient Execution of Operations in a DBMS for Multidimensional Arrays (1998)

Abstract analysis.

Efficient storage scheme for n-dimensional sparse array: GCRS/GCCS

Similar Documents

Efficient data compression methods for multi- dimensional sparse array operations based on the EKMR scheme

EaChOff: Chunk offset compression scheme for high dimensional data based on Extendible Multidimensional Array

Efficient data compression methods for multi-dimensional sparse array operations

Memory-Efficient Computation of High-Dimensional Integral Images

Minimal Quadtree Format for Compression of Sparse Matrices Storage

A new approach for representation of multidimensional matrix multiplication operations.

Efficient data compression methods for multidimensional sparse array operations based on the EKMR scheme

Efficient Execution of Operations in a DBMS for Multidimensional Arrays (1998)

Abstract analysis.

Efficient storage scheme for n-dimensional sparse array: GCRS/GCCS