{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T23:03:51Z","timestamp":1762211031763,"version":"3.41.0"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,11,15]],"date-time":"2022-11-15T00:00:00Z","timestamp":1668470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["807\/20"],"award-info":[{"award-number":["807\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2022,11,30]]},"abstract":"<jats:p>Deduplication reduces the size of the data stored in large-scale storage systems by replacing duplicate data blocks with references to their unique copies. This creates dependencies between files that contain similar content and complicates the management of data in the system. In this article, we address the problem of data migration, in which files are remapped between different volumes as a result of system expansion or maintenance. The challenge of determining which files and blocks to migrate has been studied extensively for systems without deduplication. In the context of deduplicated storage, however, only simplified migration scenarios have been considered.<\/jats:p>\n          <jats:p>In this article, we formulate the general migration problem for deduplicated systems as an optimization problem whose objective is to minimize the system\u2019s size while ensuring that the storage load is evenly distributed between the system\u2019s volumes and that the network traffic required for the migration does not exceed its allocation.<\/jats:p>\n          <jats:p>\n            We then present three algorithms for generating effective migration plans, each based on a different approach and representing a different trade-off between computation time and migration efficiency. Our\n            <jats:italic>greedy algorithm<\/jats:italic>\n            provides modest space savings but is appealing thanks to its exceptionally short runtime. Its results can be improved by using larger system representations. Our\n            <jats:italic>theoretically optimal algorithm<\/jats:italic>\n            formulates the migration problem as an integer linear programming (ILP) instance. Its migration plans consistently result in smaller and more balanced systems than those of the greedy approach, although its runtime is long and, as a result, the theoretical optimum is not always found. Our\n            <jats:italic>clustering algorithm<\/jats:italic>\n            enjoys the best of both worlds: its migration plans are comparable to those generated by the ILP-based algorithm, but its runtime is shorter, sometimes by an order of magnitude. It can be further accelerated at a modest cost in the quality of its results.\n          <\/jats:p>","DOI":"10.1145\/3565025","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T11:47:08Z","timestamp":1664452028000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["The\n            <i>what<\/i>\n            , The\n            <i>from<\/i>\n            , and The\n            <i>to<\/i>\n            : The Migration Games in Deduplicated Systems"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1311-4678","authenticated-orcid":false,"given":"Roei","family":"Kisous","sequence":"first","affiliation":[{"name":"Computer Science Department, Technion, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3983-7882","authenticated-orcid":false,"given":"Ariel","family":"Kolikant","sequence":"additional","affiliation":[{"name":"Computer Science Department, Technion, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8223-5828","authenticated-orcid":false,"given":"Abhinav","family":"Duggal","sequence":"additional","affiliation":[{"name":"Dell EMC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0524-7390","authenticated-orcid":false,"given":"Sarai","family":"Sheinvald","sequence":"additional","affiliation":[{"name":"ORT Braude College of Engineering, Carmiel, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2701-0260","authenticated-orcid":false,"given":"Gala","family":"Yadgar","sequence":"additional","affiliation":[{"name":"Computer Science Department, Technion, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,11,15]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"Cluster analysis. (n.d.). Retrieved October 24 2020 from https:\/\/en.wikipedia.org\/wiki\/Cluster_analysis."},{"key":"e_1_3_1_3_2","unstructured":"CPLEX Optimizer. (n.d.). Retrieved October 24 2018 from https:\/\/www.ibm.com\/analytics\/cplex-optimizer."},{"key":"e_1_3_1_4_2","unstructured":"The Fastest Mathematical Programming Solver. (n.d.). Retrieved October 24 2018 from http:\/\/www.gurobi.com\/."},{"key":"e_1_3_1_5_2","unstructured":"GLPK (GNU Linear Programming Kit). (n.d.). Retrieved October 24 2018 from https:\/\/www.gnu.org\/software\/glpk\/."},{"key":"e_1_3_1_6_2","unstructured":"Introduction to lp_solve 5.5.2.5. (n.d.). Retrieved October 24 2018 from http:\/\/lpsolve.sourceforge.net\/5.5\/."},{"key":"e_1_3_1_7_2","unstructured":"Linux Kernel Archives. (n.d.). Retrieved October 24 2020 from https:\/\/mirrors.edge.kernel.org\/pub\/linux\/kernel\/."},{"key":"e_1_3_1_8_2","unstructured":"SNIA IOTTA Repository. (n.d.). Retrieved October 24 2018 from http:\/\/iotta.snia.org\/tracetypes\/6."},{"key":"e_1_3_1_9_2","unstructured":"Source code of migration algorithms. (n.d.). Retrieved February 22 2022 from https:\/\/github.com\/roei217\/DedupMigration."},{"key":"e_1_3_1_10_2","unstructured":"SYMPHONY development home page. (n.d.). Retrieved October 24 2018 from https:\/\/projects.coin-or.org\/SYMPHONY."},{"key":"e_1_3_1_11_2","unstructured":"Traces and Snapshots Public Archive. (n.d.). Retrieved October 24 2018 from http:\/\/tracer.filesystems.org\/."},{"key":"e_1_3_1_12_2","doi-asserted-by":"crossref","unstructured":"What is data deduplication? (n.d.). Retrieved September 17 2022 from https:\/\/www.netapp.com\/data-management\/what-is-data-deduplication\/.","DOI":"10.1016\/B978-0-12-823395-5.00015-X"},{"key":"e_1_3_1_13_2","unstructured":"2022. DELL PowerStore T STORAGE FAMILY. Retrieved September 17 2022 from https:\/\/www.delltechnologies.com\/asset\/he-il\/products\/storage\/technical-support\/dell-powerstore-3-0-spec-sheet.pdf."},{"key":"e_1_3_1_14_2","volume-title":"7th USENIX Conference on Networked Systems Design and Implementation (NSDI\u201910)","author":"Aggarwal Bhavish","year":"2010","unstructured":"Bhavish Aggarwal, Aditya Akella, Ashok Anand, Athula Balachandran, Pushkar Chitnis, Chitra Muthukrishnan, Ramachandran Ramjee, and George Varghese. 2010. EndRE: An end-system redundancy elimination service for enterprises. In 7th USENIX Conference on Networked Systems Design and Implementation (NSDI\u201910). USENIX Association, San Jose, CA, 1\u201314."},{"key":"e_1_3_1_15_2","volume-title":"2018 USENIX Annual Technical Conference (USENIX ATC\u201918)","author":"Allu Yamini","year":"2018","unstructured":"Yamini Allu, Fred Douglis, Mahesh Kamat, Ramya Prabhakar, Philip Shilane, and Rahul Ugale. 2018. Can\u2019t we all get along? Redesigning protection storage for modern workloads. In 2018 USENIX Annual Technical Conference (USENIX ATC\u201918). USENIX Association, Boston, MA, 705\u2013717."},{"key":"e_1_3_1_16_2","volume-title":"5th International Workshop on Algorithm Engineering (WAE\u201901)","author":"Anderson Eric","year":"2001","unstructured":"Eric Anderson, Joseph Hall, Jason D. Hartline, Michael Hobbs, Anna R. Karlin, Jared Saia, Ram Swaminathan, and John Wilkes. 2001. An experimental study of data migration algorithms. In 5th International Workshop on Algorithm Engineering (WAE\u201901). Springer-Verlag, Aarhus, Denmark, 145\u2013158."},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/1083323.1083341"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6847984"},{"key":"e_1_3_1_19_2","volume-title":"IEEE International Symposium on Modeling, Analysis Simulation of Computer and Telecommunication Systems (MASCOTS\u201909)","author":"Bhagwat Deepavali","year":"2009","unstructured":"Deepavali Bhagwat, Kave Eshghi, Darrell D. E. Long, and Mark Lillibridge. 2009. Extreme binning: Scalable, parallel deduplication for chunk-based file backup. In IEEE International Symposium on Modeling, Analysis Simulation of Computer and Telecommunication Systems (MASCOTS\u201909). IEEE, London, UK, 1\u20139."},{"key":"e_1_3_1_20_2","volume-title":"9th USENIX Conference on File and Storage Technologies (FAST\u201911)","author":"Chen Feng","year":"2011","unstructured":"Feng Chen, Tian Luo, and Xiaodong Zhang. 2011. CAFTL: A content-aware flash translation layer enhancing the lifespan of flash memory based solid state drives. In 9th USENIX Conference on File and Storage Technologies (FAST\u201911). USENIX Association, San Jose, CA, 1\u201314."},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.5555\/1855807.1855815"},{"key":"e_1_3_1_22_2","volume-title":"2010 USENIX Conference on USENIX Annual Technical Conference (USENIX ATC\u201910)","author":"Debnath Biplob","year":"2010","unstructured":"Biplob Debnath, Sudipta Sengupta, and Jin Li. 2010. ChunkStash: Speeding up inline storage deduplication using flash memory. In 2010 USENIX Conference on USENIX Annual Technical Conference (USENIX ATC\u201910). USENIX Association, Boston, MA, 1\u201316."},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.5555\/1960475.1960477"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.5555\/3129633.3129637"},{"key":"e_1_3_1_25_2","volume-title":"7th Conference on File and Storage Technologies (FAST\u201909)","author":"Dubnicki Cezary","year":"2009","unstructured":"Cezary Dubnicki, Leszek Gryz, Lukasz Heldt, Michal Kaczmarczyk, Wojciech Kilian, Przemyslaw Strzelczak, Jerzy Szczepkowski, Cristian Ungureanu, and Michal Welnicki. 2009. HYDRAstor: A scalable secondary storage. In 7th Conference on File and Storage Technologies (FAST\u201909). USENIX Association, San Francisco, CA, 197\u2013210."},{"key":"e_1_3_1_26_2","volume-title":"2019 USENIX Annual Technical Conference (USENIX ATC\u201919)","author":"Duggal Abhinav","year":"2019","unstructured":"Abhinav Duggal, Fani Jenkins, Philip Shilane, Ramprasad Chinthekindi, Ritesh Shah, and Mahesh Kamat. 2019. Data domain cloud tier: Backup here, backup there, deduplicated everywhere!. In 2019 USENIX Annual Technical Conference (USENIX ATC\u201919). USENIX Association, Renton, WA, 647\u2013660."},{"key":"e_1_3_1_27_2","volume-title":"2014 USENIX Annual Technical Conference (USENIX ATC\u201914)","author":"Fu Min","year":"2014","unstructured":"Min Fu, Dan Feng, Yu Hua, Xubin He, Zuoning Chen, Wen Xia, Fangting Huang, and Qing Liu. 2014. Accelerating restore and garbage collection in deduplication-based backup systems via exploiting historical information. In 2014 USENIX Annual Technical Conference (USENIX ATC\u201914). USENIX Association, Philadelphia, PA, 181\u2013192."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/1275937.1275939"},{"key":"e_1_3_1_29_2","volume-title":"Multivariate Analysis of Ecological Data","author":"Greenacre Michael","year":"2013","unstructured":"Michael Greenacre and Raul Primicerio. 2013. Multivariate Analysis of Ecological Data. Fundaci\u00f3n BBVA, Bilbao, Chapter Hierarchical Cluster Analysis."},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.5555\/2002181.2002206"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.5555\/3323298.3323309"},{"key":"e_1_3_1_32_2","volume-title":"2012 USENIX Annual Technical Conference (USENIX ATC\u201912)","author":"Huang Cheng","year":"2012","unstructured":"Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li, and Sergey Yekhanin. 2012. Erasure coding in Windows Azure storage. In 2012 USENIX Annual Technical Conference (USENIX ATC\u201912). USENIX Association, Boston, MA, 1\u201312."},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/2367589.2367600"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3565025"},{"key":"e_1_3_1_35_2","volume-title":"2014 USENIX Annual Technical Conference (USENIX ATC\u201914)","author":"Li Cheng","year":"2014","unstructured":"Cheng Li, Philip Shilane, Fred Douglis, Hyong Shim, Stephen Smaldone, and Grant Wallace. 2014. Nitro: A capacity-optimized SSD cache for primary storage. In 2014 USENIX Annual Technical Conference (USENIX ATC\u201914). USENIX Association, Philadelphia, PA, 501\u2013512."},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.5555\/2591272.2591292"},{"key":"e_1_3_1_37_2","volume-title":"7th Conference on File and Storage Technologies (FAST\u201909)","author":"Lillibridge Mark","year":"2009","unstructured":"Mark Lillibridge, Kave Eshghi, Deepavali Bhagwat, Vinay Deolalikar, Greg Trezise, and Peter Camble. 2009. Sparse indexing: Large scale, inline deduplication using sampling and locality. In 7th Conference on File and Storage Technologies (FAST\u201909). USENIX Association, San Francisco, CA, 125\u2013138."},{"key":"e_1_3_1_38_2","volume-title":"12th USENIX Conference on File and Storage Technologies (FAST\u201914)","author":"Lin Xing","year":"2014","unstructured":"Xing Lin, Guanlin Lu, Fred Douglis, Philip Shilane, and Grant Wallace. 2014. Migratory compression: Coarse-grained data reordering to improve compressibility. In 12th USENIX Conference on File and Storage Technologies (FAST\u201914). USENIX Association, Santa Clara, CA, 265\u2013273."},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.5555\/1083323.1083351"},{"key":"e_1_3_1_40_2","volume-title":"USENIX Winter 1994 Technical Conference (WTEC\u201994)","author":"Manber Udi","year":"1994","unstructured":"Udi Manber. 1994. Finding similar files in a large file system. In USENIX Winter 1994 Technical Conference (WTEC\u201994). USENIX Association, San Francisco, CA, 1\u20132."},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3211890.3211894"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.5555\/1960475.1960476"},{"key":"e_1_3_1_43_2","volume-title":"18th ACM Symposium on Operating Systems Principles (SOSP\u201901)","author":"Muthitacharoen Athicha","year":"2001","unstructured":"Athicha Muthitacharoen, Benjie Chen, and David Mazi\u00e8res. 2001. A low-bandwidth network file system. In 18th ACM Symposium on Operating Systems Principles (SOSP\u201901). Association for Computing Machinery, Banff, Canada, 174\u2013178."},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3453301"},{"key":"e_1_3_1_45_2","volume-title":"18th USENIX Conference on File and Storage Technologies (FAST\u201920)","author":"Nachman Aviv","year":"2020","unstructured":"Aviv Nachman, Gala Yadgar, and Sarai Sheinvald. 2020. GoSeed: Generating an optimal seeding plan for deduplicated storage. In 18th USENIX Conference on File and Storage Technologies (FAST\u201920). USENIX Association, Santa Clara, CA, 193\u2013207."},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/2485732.2485744"},{"key":"e_1_3_1_47_2","volume-title":"10th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201912)","author":"Nightingale Edmund B.","year":"2012","unstructured":"Edmund B. Nightingale, Jeremy Elson, Jinliang Fan, Owen Hofmann, Jon Howell, and Yutaka Suzue. 2012. Flat datacenter storage. In 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201912). USENIX Association, Hollywood, CA, 1\u201315."},{"key":"e_1_3_1_48_2","volume-title":"5th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage\u201913)","author":"Rashmi K. V.","year":"2013","unstructured":"K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, and Kannan Ramchandran. 2013. A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster. In 5th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage\u201913). USENIX Association, San Jose, CA, 1\u20135."},{"key":"e_1_3_1_49_2","volume-title":"8th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage\u201916)","author":"Shilane Philip","year":"2016","unstructured":"Philip Shilane, Ravi Chitloor, and Uday Kiran Jonnala. 2016. 99 deduplication problems. In 8th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage\u201916). USENIX Association, Denver, CO, 1\u20135."},{"key":"e_1_3_1_50_2","volume-title":"10th USENIX Conference on File and Storage Technologies (FAST\u201912)","author":"Srinivasan Kiran","year":"2012","unstructured":"Kiran Srinivasan, Tim Bisson, Garth Goodson, and Kaladhar Voruganti. 2012. iDedup: Latency-aware, inline data deduplication for primary storage. In 10th USENIX Conference on File and Storage Technologies (FAST\u201912). USENIX Association, San Jose, CA, 1\u201314."},{"key":"e_1_3_1_51_2","volume-title":"32nd Symposium on Mass Storage Systems and Technologies (MSST\u201916)","author":"Sun Zhen","year":"2016","unstructured":"Zhen Sun, Geoff Kuenning, Sonam Mandal, Philip Shilane, Vasily Tarasov, Nong Xiao, and Erez Zadok. 2016. A long-term user-centric analysis of deduplication patterns. In 32nd Symposium on Mass Storage Systems and Technologies (MSST\u201916). IEEE\/NASA Goddard, Santa Clara, CA, 1\u20137."},{"key":"e_1_3_1_52_2","volume-title":"2012 USENIX Annual Technical Conference (USENIX ATC\u201912)","author":"Tarasov Vasily","year":"2012","unstructured":"Vasily Tarasov, Amar Mudrankit, Will Buik, Philip Shilane, Geoff Kuenning, and Erez Zadok. 2012. Generating realistic datasets for deduplication analysis. In 2012 USENIX Annual Technical Conference (USENIX ATC\u201912). USENIX Association, Boston, MA, 261\u2013272."},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.5555\/2002181.2002196"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2006.19"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2014.07.016"},{"key":"e_1_3_1_56_2","volume-title":"2016 USENIX Annual Technical Conference (USENIX ATC\u201916)","author":"Xia Wen","year":"2016","unstructured":"Wen Xia, Yukun Zhou, Hong Jiang, Dan Feng, Yu Hua, Yuchong Hu, Qing Liu, and Yucheng Zhang. 2016. FastCDC: A fast and efficient content-defined chunking approach for data deduplication. In 2016 USENIX Annual Technical Conference (USENIX ATC\u201916). USENIX Association, Denver, CO, 101\u2013114."},{"key":"e_1_3_1_57_2","volume-title":"8th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage\u201916)","author":"Yan Zhichao","year":"2016","unstructured":"Zhichao Yan, Hong Jiang, Yujuan Tan, and Hao Luo. 2016. Deduplicating compressed contents in cloud storage environment. In 8th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage\u201916). USENIX Association, Denver, CO, 1\u20135."},{"key":"e_1_3_1_58_2","volume-title":"16th USENIX Conference on File and Storage Technologies (FAST\u201918)","author":"Cao Zhichao","year":"2018","unstructured":"Zhichao Cao, Hao Wen, Fenggang Wu, and David H. C. Du. 2018. ALACC: Accelerating restore performance of data deduplication systems using adaptive look-ahead Window assisted chunk caching. In 16th USENIX Conference on File and Storage Technologies (FAST\u201918). USENIX Association, Oakland, CA, 309\u2013324."},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.5555\/1364813.1364831"},{"key":"e_1_3_1_60_2","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-3-540-88908-3_14","volume-title":"Multiobjective Optimization: Interactive and Evolutionary Approaches","author":"Zitzler Eckart","year":"2008","unstructured":"Eckart Zitzler, Joshua Knowles, and Lothar Thiele. 2008. Quality assessment of Pareto set approximations. In Multiobjective Optimization: Interactive and Evolutionary Approaches, J\u00fcrgen Branke, Kalyanmoy Deb, Kaisa Miettinen, and Roman S\u0142owi\u0144ski (Eds.). Springer, Berlin,373\u2013404."}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565025","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3565025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:52Z","timestamp":1750186972000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3565025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,15]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11,30]]}},"alternative-id":["10.1145\/3565025"],"URL":"https:\/\/doi.org\/10.1145\/3565025","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"type":"print","value":"1553-3077"},{"type":"electronic","value":"1553-3093"}],"subject":[],"published":{"date-parts":[[2022,11,15]]},"assertion":[{"value":"2022-06-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-09-13","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}