LHF: A New Archive based Approach to Accelerate Massive Small Files Access Performance in HDFS

EasyChair Preprint 773

Abstract

As one of the most popular open source projects, Hadoop is considered nowadays as the de-facto framework for managing and analyzing huge amounts of data. HDFS (Hadoop Distributed File System) is one of the core components in Hadoop framework to store big data, especially semi-structured and unstructured data. HDFS provides high scalability and reliability when handling large files across thousands of machines. But the performance will be severely degraded while dealing with massive small files. Although some effort was spent to investigate this well-known issue, existing approaches, such as HAR, SequenceFile, and MapFile, are limited in their ability to reduce the memory consumption of the NameNode and optimize the access performance in the meantime. In this paper, we presented LHF, a solution to handle massive small files in HDFS by merging small files into big files and building a linear hashing based extendable index to speed up the process of locating a small file. The advantages of our approach are (1) it significantly reduces the size of the metadata, (2) it does not require sorting the files at the client side, (3) it supports appending more small files to the merged file afterwards and (4) it achieves good access performance.  A series of experiments were performed to demonstrate the effectiveness and efficiency of LHF as well, which takes less time while accessing files compared with other methods.

Keyphrases: HDFS, Linear Hashing, massive small files

@booklet{EasyChair:773,
  author    = {Wenjun Tao and Yanlong Zhai and Jude Tchaye-Kondi},
  title     = {LHF: A New Archive based Approach to Accelerate Massive Small Files Access Performance in HDFS},
  doi       = {10.29007/rft1},
  howpublished = {EasyChair Preprint 773},
  year      = {EasyChair, 2019}}