{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T22:55:22Z","timestamp":1753052122786},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,11,22]],"date-time":"2022-11-22T00:00:00Z","timestamp":1669075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,22]],"date-time":"2022-11-22T00:00:00Z","timestamp":1669075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s11432-021-3421-6","type":"journal-article","created":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T18:20:11Z","timestamp":1669314011000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scalable local reconstruction code design for hot data reads in cloud storage systems"],"prefix":"10.1007","volume":"65","author":[{"given":"Zhikai","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Shushi","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Qinyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,22]]},"reference":[{"key":"3421_CR1","doi-asserted-by":"crossref","unstructured":"Ananthanarayanan G, Agarwal S, Kandula S, et al. Scarlett: coping with skewed content popularity in MapReduce cluster. In: Proceedings of ACM SIGOPS\/EuroSys European Conference Computer Systems, 2011. 287\u2013300","DOI":"10.1145\/1966445.1966472"},{"key":"3421_CR2","doi-asserted-by":"publisher","first-page":"018101","DOI":"10.1007\/s11432-016-9078-0","volume":"61","author":"X Y Tan","year":"2018","unstructured":"Tan X Y, Guo Y C, Chen Y S, et al. Accurate inference of user popularity preference in a large-scale online video streaming system. Sci China Inf Sci, 2018, 61: 018101","journal-title":"Sci China Inf Sci"},{"key":"3421_CR3","doi-asserted-by":"crossref","unstructured":"Andr\u00e9 F, Kermarrec A, Merrer E L, et al. Archiving cold data in warehouses with clustered network coding. In: Proceedings of ACM SIGOPS\/EuroSys European Conference Computer Systems, 2014. 1\u201314","DOI":"10.1145\/2592798.2592816"},{"key":"3421_CR4","doi-asserted-by":"crossref","unstructured":"Ghosh M, Raina A, Xu L, et al. Popular is cheaper: curtailing memory costs in interactive analytics engines. In: Proceedings of ACM SIGOPS\/EuroSys European Conference Computer Systems, 2018. 1\u201314","DOI":"10.1145\/3190508.3190542"},{"key":"3421_CR5","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1109\/TBDATA.2019.2907116","volume":"6","author":"D Hu","year":"2020","unstructured":"Hu D, Feng D, Xie Y, et al. Efficient provenance management via clustering and hybrid storage in big data environments. IEEE Trans Big Data, 2020, 6: 792\u2013803","journal-title":"IEEE Trans Big Data"},{"key":"3421_CR6","unstructured":"Balakrishnan S, Black R, Donnelly A, et al. Pelican: a building block for exascale cold data storage. In: Proceedings of USENIX Conference Operating Systems Design and Implementation, 2014. 351\u2013365"},{"key":"3421_CR7","unstructured":"Schroeder B, Gibson G A. Disk failures in the real world: what does an MTTF of 1,000,000 hours mean to you? In: Proceedings of the 5th USENIX Conference File Storage Technology, 2007. 1\u201316"},{"key":"3421_CR8","unstructured":"Ford D, Labelle F, Popovici F I, et al. Availability in globally distributed storage systems. In: Proceedings of USENIX Conference Operating Systems Design and Implementation, 2010. 61\u201374"},{"key":"3421_CR9","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.1109\/TPDS.2018.2833457","volume":"29","author":"J Fang","year":"2018","unstructured":"Fang J, Wan S, Huang P, et al. Early identification of critical blocks: making replicated distributed storage systems reliable against node failures. IEEE Trans Parallel Distrib Syst, 2018, 29: 2446\u20132459","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3421_CR10","doi-asserted-by":"crossref","unstructured":"Calder B, Wang J, Ogus A, et al. Windows azure storage: a highly available cloud storage service with strong consistency. In: Proceedings of ACM Symposium on Operating Systems Principles, 2011. 143\u2013157","DOI":"10.1145\/2043556.2043571"},{"key":"3421_CR11","doi-asserted-by":"crossref","unstructured":"Ghemawat S, Gobioff H, Leung S T. The Google file system. In: Proceedings of ACM Symposium on Operating Systems Principles, 2003. 29\u201343","DOI":"10.1145\/1165389.945450"},{"key":"3421_CR12","doi-asserted-by":"crossref","unstructured":"Abulibdeh H, Princehouse L, Weatherspoon H. RACS: a case for cloud storage diversity. In: Proceedings of the 1st ACM Symposium on Cloud Computing, 2010. 229\u2013240","DOI":"10.1145\/1807128.1807165"},{"key":"3421_CR13","unstructured":"Muralidhar S, Lloyd W, Roy S, et al. F4: Facebook\u2019s Warm BLOB storage system. In: Proceedings of USENIX Conference Operating Systems Design and Implementation, 2014. 383\u2013398"},{"key":"3421_CR14","doi-asserted-by":"publisher","first-page":"122301","DOI":"10.1007\/s11432-019-9937-7","volume":"63","author":"J Z Wang","year":"2020","unstructured":"Wang J Z, Luo Y, Shum K W. Storage and repair bandwidth tradeoff for heterogeneous cluster distributed storage systems. Sci China Inf Sci, 2020, 63: 122301","journal-title":"Sci China Inf Sci"},{"key":"3421_CR15","doi-asserted-by":"publisher","unstructured":"Zhou L Y, Zhang Z F. Explicit construction of minimum bandwidth rack-aware regenerating codes. Sci China Inf Sci, 2021. doi: https:\/\/doi.org\/10.1007\/s11432-021-3304-6","DOI":"10.1007\/s11432-021-3304-6"},{"key":"3421_CR16","doi-asserted-by":"publisher","first-page":"100301","DOI":"10.1007\/s11432-018-9482-6","volume":"61","author":"S B Balaji","year":"2018","unstructured":"Balaji S B, Krishnan M N, Vajha M, et al. Erasure coding for distributed storage: an overview. Sci China Inf Sci, 2018, 61: 100301","journal-title":"Sci China Inf Sci"},{"key":"3421_CR17","doi-asserted-by":"publisher","first-page":"100302","DOI":"10.1007\/s11432-018-9485-7","volume":"61","author":"H X Hou","year":"2018","unstructured":"Hou H X, Han Y S. A class of binary MDS array codes with asymptotically weak-optimal repair. Sci China Inf Sci, 2018, 61: 100302","journal-title":"Sci China Inf Sci"},{"key":"3421_CR18","unstructured":"Huang C, Simitci H, Xu Y K, et al. Erasure coding in windows azure storage. In: Proceedings of USENIX Annual Technical Conference, 2012. 2"},{"key":"3421_CR19","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"A G Dimakis","year":"2010","unstructured":"Dimakis A G, Godfrey P B, Wu Y, et al. Network coding for distributed storage systems. IEEE Trans Inform Theor, 2010, 56: 4539\u20134551","journal-title":"IEEE Trans Inform Theor"},{"key":"3421_CR20","doi-asserted-by":"publisher","first-page":"5271","DOI":"10.1109\/TIT.2015.2461623","volume":"61","author":"X Tang","year":"2015","unstructured":"Tang X, Yang B, Li J, et al. A new repair strategy for the Hadamard minimum storage regenerating codes for distributed storage systems. IEEE Trans Inform Theor, 2015, 61: 5271\u20135279","journal-title":"IEEE Trans Inform Theor"},{"key":"3421_CR21","doi-asserted-by":"publisher","first-page":"5779","DOI":"10.1109\/TIT.2015.2472524","volume":"61","author":"B Yang","year":"2015","unstructured":"Yang B, Tang X, Li J. A systematic piggybacking design for minimum storage regenerating codes. IEEE Trans Inform Theor, 2015, 61: 5779\u20135786","journal-title":"IEEE Trans Inform Theor"},{"key":"3421_CR22","doi-asserted-by":"publisher","first-page":"1920","DOI":"10.1109\/TIT.2015.2408600","volume":"61","author":"J Li","year":"2015","unstructured":"Li J, Tang X, Parampalli U. A framework of constructions of minimal storage regenerating codes with the optimal access\/update property. IEEE Trans Inform Theor, 2015, 61: 1920\u20131932","journal-title":"IEEE Trans Inform Theor"},{"key":"3421_CR23","doi-asserted-by":"crossref","unstructured":"Rashmi K, Shah N B, Gu D K, et al. A hitchhiker\u2019s guide to fast and efficient data reconstruction in erasure-coded data centers. In: Proceedings of ACM Conference SIGCOMM, 2014. 331\u2013342","DOI":"10.1145\/2740070.2626325"},{"key":"3421_CR24","doi-asserted-by":"publisher","first-page":"2757","DOI":"10.1109\/TPDS.2018.2842210","volume":"29","author":"Z Shen","year":"2018","unstructured":"Shen Z, Lee P P C, Shu J, et al. Encoding-aware data placement for efficient degraded reads in xor-coded storage systems: algorithms and evaluation. IEEE Trans Parallel Distrib Syst, 2018, 29: 2757\u20132770","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3421_CR25","doi-asserted-by":"publisher","first-page":"2145","DOI":"10.1109\/TC.2014.2360543","volume":"64","author":"Y Zhu","year":"2015","unstructured":"Zhu Y, Lin J, Lee P P C, et al. Boosting degraded reads in heterogeneous erasure-coded storage systems. IEEE Trans Comput, 2015, 64: 2145\u20132157","journal-title":"IEEE Trans Comput"},{"key":"3421_CR26","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1109\/TPDS.2015.2464800","volume":"27","author":"Z Shen","year":"2015","unstructured":"Shen Z, Shu J, Fu Y. HV Code: an all-around MDS code for RAID-6 storage systems. IEEE Trans Parallel Distrib Syst, 2015, 27: 1674\u20131686","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3421_CR27","doi-asserted-by":"crossref","unstructured":"Li R, Lee P P C, Hu Y. Degraded-first scheduling for map-reduce in erasure-coded storage clusters. In: Proceedings of the 44th Annual IEEE\/IFIP International Conference Dependable Systems and Networks, 2014. 419\u2013430","DOI":"10.1109\/DSN.2014.47"},{"key":"3421_CR28","unstructured":"Khan O, Burns R, Plank J S, et al. Rethinking erasure codes for cloud file systems: minimizing I\/O for recovery and degraded reads. In: Proceedings of the 10th USENIX Conference on File and Storage Technologies, 2012. 251\u2013264"},{"key":"3421_CR29","doi-asserted-by":"crossref","unstructured":"Fu Y, Shu J, Shen Z. EC-FRM: an erasure coding framework to speed up reads for erasure coded cloud storage systems. In: Proceedings of 2015 44th International Conference on Parallel Processing Workshops, 2015. 480\u2013489","DOI":"10.1109\/ICPP.2015.57"},{"key":"3421_CR30","doi-asserted-by":"publisher","first-page":"3683","DOI":"10.1109\/TNET.2017.2749879","volume":"25","author":"V Aggarwal","year":"2017","unstructured":"Aggarwal V, Chen Y F R, Lan T, et al. Sprout: a functional caching approach to minimize service latency in erasure-coded storage. IEEE\/ACM Trans Networking, 2017, 25: 3683\u20133694","journal-title":"IEEE\/ACM Trans Networking"},{"key":"3421_CR31","doi-asserted-by":"publisher","first-page":"4946","DOI":"10.1007\/s11227-019-02879-6","volume":"76","author":"X J Zhang","year":"2020","unstructured":"Zhang X J, Cai Y, Liu Y F, et al. NADE: nodes performance awareness and accurate distance evaluation for degraded read in heterogeneous distributed erasure code-based storage. J Supercomput, 2020, 76: 4946\u20134975","journal-title":"J Supercomput"},{"key":"3421_CR32","doi-asserted-by":"crossref","unstructured":"Chowdhury M, Kandula S, Stoica I. Leveraging endpoint flexibility in data-intensive clusters. In: Proceedings of ACM SIGCOMM Conference, 2013. 231\u2013242","DOI":"10.1145\/2534169.2486021"},{"key":"3421_CR33","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1109\/TPDS.2015.2410781","volume":"27","author":"M Fu","year":"2016","unstructured":"Fu M, Feng D, Hua Y, et al. Reducing fragmentation for in-line deduplication backup storage via exploiting backup history and cache knowledge. IEEE Trans Parallel Distrib Syst, 2016, 27: 855\u2013868","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3421_CR34","doi-asserted-by":"crossref","unstructured":"Li P, Jin X T, Stones R J, et al. Parallelizing degraded read for erasure coded cloud storage systems using collective communications. In: Proceedings of IEEE Trustcom\/BigDataSE\/ISPA, 2016. 1272\u20131279","DOI":"10.1109\/TrustCom.2016.0204"},{"key":"3421_CR35","doi-asserted-by":"crossref","unstructured":"Nachiappan R, Javadi B, Calheiros R N, et al. ProactiveCache: on reducing degraded read latency of erasure coded. In: Proceedings of IEEE International Conference on Cloud Computing Technology and Science (CloudCom), 2019. 223\u2013230","DOI":"10.1109\/CloudCom.2019.00041"},{"key":"3421_CR36","doi-asserted-by":"crossref","unstructured":"Shuai Q, Li V O K. Delay performance of direct reads in distributed storage systems with coding. In: Proceedings of IEEE 17th International Conference on High Performance Computing and Communication, 2015. 184\u2013189","DOI":"10.1109\/HPCC-CSS-ICESS.2015.200"},{"key":"3421_CR37","first-page":"2822","volume":"63","author":"K Lee","year":"2017","unstructured":"Lee K, Shah N B, Huang L, et al. The MDS queue: analysing the latency performance of erasure codes. IEEE Trans Inform Theor, 2017, 63: 2822\u20132842","journal-title":"IEEE Trans Inform Theor"},{"key":"3421_CR38","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1109\/TCC.2017.2785396","volume":"9","author":"Y Hu","year":"2021","unstructured":"Hu Y, Liu Y, Li W, et al. Unequal failure protection coding technique for distributed cloud storage systems. IEEE Trans Cloud Comput, 2021, 9: 386\u2013400","journal-title":"IEEE Trans Cloud Comput"},{"key":"3421_CR39","doi-asserted-by":"publisher","first-page":"13350","DOI":"10.1109\/ACCESS.2018.2801265","volume":"6","author":"B Wei","year":"2018","unstructured":"Wei B, Xiao L M, Wei W, et al. A new adaptive coding selection method for distributed storage systems. IEEE Access, 2018, 6: 13350\u201313357","journal-title":"IEEE Access"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3421-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-021-3421-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3421-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T21:24:10Z","timestamp":1704403450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-021-3421-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,22]]},"references-count":39,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["3421"],"URL":"https:\/\/doi.org\/10.1007\/s11432-021-3421-6","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,22]]},"assertion":[{"value":"19 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"222303"}}