IDEAS home Printed from https://ideas.repec.org/a/eme/techsp/techs-08-2024-0114.html
   My bibliography  Save this article

Efficient small file management in Hadoop distributed file system for enhanced e-government services

Author

Listed:
  • Fredrick Ishengoma

Abstract

Purpose - This paper introduces the Efficient Small File Management Algorithm (ESFMA) to overcome the challenge of small file inefficiency of Hadoop distributed file system (HDFS) for e-government services. Design/methodology/approach - ESFMA is designed with the following features: hierarchical metadata architecture, caching, block aggregation, prefetching and locality-aware data placement. These are intended to optimize NameNode memory usage, metadata handling, data block management, I/O and network performance. The algorithm was implemented in experiments on HDFS with real e-government small files. Findings - The experiments showed that ESFMA saves 10% of NameNode memory, 12% of metadata requests, 3.8% of data block use, 15% of read latency, 17% of write latency and 10% of network traffic. Practical implications - This study suggests that implementation of ESFMA has the potential to enable better e-government services in HDFS to be run efficiently and effectively. Originality/value - This paper presents an algorithm for small file management in HDFS, filling an important need in improving service efficiency and performance in e-government services.

Suggested Citation

  • Fredrick Ishengoma, 2025. "Efficient small file management in Hadoop distributed file system for enhanced e-government services," Technological Sustainability, Emerald Group Publishing Limited, vol. 4(2), pages 160-180, April.
  • Handle: RePEc:eme:techsp:techs-08-2024-0114
    DOI: 10.1108/TECHS-08-2024-0114
    as

    Download full text from publisher

    File URL: https://www.emerald.com/insight/content/doi/10.1108/TECHS-08-2024-0114/full/html?utm_source=repec&utm_medium=feed&utm_campaign=repec
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://www.emerald.com/insight/content/doi/10.1108/TECHS-08-2024-0114/full/pdf?utm_source=repec&utm_medium=feed&utm_campaign=repec
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1108/TECHS-08-2024-0114?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eme:techsp:techs-08-2024-0114. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Emerald Support (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.