期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Dr. Hadoop: an infinite scalable metadata management for Hadoop How the baby elephant becomes immortal
1
作者 dipayan dev ripon patgiri 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2016年第1期15-31,共17页
In this Exa byte scale era, data increases at an exponential rate. This is in turn generating a massive amount of metadata in the file system. Hadoop is the most widely used framework to deal with big data. Due to thi... In this Exa byte scale era, data increases at an exponential rate. This is in turn generating a massive amount of metadata in the file system. Hadoop is the most widely used framework to deal with big data. Due to this growth of huge amount of metadata, however, the efficiency of Hadoop is questioned numerous times by many researchers. Therefore, it is essential to create an efficient and scalable metadata management for Hadoop.Hash-based mapping and subtree partitioning are suitable in distributed metadata management schemes. Subtree partitioning does not uniformly distribute workload among the metadata servers, and metadata needs to be migrated to keep the load roughly balanced. Hash-based mapping suffers from a constraint on the locality of metadata, though it uniformly distributes the load among Name Nodes, which are the metadata servers of Hadoop. In this paper, we present a circular metadata management mechanism named dynamic circular metadata splitting(DCMS). DCMS preserves metadata locality using consistent hashing and locality-preserving hashing, keeps replicated metadata for excellent reliability, and dynamically distributes metadata among the Name Nodes to keep load balancing. Name Node is a centralized heart of the Hadoop. Keeping the directory tree of all files, failure of which causes the single point of failure(SPOF). DCMS removes Hadoop's SPOF and provides an efficient and scalable metadata management. The new framework is named ‘Dr. Hadoop' after the name of the authors. 展开更多
关键词 Hadoop NameNode Metadata locality-preserving hashing Consistent HASHING
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部