dc.contributor.author |
Phyu, Myat Pwint
|
|
dc.contributor.author |
Thein, Ni Lar
|
|
dc.date.accessioned |
2019-07-11T07:38:58Z |
|
dc.date.available |
2019-07-11T07:38:58Z |
|
dc.date.issued |
2013-02-26 |
|
dc.identifier.uri |
http://onlineresource.ucsy.edu.mm/handle/123456789/758 |
|
dc.description.abstract |
Today’s storage systems have a major issue for the long-term storage of massive amounts of unstructured data. Availability and reliability are the basic properties of the most storage system. Replication which is the simplest redundancy scheme can help the storage system to achieve continuous access. But too much redundancy will not improve the data availability when the amount of replication reaches a certain point. In this paper, an efficient data deduplication method in large-scale distributed storage system is presented. Since good data indexing is very helpful for duplicate detection, the deduplication scheme with Bloom filter array is used for the sake of space and look-up efficiency in distributed storage system. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Eleventh International Conference On Computer Applications (ICCA 2013) |
en_US |
dc.subject |
Unstructured data |
en_US |
dc.subject |
large-scale distributed storage |
en_US |
dc.subject |
Bloom filter |
en_US |
dc.subject |
deduplication |
en_US |
dc.title |
Using Efficient Deduplication Method in Large-scale Distributed Storage System |
en_US |
dc.type |
Article |
en_US |