{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:47:34Z","timestamp":1764784054272,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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 China","doi-asserted-by":"publisher","award":["61572232"],"award-info":[{"award-number":["61572232"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Planning Project of Guangzhou","award":["201604016100"],"award-info":[{"award-number":["201604016100"]}]},{"DOI":"10.13039\/501100002367","name":"Open Research Fund of Key Laboratory of Computer System and Architecture, Institute of Computing Technology, Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["CARCH201401","CARCH201705"],"award-info":[{"award-number":["CARCH201401","CARCH201705"]}],"id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2800763","type":"journal-article","created":{"date-parts":[[2018,2,1]],"date-time":"2018-02-01T19:18:36Z","timestamp":1517512716000},"page":"15743-15753","source":"Crossref","is-referenced-by-count":18,"title":["LDFS: A Low Latency In-Line Data Deduplication File System"],"prefix":"10.1109","volume":"6","author":[{"given":"Yongtao","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9686-6233","authenticated-orcid":false,"given":"Yuhui","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurence T.","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ru","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Si","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33615-7_9"},{"journal-title":"Bonnie++ file-system benchmarking tool","year":"2012","author":"coker","key":"ref38"},{"key":"ref33","first-page":"10","article-title":"Delta compressed and deduplicated storage using stream-informed locality","author":"shilane","year":"2012","journal-title":"Proc 4th USENIX Conf Hot Topics Storage File Syst"},{"journal-title":"FUSE","year":"2018","author":"rath","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2512348"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC.and.EUC.2013.122"},{"article-title":"PostMark: A new file system benchmark","year":"1997","author":"katcher","key":"ref37"},{"journal-title":"How to Force a Garbage Collection of the Deduplication Folder","year":"2018","key":"ref36"},{"journal-title":"Tokyo Cabinet","year":"2018","key":"ref35"},{"key":"ref34","first-page":"25","article-title":"Building a high-performance deduplication system","author":"guo","year":"2011","journal-title":"Proc USENIX Annu Tech Conf"},{"key":"ref10","first-page":"181","article-title":"Accelerating restore and garbage collection in deduplication-based backup systems via exploiting historical information","author":"fu","year":"2014","journal-title":"Proc of USENIX Annual Technical Conf (USENIX)"},{"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","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2012.32"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SC.Companion.2012.110"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1922649.1922660"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.02.002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2008.02.002"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.263"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2485732.2485748"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2009.5366623"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.76"},{"key":"ref4","first-page":"89","article-title":"Venti: A new approach to archival storage","author":"quinlan","year":"2002","journal-title":"Proc FAST"},{"key":"ref27","first-page":"331","article-title":"Design tradeoffs for data deduplication performance in backup workloads","author":"fu","year":"2015","journal-title":"Proc FAST"},{"journal-title":"Experiencing Data De-duplication Improving Efficiency and Reducing Capacity Requirements","year":"2007","author":"biggar","key":"ref3"},{"journal-title":"Key Considerations As Deduplication Evolves into Primary Storage","year":"2011","author":"dubois","key":"ref6"},{"year":"2018","key":"ref29"},{"key":"ref5","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":"ref8","first-page":"1","article-title":"iDedup: Latency-aware, inline data deduplication for primary storage","author":"srinivasan","year":"2012","journal-title":"Proc FAST"},{"journal-title":"LESS","year":"2018","author":"ruijter","key":"ref7"},{"key":"ref2","article-title":"The digital universe decade—Are you ready","author":"gantz","year":"2010","journal-title":"Proc IDC iView"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2367589.2367600"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2629508"},{"key":"ref20","first-page":"26","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 Annu Tech Conf"},{"key":"ref22","first-page":"111","article-title":"Sparse indexing: Large scale, inline deduplication using sampling and locality","author":"lillibridge","year":"2009","journal-title":"Proc FAST"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/PADSW.2014.7097802"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496992"},{"key":"ref23","first-page":"16","article-title":"ChunkStash: Speeding up inline storage deduplication using flash memory","author":"debnath","year":"2010","journal-title":"Proc USENIX Annu Tech Conf"},{"key":"ref26","first-page":"2","article-title":"Tradeoffs in scalable data routing for deduplication clusters","author":"dong","year":"2011","journal-title":"Proc FAST"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35170-9_18"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08278179.pdf?arnumber=8278179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T05:35:23Z","timestamp":1643175323000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8278179\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2800763","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}