Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Compendious and Optimized Succinct Data Structures for Big Data Store

Author : Vinesh kumar 1 Dr Amit Asthana 2 Sunil Kumar 3 Dr. Sunil Kumar 4

Date of Publication :22nd February 2018

Abstract: Data Representation in memory is one of the tasks in Big Data. Data structures include several types of tree data structures through the system can access accurate and efficient data in Big Data. Succinct data structures can play important role in data representation while data is processed in RAM memory for Big Data. Choosing a data structure for Data representation is a very difficult problem in Big Data. We proposed some solution of problems of data representation in Big Data. Data mining in Big Data can be utilized to take a decision by Data processing. We know the functions and rules for query processing. We have to either change method of data processing or we can change the way of data representation in memory. In this paper, different kind of tree data structures is presented for data representation in RAM of a computer system for Big Data by using succinct data structures. Data mining is often required in Big Data. Data must be processed in parallel or steaming manner. In this paper, we first compare all data structures by the table and then we proposed succinct data structures those are very popular now. Each tree presented for Data representation has different time and space complexities.

Reference :

Will Updated soon

Recent Article