| Autor: |
Vinesh Kumar, Sunil Kumar, Jayant Shekhar |
| Rok vydání: |
2017 |
| Předmět: |
|
| Zdroj: |
GBAMS- Vidushi. 9 |
| ISSN: |
0974-6374 |
| DOI: |
10.26829/vidushi.v9i02.12288 |
| Popis: |
Data Representation in memory is one of the tasks in Big data. Data representation includes 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 in big-data is processed in main memory. Data representation is a very complex problem in Big Data.We proposed some solution of problems of data representation in Big data. Data processing in big data can be utilized to take a decision on data mining. We know the function and rules for query processing. We have to either change the method of processor we can change the way of representation. In this paper, different kind of tree data structures is presented for data representation in main memory of computer system for big data by using succinct data structures. Here we first compare all data structures by the table. Each method has different space and time complexity. We know that Big data information services increasing day by day. So space complexity of succinct data structures is becoming very popular in practice in this era. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
