Sensitivity Analysis of Hierarchical Bloom Filter Arrays
碩士 === 臺灣大學 === 資訊網路與多媒體研究所 === 98 === We propose a selection criteria of two efficient distributed metadata management schemes, pure Bloom filter arrays and hierarchical Bloom filter arrays. The selection criteria helps us to know which metadata management scheme can have better performance for the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/33458140135329896099 |
| Summary: | 碩士 === 臺灣大學 === 資訊網路與多媒體研究所 === 98 === We propose a selection criteria of two efficient distributed metadata management schemes, pure Bloom filter arrays and hierarchical Bloom filter arrays. The selection criteria helps us to know which metadata management scheme can have better performance for the different file access patterns. The selection criteria not only analyzes the theoretical performance for both metadata management schemes, but also compares the theoretical results with the real file system workload. The simulation results indicate that our theoretical analysis results are close to the real distributed system performance.
|
|---|