Abstract
A special case of data compression in which repeated chunks of data are stored only once is known as deduplication. The input data is cut into chunks and a cryptographically strong hash value of each (different) chunk is stored. To restrict the influence of small inserts and deletes to local perturbations, the chunk boundaries are usually defined in a data dependent way, which implies that the chunks are of variable length. Usually, the chunk sizes may spread over a large range, which may have a negative impact on the storage performance. This may be dealt with by imposing artificial lower and upper bounds. This paper suggests an alternative by which the chunk size distribution is controlled in a natural way. Some analytical and experimental results are given.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Prague Stringology Conference 2015, PSC 2015 |
| Editors | Jan Zd'arek, Jan Holub |
| Publisher | Prague Stringology Club |
| Pages | 78-89 |
| Number of pages | 12 |
| ISBN (Electronic) | 9788001057872 |
| State | Published - 2015 |
| Event | 19th Prague Stringology Conference, PSC 2015 - Prague, Czech Republic Duration: 24 Aug 2015 → 26 Aug 2015 |
Publication series
| Name | Proceedings of the Prague Stringology Conference 2015, PSC 2015 |
|---|
Conference
| Conference | 19th Prague Stringology Conference, PSC 2015 |
|---|---|
| Country/Territory | Czech Republic |
| City | Prague |
| Period | 24/08/15 → 26/08/15 |
Bibliographical note
Publisher Copyright:© Czech Technical University in Prague, Czech Republic.