Compendious and Optimized Succinct Data Structures for Big Data Store

Abstract

Data Representation in memory is a one of task in Big Data. Data structures includes several types of tree data structures through system can access accurate and efficiently 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 memory representation is very difficult problem in Big Data. We proposed some solution of problems of data representation in Big Data. Data Mining can be utilized to take 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 way of data representation in memory. In this paper, different kind of tree data structures are presented for data representation in RAM of 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 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.