An approach to solve a Small File problem in Hadoop by using Dynamic Merging and Indexing Scheme

Main Article Content

Mr. Shubham Bhandari, Mr. Suraj Chougale, Mr. Deeepak Pandit, Mr. Suraj Sawat


Size of the data application in now’s enterprises has been spreading at a excessive frequent from last few donkey’s years. Simultaneously, the emergency to procedure and breakdown the comprehensive volumes of data has also increased. Hadoop Distributed File System (HDFS), is an candid fountain implementation of Apache, show for flowing on profit ironmongery to spindle applications estate diffusive datasets (TB, PB). HDFS construction is supported on alone skipper (Name Node), which stale the metadata for diffusive amount of vassal. To get highest ability, Name Node supply all of the metadata in its RAM. So, when placing with vast enumerate of insignificant defile, Name Node often get a impasse for HDFS as it might go out of remembrance. Apache Hadoop uses Hadoop ARchive (HAR) to distribute with unimportant march. But it is not so effective for several-Name Node surrounding, which exact machine rifle flaking of metadata. In this courier, we have scheme triturate abstract protect construction, New Hadoop ARchive worn sha256 as the constituting, which is a modification of existent HAR. NHAR is mean to condition more reliableness which can also condition automobile peeling of metadata. Instead of worn one NameNode for shop the metadata, NHAR uses manifold NameNodes. Our event guide that NHAR lessen the freight of a sincere NameNode in symbol amount. This companion the crowd more scalable, more lusty and less headlong to deterioration unlikely of Hadoop Archive.

Article Details

How to Cite
, M. S. B. M. S. C. M. D. P. M. S. S. “An Approach to Solve a Small File Problem in Hadoop by Using Dynamic Merging and Indexing Scheme”. International Journal on Recent and Innovation Trends in Computing and Communication, vol. 4, no. 11, Nov. 2016, pp. 227 -, doi:10.17762/ijritcc.v4i11.2635.