{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T14:24:15Z","timestamp":1780410255863,"version":"3.54.1"},"reference-count":56,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.future.2026.108562","type":"journal-article","created":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T15:23:28Z","timestamp":1777476208000},"page":"108562","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["HALO: A scalable framework for hotness-aware coding and transformation-efficient placement"],"prefix":"10.1016","volume":"183","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6702-2763","authenticated-orcid":false,"given":"Junmei","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ne","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiquan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.future.2026.108562_b1","series-title":"Storj: The fastest cloud storage and compute","author":"Storj","year":"2025"},{"key":"10.1016\/j.future.2026.108562_b2","series-title":"Cloudflare stream: Video streaming made easy and affordable","author":"Cloudflare","year":"2025"},{"key":"10.1016\/j.future.2026.108562_b3","series-title":"Veeam backup & replication","author":"Veeam Software","year":"2025"},{"key":"10.1016\/j.future.2026.108562_b4","series-title":"Camber: Cloud-based platform for scientific computing","author":"Camber","year":"2025"},{"key":"10.1016\/j.future.2026.108562_b5","series-title":"AIS data-driven maritime monitoring based on transformer: A comprehensive review","author":"Xie","year":"2025"},{"issue":"14","key":"10.1016\/j.future.2026.108562_b6","doi-asserted-by":"crossref","first-page":"5879","DOI":"10.3390\/su16145879","article-title":"The application of machine learning and deep learning in intelligent transportation: a scientometric analysis and qualitative review of research trends","volume":"16","author":"Zhang","year":"2024","journal-title":"Sustainability"},{"issue":"8","key":"10.1016\/j.future.2026.108562_b7","doi-asserted-by":"crossref","first-page":"3383","DOI":"10.3390\/su17083383","article-title":"Dynamic traffic flow optimization using reinforcement learning and predictive analytics: A sustainable approach to improving urban mobility in the city of Belgrade","volume":"17","author":"Skoropad","year":"2025","journal-title":"Sustainability"},{"key":"10.1016\/j.future.2026.108562_b8","series-title":"Shipping traffic through the arctic ocean: spatial distribution, temporal evolution and its dependence on the sea ice extent","author":"Rodr\u00edguez-Garc\u00eda","year":"2024"},{"key":"10.1016\/j.future.2026.108562_b9","series-title":"Data integrity vs. inference accuracy in large AIS datasets","author":"Kiersztyn","year":"2025"},{"issue":"4","key":"10.1016\/j.future.2026.108562_b10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3626198","article-title":"Practical design considerations for wide locally recoverable codes (LRCs)","volume":"19","author":"Kadekodi","year":"2023","journal-title":"ACM Trans. Storage"},{"key":"10.1016\/j.future.2026.108562_b11","unstructured":"S. Muralidhar, et al., F4: Facebook\u2019s Warm BLOB Storage System, in: Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation, OSDI, 2014, pp. 383\u2013398."},{"key":"10.1016\/j.future.2026.108562_b12","unstructured":"C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, S. Yekhanin, Azure\u2019s Erasure Coding in Practice: Reducing Storage Overhead While Maintaining Availability, in: Proceedings of the USENIX Annual Technical Conference, ATC, 2012, pp. 15\u201326."},{"key":"10.1016\/j.future.2026.108562_b13","unstructured":"F.H. Murphy, D.A. Hutchison, A. Cidon, K.V. Rashmi, D. Borthakur, A. Vasudevan, C. Maciocco, J. Blankenhorn, M. Hochschild, J. Li, A. Merchant, Erasure Coding in Cold Storage at Google, in: Proceedings of the 21st USENIX Conference on File and Storage Technologies, FAST, 2023."},{"key":"10.1016\/j.future.2026.108562_b14","unstructured":"Z. Zheng, L. Zhang, X. Wang, DAFTL: Predictive I\/O Behavior-Aware Compression for SSDs, in: Proc. of USENIX FAST, 2024."},{"key":"10.1016\/j.future.2026.108562_b15","unstructured":"F. Yang, M. Annavaram, M. Monchiero, Leopard: Efficient Read-Write Hotness Aware Cache Management, in: Proc. USENIX ATC, 2018."},{"issue":"2","key":"10.1016\/j.future.2026.108562_b16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3572779","article-title":"An in-depth comparative analysis of cloud block storage workloads: Findings and implications","volume":"19","author":"Li","year":"2023","journal-title":"ACM Trans. Storage"},{"key":"10.1016\/j.future.2026.108562_b17","unstructured":"P. Fan, Z. Yang, P. Zuo, C. Wang, Y. Zhang, Designing Non-uniform Locally Repairable Codes for Wide Stripes under Skewed File Accesses, in: Proc. ACM ICPP, 2024."},{"key":"10.1016\/j.future.2026.108562_b18","series-title":"2020 International Symposium on Reliable Distributed Systems","first-page":"246","article-title":"Enabling I\/O-efficient redundancy transitioning in erasure-coded KV stores via elastic reed-solomon codes","author":"Wu","year":"2020"},{"issue":"3","key":"10.1016\/j.future.2026.108562_b19","doi-asserted-by":"crossref","first-page":"4747","DOI":"10.1109\/JIOT.2023.3299574","article-title":"Advanced elastic reed\u2013solomon codes for erasure-coded key\u2013Value stores","volume":"11","author":"Chen","year":"2023","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.future.2026.108562_b20","doi-asserted-by":"crossref","unstructured":"T. Kim, S. Athlur, S. Kadekodi, F. Maturana, D. Delvira, A. Merchant, G.R. Ganger, K.V. Rashmi, Morph: Efficient File-Lifetime Redundancy Management for Cluster File Systems, in: Proceedings of the ACM SIGOPS 30th Symposium on Operating Systems Principles, SOSP\u201924, 2024, pp. 1\u201317.","DOI":"10.1145\/3694715.3695981"},{"key":"10.1016\/j.future.2026.108562_b21","series-title":"IEEE ICDCS","article-title":"StripeMerge: Efficient wide-stripe generation for large-scale erasure-coded storage","author":"Yao","year":"2021"},{"issue":"7","key":"10.1016\/j.future.2026.108562_b22","doi-asserted-by":"crossref","first-page":"4392","DOI":"10.1109\/TIT.2022.3155972","article-title":"Convertible codes: Enabling efficient conversion of coded data in distributed storage","volume":"68","author":"Maturana","year":"2022","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"10.1016\/j.future.2026.108562_b23","doi-asserted-by":"crossref","first-page":"4993","DOI":"10.1109\/TIT.2023.3265512","article-title":"Bandwidth cost of code conversions in distributed storage: Fundamental limits and optimal constructions","volume":"69","author":"Maturana","year":"2023","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.future.2026.108562_b24","series-title":"IEEE INFOCOM 2014-IEEE Conference on Computer Communications","first-page":"826","article-title":"TOFEC: Achieving optimal throughput-delay trade-off of cloud storage using erasure codes","author":"Liang","year":"2014"},{"key":"10.1016\/j.future.2026.108562_b25","unstructured":"Y. Ren, Y. Ren, X. Li, Y. Hu, J. Li, P.P.C. Lee, ELECT: Enabling Erasure Coding Tiering for LSM-tree-based Storage, in: 22nd USENIX Conference on File and Storage Technologies, FAST 24, 2024, pp. 293\u2013310."},{"key":"10.1016\/j.future.2026.108562_b26","series-title":"New wide locally recoverable codes with unified locality","author":"Xu","year":"2025"},{"key":"10.1016\/j.future.2026.108562_b27","doi-asserted-by":"crossref","unstructured":"Z. Wang, H. Wang, A. Shao, D. Wang, An Adaptive Erasure-Coded Storage Scheme with an Efficient Code-Switching Algorithm, in: 49th International Conference on Parallel Processing-ICPP, 2020, pp. 1\u201311.","DOI":"10.1145\/3404397.3404420"},{"key":"10.1016\/j.future.2026.108562_b28","doi-asserted-by":"crossref","unstructured":"J. Li, B. Li, Zebra: Demand-aware erasure coding for distributed storage systems, in: 2016 IEEE\/ACM 24th International Symposium on Quality of Service, IWQoS, 2016, pp. 1\u201310.","DOI":"10.1109\/IWQoS.2016.7590388"},{"key":"10.1016\/j.future.2026.108562_b29","doi-asserted-by":"crossref","unstructured":"Z. Zhang, L. Zhou, Rack-Aware Regenerating Codes with Fewer Helper Racks, in: 2021 IEEE International Symposium on Information Theory, ISIT, 2021, pp. 2203\u20132207.","DOI":"10.1109\/ISIT45174.2021.9517934"},{"issue":"10","key":"10.1016\/j.future.2026.108562_b30","doi-asserted-by":"crossref","first-page":"8635","DOI":"10.1109\/TCOMM.2025.3582724","article-title":"Explicit constructions of rack-aware regenerating codes for multi-node failures","volume":"73","author":"Yu","year":"2025","journal-title":"IEEE Trans. Commun."},{"issue":"8","key":"10.1016\/j.future.2026.108562_b31","doi-asserted-by":"crossref","first-page":"2251","DOI":"10.1109\/TPDS.2023.3282180","article-title":"Boosting erasure-coded multi-stripe repair in rack architecture and heterogeneous clusters: Design and analysis","volume":"34","author":"Zhou","year":"2023","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"10.1016\/j.future.2026.108562_b32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3436890","article-title":"Repair pipelining for erasure-coded storage: Algorithms and evaluation","volume":"17","author":"Li","year":"2021","journal-title":"ACM Trans. Storage (TOS)"},{"key":"10.1016\/j.future.2026.108562_b33","doi-asserted-by":"crossref","unstructured":"G. Gong, Z. Shen, S. Wu, X. Li, P.P.C. Lee, Optimal Rack-Coordinated Updates in Erasure-Coded Data Centers, in: IEEE INFOCOM 2021 - IEEE Conference on Computer Communications, 2021, pp. 1\u201310.","DOI":"10.1109\/INFOCOM42981.2021.9488813"},{"key":"10.1016\/j.future.2026.108562_b34","doi-asserted-by":"crossref","unstructured":"R. Jia, H. Deng, Y. Gu, H. Xue, C. Wu, S. Li, J. Li, G. Xue, M. Guo, GRPU: An Efficient Graph-based Cross-Rack Parallel Update Scheme for Cloud Storage Systems, in: 2022 IEEE 40th International Conference on Computer Design, ICCD, 2022, pp. 154\u2013161.","DOI":"10.1109\/ICCD56317.2022.00032"},{"key":"10.1016\/j.future.2026.108562_b35","doi-asserted-by":"crossref","unstructured":"S.A. Weil, S.A. Brandt, E.L. Miller, C. Maltzahn, CRUSH: Controlled, scalable, decentralized placement of replicated data, in: Proceedings of the 2006 ACM\/IEEE Conference on Supercomputing, 2006, pp. 122\u2013es.","DOI":"10.1145\/1188455.1188582"},{"key":"10.1016\/j.future.2026.108562_b36","unstructured":"S. Muralidhar, W. Lloyd, S. Roy, C. Hill, E. Lin, W. Liu, S. Pan, S. Shankar, V. Sivakumar, L. Tang, et al., f4: Facebook\u2019s warm {BLOB} storage system, in: 11th USENIX Symposium on Operating Systems Design and Implementation, OSDI 14, 2014, pp. 383\u2013398."},{"issue":"1","key":"10.1016\/j.future.2026.108562_b37","first-page":"56","article-title":"Optimal repair-scaling trade-off in locally repairable codes: Analysis and evaluation","volume":"33","author":"Wu","year":"2021","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.future.2026.108562_b38","unstructured":"C. Gan, Y. Hu, L. Zhao, X. Zhao, P. Gong, D. Feng, Revisiting network coding for warm blob storage, in: 23rd USENIX Conference on File and Storage Technologies, FAST 25, 2025, pp. 139\u2013154."},{"key":"10.1016\/j.future.2026.108562_b39","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2023.109954","article-title":"A comprehensive repair scheme for distributed storage systems","volume":"235","author":"Chen","year":"2023","journal-title":"Comput. Netw."},{"key":"10.1016\/j.future.2026.108562_b40","unstructured":"J. Gao, J. Shu, B. Yan, Y. Zhang, K. Huang, Stripeless Data Placement for Erasure-Coded In-Memory Storage, in: 19th USENIX Symposium on Operating Systems Design and Implementation, OSDI 25, 2025, pp. 821\u2013838."},{"key":"10.1016\/j.future.2026.108562_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2022.108441","article-title":"Efficient erasure-coded data updates based on file class predictions and hybrid writes","volume":"104","author":"Wei","year":"2022","journal-title":"Comput. Electr. Eng."},{"issue":"2","key":"10.1016\/j.future.2026.108562_b42","first-page":"1","article-title":"Cognitive erasure-coded data update and repair for mitigating I\/O overhead","volume":"86","author":"Wei","year":"2025","journal-title":"Comput. Mater. Contin."},{"key":"10.1016\/j.future.2026.108562_b43","article-title":"Extremely-compressed SSDs with IO behavior prediction","author":"Zhang","year":"2024","journal-title":"TOS"},{"key":"10.1016\/j.future.2026.108562_b44","doi-asserted-by":"crossref","unstructured":"Z. Shi, X. Huang, A. Jain, C. Lin, Applying deep learning to the cache replacement problem, in: Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture, 2019, pp. 413\u2013425.","DOI":"10.1145\/3352460.3358319"},{"key":"10.1016\/j.future.2026.108562_b45","unstructured":"D.L.-K. Wong, H. Wu, C. Molder, S. Gunasekar, J. Lu, S. Khandkar, A. Sharma, D.S. Berger, N. Beckmann, G.R. Ganger, Baleen: ML admission & prefetching for flash caches, in: 22nd USENIX Conference on File and Storage Technologies, FAST 24, 2024, pp. 347\u2013371."},{"key":"10.1016\/j.future.2026.108562_b46","unstructured":"J. Yang, Z. Mao, Y. Yue, K. Rashmi, GL-Cache: Group-level learning for efficient and high-performance caching, in: 21st USENIX Conference on File and Storage Technologies, FAST 23, 2023, pp. 115\u2013134."},{"key":"10.1016\/j.future.2026.108562_b47","series-title":"Microsoft research cambridge storage system traces","author":"Microsoft Research Cambridge","year":"2007"},{"key":"10.1016\/j.future.2026.108562_b48","series-title":"Alibaba cluster trace program","author":"Alibaba Group","year":"2018"},{"issue":"9","key":"10.1016\/j.future.2026.108562_b49","first-page":"995","article-title":"A tutorial on reed\u2013solomon coding for fault-tolerance in RAID-like systems","volume":"27","author":"Plank","year":"1997","journal-title":"Softw.: Pr. Exp."},{"key":"10.1016\/j.future.2026.108562_b50","series-title":"Management of data replication for PC cluster-based cloud storage system","author":"Myint","year":"2011"},{"key":"10.1016\/j.future.2026.108562_b51","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2019.106708","article-title":"A data-assisted reliability model for carrier-assisted cold data storage systems","volume":"196","author":"Arslan","year":"2020","journal-title":"Reliab. Eng. Syst. Saf."},{"issue":"3","key":"10.1016\/j.future.2026.108562_b52","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/TCC.2017.2659728","article-title":"Cost optimization for dynamic replication and migration of data in cloud data centers","volume":"7","author":"Mansouri","year":"2019","journal-title":"IEEE Trans. Cloud Comput."},{"issue":"7","key":"10.1016\/j.future.2026.108562_b53","doi-asserted-by":"crossref","first-page":"4316","DOI":"10.1109\/TCOMM.2022.3175826","article-title":"Rack-aware regenerating codes with multiple erasure tolerance","volume":"70","author":"Zhou","year":"2022","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.future.2026.108562_b54","series-title":"Learning forward reuse distance","author":"Li","year":"2020"},{"issue":"10","key":"10.1016\/j.future.2026.108562_b55","doi-asserted-by":"crossref","first-page":"9973","DOI":"10.1109\/TKDE.2023.3269771","article-title":"Spatio-temporal dynamic graph relation learning for urban metro flow prediction","volume":"35","author":"Xie","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"10.1016\/j.future.2026.108562_b56","doi-asserted-by":"crossref","first-page":"6828","DOI":"10.1109\/TKDE.2024.3409737","article-title":"Popularity prediction via modeling temporal dependencies on dynamic evolution process","volume":"36","author":"Bao","year":"2024","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X26001962?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X26001962?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:46:30Z","timestamp":1780407990000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X26001962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":56,"alternative-id":["S0167739X26001962"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2026.108562","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"HALO: A scalable framework for hotness-aware coding and transformation-efficient placement","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.future.2026.108562","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"108562"}}