Inline Deduplication
Inline Deduplication is a data deduplication technique that identifies and eliminates redundant data segments in real time as data is written to storage, before it is persistently stored, thereby ensuring that only unique data blocks are archived in a content-addressable storage system.
25
Publications
1.5K
Citations
104
Authors
45
Institutions
Publications per year
2017–2026
9
25
Sparse indexing: large scale, inline deduplication using sampling and locality
Mark Lillibridge, Kave Eshghi, Deepavali Bhagwat et al. · 2009 · 384 citations
iDedup: latency-aware, inline data deduplication for primary storage
Kiran Srinivasan, Tim Bisson, Garth R. Goodson et al. · 2012 · 254 citations
The design of a similarity based deduplication system
Lior Aronovich, Ron Asher, Eitan Bachmat et al. · 2009 · 110 citations
1–5 of 25
104
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 104
45

Huazhong University of Science and Technology
Wuhan, China
2 h-index
6 publications
68 citations
University of California, Santa Cruz
Santa Cruz, United States
2 h-index
3 publications
500 citations

Ajou University
Suwon, South Korea
2 h-index
2 publications
27 citations
Wuhan National Laboratory for Optoelectronics
Wuhan, China
2 h-index
6 publications
68 citations

University of Minnesota
Minneapolis, United States
2 h-index
7 publications
135 citations
IBM Research - Almaden
San Jose, United States
2 h-index
2 publications
82 citations
Sogang University
Seoul, South Korea
2 h-index
6 publications
76 citations
Hewlett-Packard (United States)
Palo Alto, United States
2 h-index
5 publications
1.4K citations
1–8 of 45
Conference · 4 publications · 239 citations
4
h-index
TPDS · 2 publications · 23 citations
2
h-index
1 publications · 13 citations
1
h-index
1 publications · 16 citations
1
h-index
TOS · 1 publications · 53 citations
1
h-index
1–5