M.Tech / M.E / PhD Thesis | Computer Science & Engineering | India | Volume 4 Issue 11, November 2015
An Adaptive Partitioning Technique to Improve the Performance of Bigdata
R. Siva Kumar | K. Nageswara Rao 
Abstract: The performance of parallel computing purely depends on the data partitions. Hadoop is the framework to perform the computations on the partitioned data across many systems and produce the results. It also suffers with the statistic partitioning concept present in the framework over large datasets. In this paper we propose a dynamic partitioning algorithm which improves the data analytics over large datasets. Our algorithm provides user friendly reports on the given dataset and reduces the cost of the project. This new algorithm improvises the effective utilisation of the nodes in the cluster and reduces the execution time.
Keywords: BigData, HDFS, MapReduce, DynamicDataPartition, Distributed computing
Edition: Volume 4 Issue 11, November 2015,
Pages: 809 - 811
How to Cite this Article?
R. Siva Kumar, K. Nageswara Rao, "An Adaptive Partitioning Technique to Improve the Performance of Bigdata", International Journal of Science and Research (IJSR), Volume 4 Issue 11, November 2015, pp. 809-811, https://www.ijsr.net/get_abstract.php?paper_id=NOV151163
How to Share this Article?
Similar Articles with Keyword 'BigData'
Variable Size Bin Packing Algorithm for IoT
Overview of Big Data