Knowledgeable Chunking

Détails

ID Serval
serval:BIB_2B15E10C3D7A
Type
Actes de conférence (partie): contribution originale à la littérature scientifique, publiée à l'occasion de conférences scientifiques, dans un ouvrage de compte-rendu (proceedings), ou dans l'édition spéciale d'un journal reconnu (conference proceedings).
Collection
Publications
Institution
Titre
Knowledgeable Chunking
Titre de la conférence
Networked Systems: Third International Conference, NETYS 2015, May 13-15, 2015, Revised Selected Papers
Auteur(s)
Chapuis B., Garbinato B.
Editeur
Springer International Publishing
Adresse
Agadir, Morrocco
ISBN
978-3-319-26849-1
978-3-319-26850-7
ISSN
0302-9743
1611-3349
Statut éditorial
Publié
Date de publication
2015
Peer-reviewed
Oui
Volume
9466
Série
Lecture Notes in Computer Science
Pages
456-460
Langue
anglais
Résumé
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.
Création de la notice
13/07/2017 15:40
Dernière modification de la notice
21/08/2019 5:13
Données d'usage