Full material
₦ 5,000 $(29)
| Pages | 35 |
| Delivery | Instant, after payment |
Project Details
| Department | Computer Science |
| Type | Project |
| Pages | 35 |
| Reference Style | YES |
| Format | MS Word & PDF |
| Reference No. | CPU2500 |
Abstract
ABSTRACT An efficient and distributed scheme for file mapping or file lookup is critical in decentralizing metadata management within a group of metadata servers. This paper presents a novel technique called Hierarchical Bloom Filter Arrays (HBA) to map filenames to the metadata servers holding their metadata. Two levels of probabilistic arrays, namely, the Bloom filter arrays with different levels of accuracies, are used on each metadata server. One array, with lower accuracy and representing the distribution of the entire metadata, trades accuracy for significantly reduced memory overhead, w…
This is a preview.Unlock the full abstract, all chapters and references.
Unlock Full Material
Full material
₦ 5,000 $(29)
| Pages | 35 |
| Delivery | Instant, after payment |
