{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:59:49Z","timestamp":1768521589079,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T00:00:00Z","timestamp":1642636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key R&D Program during the 13th Five-year Plan Period","award":["2018YFB1700405"],"award-info":[{"award-number":["2018YFB1700405"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11227-021-04271-9","type":"journal-article","created":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T13:04:05Z","timestamp":1642683845000},"page":"10088-10117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Thou code: a triple-erasure-correcting horizontal code with optimal update complexity"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7547-0483","authenticated-orcid":false,"given":"Ningjing","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingjun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,20]]},"reference":[{"key":"4271_CR1","doi-asserted-by":"crossref","unstructured":"Ghemawat S, Gobioff H, Leung ST (2003) The Google file system. In: Proceedings SOSP, Bolton Landing (Lake George), NY, USA, pp 29\u201343","DOI":"10.1145\/1165389.945450"},{"key":"4271_CR2","unstructured":"Weil SA, Brandt SA, Miller EL, Long DD, Maltzahn C (2006) Ceph: a scalable, high performance distributed file system. In: Proceedings OSDI, Seattle, WA, pp 307\u2013320"},{"key":"4271_CR3","first-page":"125","volume-title":"OpenStack swift using, administering, and developing for swift object storage","author":"BJ Arnold","year":"2014","unstructured":"Arnold BJ (2014) OpenStack swift using, administering, and developing for swift object storage. O\u2019Reilly Media Press, Sebastopol, pp 125\u2013150"},{"issue":"3","key":"4271_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/2421648.2421655","volume":"46","author":"G Atul","year":"2012","unstructured":"Atul G, Peter C (2012) RAID triple parity. ACM SIGOPS Oper Syst Rev 46(3):41\u201349","journal-title":"ACM SIGOPS Oper Syst Rev"},{"key":"4271_CR5","doi-asserted-by":"crossref","unstructured":"Mitra S, Panta R, Ra M-R, Bagchi S (2016) Partial-parallel-repair (PPR): a distributed technique for repairing erasure coded storage. In: Proceedings EuroSys, Imperial College London, London","DOI":"10.1145\/2901318.2901328"},{"issue":"2","key":"4271_CR6","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I Reed","year":"1960","unstructured":"Reed I, Solomon G (1960) Polynomial codes over certain finite fields. J Soc Ind Appl Math 8(2):300\u2013304","journal-title":"J Soc Ind Appl Math"},{"key":"4271_CR7","doi-asserted-by":"crossref","unstructured":"Chamazcoti SA, Miremadi SG (2014) EA-EO: endurance aware erasure code for SSD-based storage systems. In: Proceedings PRDC, Singapore, Singapore, pp 76\u201385","DOI":"10.1109\/PRDC.2014.18"},{"issue":"11","key":"4271_CR8","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1016\/j.microrel.2015.07.046","volume":"55","author":"SA Chamazcoti","year":"2015","unstructured":"Chamazcoti SA, Delavari Z, Miremadi SG, Asadi H (2015) On endurance and performance of erasure codes in SSD-based storage systems. Microelectron Reliab 55(11):2453\u20132467","journal-title":"Microelectron Reliab"},{"key":"4271_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.micpro.2016.06.003","volume":"45","author":"SA Chamazcoti","year":"2016","unstructured":"Chamazcoti SA, Miremadi SG (2016) On designing endurance aware erasure code for SSD-based storage systems. Microprocess Microsyst 45:283\u2013296","journal-title":"Microprocess Microsyst"},{"key":"4271_CR10","unstructured":"Bloemer J, Kalfane M, Karp R (1995) An XOR-based erasure-resilient coding scheme. Technical Report TR-95-048, ICSI, Berkeley, CA"},{"issue":"7","key":"4271_CR11","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1109\/TC.2007.70830","volume":"57","author":"C Huang","year":"2008","unstructured":"Huang C, Xu L (2008) STAR: an efficient coding scheme for correcting triple storage node failures. IEEE Trans Comput 57(7):889\u2013901","journal-title":"IEEE Trans Comput"},{"key":"4271_CR12","doi-asserted-by":"crossref","unstructured":"Zhang Y, Wu C, Li J, Guo M (2015) TIP-Code: a three independent parity code to tolerate triple disk failures with optimal update complextiy. In: Proceedings DSN, Univ Estadual Campinas, Rio de Janeiro, Brazil, pp 136\u2013147","DOI":"10.1109\/DSN.2015.19"},{"issue":"2","key":"4271_CR13","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/12.364531","volume":"44","author":"M Blaum","year":"1995","unstructured":"Blaum M, Brady J, Bruck J, Menon J (1995) EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures. IEEE Trans Comput 44(2):192\u2013202","journal-title":"IEEE Trans Comput"},{"key":"4271_CR14","unstructured":"Corbett P, English B, Goel A, Grcanac T, Kleiman S, Leong J, Sankar S (2004) Row-diagonal parity for double disk failure correction. In: Proceedings FAST, San Francisco, CA, pp 1\u201314"},{"issue":"1","key":"4271_CR15","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/18.746771","volume":"45","author":"M Blaum","year":"1999","unstructured":"Blaum M, Roth R (1999) On lowest density MDS codes. IEEE Trans Inf Theory 45(1):46\u201359","journal-title":"IEEE Trans Inf Theory"},{"key":"4271_CR16","unstructured":"Plank JS (2008) The RAID-6 liberation codes. In: Proceedings FAST, San Jose, CA, pp 97\u2013110"},{"issue":"3","key":"4271_CR17","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1177\/1094342009106191","volume":"23","author":"JS Plank","year":"2009","unstructured":"Plank JS (2009) The Raid-6 Liber8Tion code. Int J High Perform Comput Appl 23(3):242\u2013251","journal-title":"Int J High Perform Comput Appl"},{"issue":"1","key":"4271_CR18","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1109\/18.746809","volume":"45","author":"L Xu","year":"1999","unstructured":"Xu L, Bruck J (1999) X-code: MDS array codes with optimal encoding. IEEE Trans Inf Theory 45(1):272\u2013276","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"4271_CR19","doi-asserted-by":"publisher","first-page":"1817","DOI":"10.1109\/18.782102","volume":"45","author":"L Xu","year":"1999","unstructured":"Xu L, Bohossian V, Bruck J, Wagner D (1999) Low-density MDS codes and factors of complete graphs. IEEE Trans Inf Theory 45(6):1817\u20131826","journal-title":"IEEE Trans Inf Theory"},{"key":"4271_CR20","doi-asserted-by":"crossref","unstructured":"Wu C, Wan S, He X, Xu B, Cao Q, Xie C (2011) H-Code: A hybrid MDS array code to optimize partial stripe writes in RAID-6. In: Proceedings IPDPS, Anchorage, AK, USA, pp 782\u2013793","DOI":"10.1109\/IPDPS.2011.78"},{"key":"4271_CR21","doi-asserted-by":"crossref","unstructured":"Jin C, Jiang H, Feng D, Tian L (2009) P-code: A new RAID-6 code with optimal properties. In: Proceedings ICS, Yorktown Heights, NY, pp 360\u2013369","DOI":"10.1145\/1542275.1542326"},{"key":"4271_CR22","doi-asserted-by":"crossref","unstructured":"Shen Z, Shu J (2014) HV code: an all-around MDS code to improve efficiency and reliability of RAID-6 systems. In: Proceedings DSN, Atlanta, GA, pp 550\u2013561","DOI":"10.1109\/DSN.2014.57"},{"key":"4271_CR23","unstructured":"Ford D, Labelle F, Popovici FI, Murray S, Sean Q (2010) Availability in globally distributed file systems. In: Proceedings OSDI, Vancouver, BC, Canada, pp 61\u201374"},{"issue":"9","key":"4271_CR24","doi-asserted-by":"publisher","first-page":"1822","DOI":"10.1109\/JPROC.2017.2731776","volume":"105","author":"FT Hady","year":"2017","unstructured":"Hady FT, Foong A, Veal B, Williams D (2017) Platform storage performance with 3D XPoint technology. Proc IEEE 105(9):1822\u20131833","journal-title":"Proc IEEE"},{"key":"4271_CR25","unstructured":"Jeremy C, Edmund BN, Christopher F, Engin I, Benjamin L, Doug B, Derrick C (2009) Better I\/O through byte-addressable, persistent memory. In: Proceedings SOSP, Big Sky, MT, pp 133\u2013146"},{"key":"4271_CR26","unstructured":"Dong M, Chen H (2017) Soft updates made simple and fast on non-volatile memory. In: Proceedings ATC, Santa Clara, CA, pp 719\u2013731"},{"key":"4271_CR27","unstructured":"Yang J, Joseph I, Steven S (2019) Orion: a distributed file system for non-volatile main memory and RDMA-capable networks. In: Proceedings FAST, Boston, MA, pp 221\u2013234"},{"key":"4271_CR28","unstructured":"Xu J, Steven S (2016) NOVA: a log-structured file system for hybrid volatile\/non-volatile main memories. In: Proceedings FAST, Santa Clara, CA, pp 323\u2013338"},{"key":"4271_CR29","doi-asserted-by":"crossref","unstructured":"Xu J, Zhang L, Amirsaman M, Akshatha G, Amit B, Tamires BDS, Steven S, Andy R (2017) NOVA-fortis: a fault-tolerant non-volatile main memory file system. In: Proceedings SOSP, Shanghai, People\u2019s Republic of China, pp 478\u2013496","DOI":"10.1145\/3132747.3132761"},{"issue":"10","key":"4271_CR30","doi-asserted-by":"publisher","first-page":"6318","DOI":"10.1109\/TIT.2017.2690662","volume":"63","author":"S Goparaju","year":"2017","unstructured":"Goparaju S, Fazeli A, Vardy A (2017) Minimum storage regenerating codes for all parameters. IEEE Trans Inf Theory 63(10):6318\u20136328","journal-title":"IEEE Trans Inf Theory"},{"key":"4271_CR31","unstructured":"Plank JS, Buchsbaum AL (2007) Some classes of invertible matrices in GF(2). Technical Report CS-07-599, University of Tennessee"},{"key":"4271_CR32","unstructured":"Plank JS, Jerasure G (2014) A library in C facilitating erasure coding for storage applications\u2013version 2.0. Technical Report CS-14-721, University of Tennessee"},{"key":"4271_CR33","doi-asserted-by":"crossref","unstructured":"Narayanan D, Donnelly A, Donnelly A (2008) Write off-loading: practical power management for enterprise storage. In: Proceedings FAST, San Jose, CA, pp 253\u2013267","DOI":"10.1145\/1416944.1416949"},{"key":"4271_CR34","unstructured":"N-29\u201317: NAND flash design and use considerations introduction Micron. http:\/\/download.micron.com\/pdf\/technotes\/nand\/tn2917.pdf"},{"issue":"7","key":"4271_CR35","doi-asserted-by":"publisher","first-page":"4510","DOI":"10.1109\/TIT.2013.2252395","volume":"59","author":"M Blaum","year":"2013","unstructured":"Blaum M, Hafner JL, Hetzler S (2013) Partial-MDS codes and their application to RAID type of architectures. IEEE Trans Inf Theory 59(7):4510\u20134519","journal-title":"IEEE Trans Inf Theory"},{"key":"4271_CR36","unstructured":"Plank JS, Blaum M, Hafner JL, Codes SD (2013) Erasure codes designed for how storage systems really fail. In: Proceedings of the 11th USENIX Conference on File and Storage Technologies (FAST \u201913), pp 95\u2013104, San Jose, CA"},{"issue":"4","key":"4271_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2658991","volume":"10","author":"Mingqiang Li","year":"2014","unstructured":"Li Mingqiang, Lee Patrick PC (2014) STAIR codes: a general family of erasure codes for tolerating device and sector failures. ACM Trans Storage (TOS) 10(4):1\u201330","journal-title":"ACM Trans Storage (TOS)"},{"issue":"5","key":"4271_CR38","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1109\/TC.2019.2962691","volume":"69","author":"Mostafa Kishani","year":"2019","unstructured":"Kishani Mostafa, Ahmadian Saba, Asadi Hossein (2019) A modeling framework for reliability of erasure codes in SSD arrays. IEEE Trans Comput 69(5):649\u2013665","journal-title":"IEEE Trans Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04271-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-04271-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04271-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T15:26:52Z","timestamp":1650382012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-04271-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,20]]},"references-count":38,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["4271"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-04271-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,20]]},"assertion":[{"value":"20 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}