{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:04:30Z","timestamp":1766066670141,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of Chin","doi-asserted-by":"publisher","award":["61402061"],"award-info":[{"award-number":["61402061"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Chongqing Basic and Frontier Research Project of China","award":["cstc2016jcyjA0274"],"award-info":[{"award-number":["cstc2016jcyjA0274"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2017]]},"DOI":"10.1109\/access.2017.2694014","type":"journal-article","created":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T21:07:04Z","timestamp":1493068024000},"page":"5366-5377","source":"Crossref","is-referenced-by-count":3,"title":["Multi-Objective Metrics to Evaluate Deduplication Approaches"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9055-5389","authenticated-orcid":false,"given":"Yujuan","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhichao","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"14","article-title":"A study of practical deduplication","author":"meyer","year":"2011","journal-title":"Proc FAST"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1383422.1383428"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1534530.1534541"},{"key":"ref30","first-page":"73","article-title":"Alternatives for detecting redundancy in storage systems data","author":"policroniades","year":"2004","journal-title":"Proc USENIX"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2012.32"},{"key":"ref11","first-page":"183","article-title":"Improving restore speed for backup systems that use inline chunk-based deduplication","author":"lillibridge","year":"2013","journal-title":"Proc FAST"},{"key":"ref12","first-page":"181","article-title":"Accelerating restore, garbage collection in deduplication-based backup systems via exploiting historical information","author":"fu","year":"2014","journal-title":"Proc UNSENIX ATC"},{"key":"ref13","first-page":"331","article-title":"Design tradeoffs for data deduplication performance in backup workloads","author":"fu","year":"2015","journal-title":"Proc FAST"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2010.69"},{"article-title":"Fingerprinting by random polynomials","year":"1981","author":"rabin","key":"ref15"},{"year":"1995","key":"ref16","article-title":"Secure hash standard"},{"key":"ref17","first-page":"101","article-title":"Decentralized deduplication in SAN cluster file systems","author":"clements","year":"2009","journal-title":"Proc USENIX"},{"key":"ref18","first-page":"197","article-title":"HYDRAstor: A scalable secondary storage","author":"dubnicki","year":"2009","journal-title":"Proc FAST"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.47"},{"key":"ref28","first-page":"1","article-title":"Building a high-performance deduplication system","author":"guo","year":"2011","journal-title":"Proc USENIX"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2009.5366623"},{"key":"ref27","first-page":"1","article-title":"ChunkStash: Speeding up inline storage deduplication using flash memory","author":"debnath","year":"2010","journal-title":"Proc USENIX"},{"key":"ref3","first-page":"111","article-title":"Sparse indexing: Large scale, inline deduplication using sampling and locality","author":"lillibridge","year":"2009","journal-title":"Proc FAST"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2006.42"},{"key":"ref29","first-page":"1","article-title":"iDedup: Latency-aware, inline data deduplication for primary storage","author":"srinivasan","year":"2012","journal-title":"Proc FAST"},{"key":"ref5","first-page":"1","article-title":"SiLo: A similarity-locality based near-exact deduplication scheme with low RAM overhead and high throughput","author":"xia","year":"2011","journal-title":"Proc USENIX"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1925019.1925021"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1542275.1542327"},{"key":"ref2","first-page":"1","article-title":"Avoiding the disk bottleneck in the data domain deduplication file system","author":"zhu","year":"2008","journal-title":"Proc FAST"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2367589.2367600"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1060289.1060291"},{"key":"ref20","first-page":"13","article-title":"Single Instance Storage in Windows 2000","author":"bolosky","year":"2000","journal-title":"Proc USENIX"},{"key":"ref22","first-page":"89","article-title":"Venti: A new approach to archival storage","author":"quinlan","year":"2002","journal-title":"Proc FAST"},{"journal-title":"EMC Centera Content addressed storage system","year":"2003","key":"ref21"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1145\/1210596.1210599","article-title":"Improving duplicate elimination in storage systems","volume":"2","author":"deepak","year":"2006","journal-title":"ACM Trans Storage"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502052"},{"key":"ref26","first-page":"143","article-title":"Fast, inexpensive content-addressed storage in Foundation","author":"rhea","year":"2008","journal-title":"Proc USENIX"},{"article-title":"A framework for analyzing, improving content based chunking algorithms","year":"2005","author":"eshghi","key":"ref25"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/7859429\/07907281.pdf?arnumber=7907281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:29:59Z","timestamp":1642004999000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7907281\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/access.2017.2694014","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2017]]}}}