Review on LDPC Codes for Big Data Storage

Bhuvaneshwari, P. V.; Tharini, C.

doi:10.1007/s11277-020-07937-4

Cited by 10 publications

(7 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Li et al [5] used a genetic algorithm to solve file block duplication among numerous users and data centers. Bhuvaneshwari & Tharini [6] argue that scalable and dependable distributed storage systems are essential due to the growing volume of data. For massive data storage, Low Density Parity Check (LDPC) codes are being investigated.…”

Section: Introductionmentioning

confidence: 99%

Data Recovery Approach with Optimized Cauchy Coding in Distributed Storage System

Funde¹,

Swain²

2022

IJACSA

View full text Add to dashboard Cite

In the professional world, the impact of big data is pulsating to change things. Data is currently generated by a wide range of sensors that are part of smart devices. It necessitates data storage and retrieval that is fault tolerant. Data loss can be caused by natural calamities, human error, or mechanical failure. Several security threats and data degradation attacks attempt to destroy storage disks, causing partial or complete data loss. The data encoding and data recovery mechanisms is proposed in this research. To produce a set of matrices utilizing matrix heuristics, the suggested system proposes an efficient Optimized Cauchy Coding (OCC) approach. In this paper, the Cauchy matrix is used as a generator matrix in Reed Solomon (RS) code to encode data blocks with fewer XOR operations. It reduces the encoding algorithm's time complexity. Furthermore, in the event of a disk failure, missing data from any data block is made available through the Code word. In terms of data recovery, it outperforms the Optimal Weakly Secure Minimum Storage Regenerating (OWSPM-MSR) and Product-Matrix Minimum Storage Regenerating (PM-MSR) methods. For data coding, a 1024KB file with various combinations of data blocks l and parity blocks m is evaluated. In the first scenario, m is 1 and l ranges from 4 to 10. The value of l is 4 in the second scenario, while m ranges from 1 to 10. The existing OWSPM-MSR approach takes an average of 0.125 seconds to encode and 0.22 seconds to decode, whereas the PM-MSR approach takes an average of 0.045 seconds to encode and 0.16 seconds to decode. The proposed OCC approach speeds up data coding by taking an average of 0.035 seconds to encode and 0.116 seconds to decode data.

show abstract

Section: Introductionmentioning

confidence: 99%

Data Recovery Approach with Optimized Cauchy Coding in Distributed Storage System

Funde¹,

Swain²

2022

IJACSA

View full text Add to dashboard Cite

show abstract

“…BhuvaneshwariPV proposed various technologies for LDPC code application in big data storage and pointed out the research gaps in LDPC code application in big data storage. In order to effectively protect and store such big data, the application of LDPC code in cloud storage and network or distributed storage system has become a research hotspot in recent years [2]. HosseiniMM proposed a new algorithm to optimize decision variables for the outcome variables of complex problems such as big data.…”

Section: Introductionmentioning

confidence: 99%

Efficient Query Model of Blockchain System in The Context of Dig Data

Fang¹

2022

HSET

View full text Add to dashboard Cite

The rapid development of big data has become a hot spot of concern in science and technology circles, business circles and even governments around the world. International authoritative publications have been published to discuss the opportunities and challenges brought by big data. Big data is considered as the oil of science and technology. The application amount and ability of big data are becoming a standard to measure comprehensive national strength. Data is an important field of science and technology for vigorous development. Big data is valued and developed by various key fields and authoritative industries. The importance of big data for the development of various fields in the future is self-evident. This paper studies the relevant theories and practices of efficient query model of block chain system under the background of big data, mentions relevant concepts and theories of efficient query model of block chain system, and conducts scientific and systematic demonstration and analysis of efficient query model of block chain system. After several tests, the test results show that the efficient query model of blockchain system under the background of big data is significantly better in terms of the query rate of blockchain.

show abstract

“…Coding-based storage systems can achieve reliability many orders of magnitude higher than replication-based systems for the same redundancy level [2]. There have been plenty of works on erasure codes-based distributed systems [3][4][5][6][7]. High decoding complexity and communication cost to repair a corrupted data fragment reduce popularity of this solution.…”

Section: Introductionmentioning

confidence: 99%

Performance and Time Improvement of LT Codes-based Cloud Storage

Chakani¹,

Mirrezaei²,

Hodtani³

2021

Preprint

View full text Add to dashboard Cite

Outsourcing data on the cloud storage services has already attracted great attention due to prospect of rapid data growth and storing efficiencies for customers. The coding-based cloud storage approach can offer more reliable and faster solution with less storage space in comparison with replication-based cloud storage. LT codes as a famous member of rateless codes family can improve performance of storage systems utilizing good degree distributions. Since degree distribution plays key role in LT codes performance, recently introduced Poisson Robust Soliton Distribution (PRSD) and Combined Poisson Robust Soliton Distribution (CPRSD) motivate us to investigate LT codes-based cloud storage system. So, we exploit LT codes with new degree distributions in order to provide lower average degree and higher decoding efficiency, specifically when receiving fewer encoding symbols, comparing with popular degree distribution, Robust Soliton Distribution (RSD). In this paper, we show that proposed cloud storage outperforms traditional ones in terms of storage space and robustness encountering unavailability of encoding symbols, due to compatible properties of PRSD and CPRSD with cloud storage essence. Furthermore, modified decoding process based on required encoding symbols behavior is presented to reduce data retrieval time. Numerical results confirm improvement of cloud storage performance.

show abstract

Review on LDPC Codes for Big Data Storage

Cited by 10 publications

References 41 publications

Data Recovery Approach with Optimized Cauchy Coding in Distributed Storage System

Data Recovery Approach with Optimized Cauchy Coding in Distributed Storage System

Efficient Query Model of Blockchain System in The Context of Dig Data

Performance and Time Improvement of LT Codes-based Cloud Storage

Contact Info

Product

Resources

About