Research of Access Optimization of Small Files on Basis of B + Tree on Hadoop

Hadoop, the open-source software for reliable, scalable, distributed computing used in the processing and storage of extremely large data sets, is originally designed to store large amounts of large files resulting in huge wastage of storage space for Data Node and increase in the memory space utilization, for Name Node, when dealing with massive small files. For the above shortcomings, this paper puts forward a optimization design for small files access scheme, which speeds up the small file location through the file index, on the Hadoop platform based on B + tree index, resulting in the improvement in the access efficiency of small files. The effectiveness of the proposed scheme is experimentally validated.