תקציר
Deduplication is a special case of data compression in which repeated chunks of data are stored only once. 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 might have a negative impact on the storage performance. This can be dealt with by imposing artificial lower and upper bounds. This paper proposes an alternative by which the chunk size distribution is controlled in a natural way. Some analytical and experimental results are given.
| שפה מקורית | אנגלית |
|---|---|
| עמודים (מ-עד) | 81-91 |
| מספר עמודים | 11 |
| כתב עת | Discrete Applied Mathematics |
| כרך | 274 |
| מזהי עצם דיגיטלי (DOIs) | |
| סטטוס פרסום | פורסם - 15 מרץ 2020 |
טביעת אצבע
להלן מוצגים תחומי המחקר של הפרסום 'Dynamic determination of variable sizes of chunks in a deduplication system'. יחד הם יוצרים טביעת אצבע ייחודית.פורמט ציטוט ביבליוגרפי
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver