Read ahead of digests in similarity based data deduplicaton
作者： Lior Aronovich , Michael Hirsch
DOI:
关键词:
摘要: For read ahead of digests in similarity based data deduplication a system using processor device computing environment, input is partitioned into chunks and digest values are calculated for each the chunks. The positions sizes similar intervals repository found on intervals. located loaded memory background process.
lens.org 参考文章(43)
Cai Bo, Zhang Feng Li, Wang Can, Research on Chunking Algorithms of Data De-duplication Proceedings of the 2012 International Conference on Communication, Electronics and Automation Engineering. pp. 1019- 1025 ,(2013) , 10.1007/978-3-642-31698-2_144
Kave Eshghi, Mark Lillibridge, Deepavali Bhagwat, Peter Camble, Vinay Deolalikar, Greg Trezise, Sparse indexing: large scale, inline deduplication using sampling and locality file and storage technologies. pp. 111- 123 ,(2009)
Kai Li, Hugo Patterson, Benjamin Zhu, Avoiding the disk bottleneck in the data domain deduplication file system file and storage technologies. pp. 18- ,(2008)
Sudipta Sengupta, Jin Li, Adaptive Index for Data Deduplication ,(2011)
Lee Gillam, Neil Edward John Cooke, System, process and method for the detection of common content in multiple documents in an electronic system ,(2012)
Geoff Baum, Thomas Malloy, Walter Chang, Scalable engine that computes user micro-segments for offer matching ,(2011)
Jeffrey Vincent Tofano, Sampling based data de-duplication ,(2012)
Michael N. Condict, Use of similarity hash to route data for improved deduplication in a storage server cluster ,(2009)
Sudipta Sengupta, Biplob Debnath, Ronakkumar N. Desai, Paul Adrian Oltean, Jin Li, Fast and Low-RAM-Footprint Indexing for Data Deduplication ,(2011)
Zachary Levow, Kevin Chang, Method for measuring similarity of diverse binary objects comprising bit patterns ,(2010)