Knowledgeable Chunking

Details

Serval ID
serval:BIB_2B15E10C3D7A
Type
Inproceedings: an article in a conference proceedings.
Collection
Publications
Institution
Title
Knowledgeable Chunking
Title of the conference
Networked Systems: Third International Conference, NETYS 2015, May 13-15, 2015, Revised Selected Papers
Author(s)
Chapuis B., Garbinato B.
Publisher
Springer International Publishing
Address
Agadir, Morrocco
ISBN
978-3-319-26849-1
978-3-319-26850-7
ISSN
0302-9743
1611-3349
Publication state
Published
Issued date
2015
Peer-reviewed
Oui
Volume
9466
Series
Lecture Notes in Computer Science
Pages
456-460
Language
english
Abstract
Chunking algorithms are often used by storage solutions in order to factorize and deduplicate data. Such algorithms make the assumption that the consecutive versions of a file share a lot of similarities. Unfortunately, file formats often use compression algorithms and minor changes have the potential to completely reorganize the internal layout of a file. In consequence, chunking algorithms become less efficient in factorizing data. In this paper, we evaluate content-defined chunking with file formats that use data compression. We show how content-defined chunking algorithms can take the file format into account. Finally, we demonstrate that adding file format knowledge to a popular chunking algorithm significantly improves its performance.
Create date
13/07/2017 15:40
Last modification date
21/08/2019 5:13
Usage data