{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T03:20:01Z","timestamp":1783567201454,"version":"3.55.0"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"13","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:p>Traditional cost-based optimizers are efficient and stable to generate optimal plans for simple SQL queries, but they may not generate high-quality plans for complicated queries. Thus learning-based optimizers have been proposed recently that can learn high-quality plans based on past experiences. However, learning-based optimizers cannot work well for dynamic workloads that have different distributions with training examples.<\/jats:p>\n          <jats:p>In this paper, we propose a hybrid optimizer that adopts the advantages and avoids the shortcomings of these two types of optimizers, which first generates high-quality candidate plans from each type of optimizers and then selects the best plan from the candidates. There are two challenges. (1) How to generate high-quality candidates? We propose a hint-based candidate generation method that leverages the learning-based method to generate highly beneficial hints and then uses a cost-based method to supplement the hints to generate complete plans as candidates. (2) How to evaluate different candidate plans and select the best one? We propose an uncertainty-based optimal plan selection model, which predicts the execution time and the uncertainty for each plan. The uncertainty reflects the confidence of the execution time prediction. We select the plan using the uncertainty model. Experiment results on real datasets showed that our method outperformed the state-of-the-art baselines, and reduced the total latency by 25% and the tail latency by 65% compared to PostgreSQL.<\/jats:p>","DOI":"10.14778\/3565838.3565846","type":"journal-article","created":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T23:09:56Z","timestamp":1674256196000},"page":"3924-3936","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["Cost-Based or Learning-Based?"],"prefix":"10.14778","volume":"15","author":[{"given":"Xiang","family":"Yu","sequence":"first","affiliation":[{"name":"Tsinghua University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengliang","family":"Chai","sequence":"additional","affiliation":[{"name":"Tsinghua University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guoliang","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiabin","family":"Liu","sequence":"additional","affiliation":[{"name":"Tsinghua University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,1,20]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2022. pg_hint_plan. https:\/\/pghintplan.osdn.jp\/pg_hint_plan.html.  2022. pg_hint_plan. https:\/\/pghintplan.osdn.jp\/pg_hint_plan.html."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Brian Babcock and Surajit Chaudhuri. 2005. Towards a Robust Query Optimizer: A Principled and Practical Approach. In SIGMOD. ACM 119--130.  Brian Babcock and Surajit Chaudhuri. 2005. Towards a Robust Query Optimizer: A Principled and Practical Approach. In SIGMOD. ACM 119--130.","DOI":"10.1145\/1066157.1066172"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3523210.3523223"},{"key":"e_1_2_1_5_1","volume-title":"Data management for machine learning: A survey","author":"Chai Chengliang","year":"2022","unstructured":"Chengliang Chai , Jiayi Wang , Yuyu Luo , Zeping Niu , and Guoliang Li. 2022. Data management for machine learning: A survey . IEEE Transactions on Knowledge and Data Engineering ( 2022 ). Chengliang Chai, Jiayi Wang, Yuyu Luo, Zeping Niu, and Guoliang Li. 2022. Data management for machine learning: A survey. IEEE Transactions on Knowledge and Data Engineering (2022)."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137633"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397235"},{"key":"e_1_2_1_8_1","volume-title":"Taylor","author":"da Silva Felipe Leno","year":"2020","unstructured":"Felipe Leno da Silva , Pablo Hernandez-Leal , Bilal Kartal , and Matthew E . Taylor . 2020 . Uncertainty-Aware Action Advising for Deep Reinforcement Learning Agents. In AAAI. AAAI Press , 5792--5799. Felipe Leno da Silva, Pablo Hernandez-Leal, Bilal Kartal, and Matthew E. Taylor. 2020. Uncertainty-Aware Action Advising for Deep Reinforcement Learning Agents. In AAAI. AAAI Press, 5792--5799."},{"key":"e_1_2_1_9_1","volume-title":"RW-Tree: A Learned Workload-aware Framework for R-tree Construction. In ICDE 2022","author":"Dong Haowen","year":"2022","unstructured":"Haowen Dong , Chengliang Chai , Yuyu Luo , Jiabin Liu , Jianhua Feng , and Chaoqun Zhan . 2022 . RW-Tree: A Learned Workload-aware Framework for R-tree Construction. In ICDE 2022 . IEEE, 2073--2085. Haowen Dong, Chengliang Chai, Yuyu Luo, Jiabin Liu, Jianhua Feng, and Chaoqun Zhan. 2022. RW-Tree: A Learned Workload-aware Framework for R-tree Construction. In ICDE 2022. IEEE, 2073--2085."},{"key":"e_1_2_1_10_1","volume-title":"ICML","volume":"48","author":"Gal Yarin","year":"2016","unstructured":"Yarin Gal and Zoubin Ghahramani . 2016 . Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learning . In ICML , Vol. 48 . JMLR.org, 1050--1059. Yarin Gal and Zoubin Ghahramani. 2016. Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learning. In ICML, Vol. 48. JMLR.org, 1050--1059."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-019-00115-y"},{"key":"e_1_2_1_12_1","volume-title":"IDA 2021 (Lecture Notes in Computer Science)","author":"Ghoshal Biraja","unstructured":"Biraja Ghoshal and Allan Tucker . 2021. Hyperspherical Weight Uncertainty in Neural Networks . In IDA 2021 (Lecture Notes in Computer Science) , Vol. 12695 . Springer , 3--11. Biraja Ghoshal and Allan Tucker. 2021. Hyperspherical Weight Uncertainty in Neural Networks. In IDA 2021 (Lecture Notes in Computer Science), Vol. 12695. Springer, 3--11."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00217"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384349"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-021-05946-3"},{"key":"e_1_2_1_16_1","volume-title":"Jasper Snoek","author":"Yaniv Ovadia","year":"2019","unstructured":"Yaniv Ovadia et al. Jasper Snoek . 2019 . Can you trust your model's uncertainty? Evaluating predictive uncertainty under dataset shift. In NeurIPS. 13969--13980. Yaniv Ovadia et al. Jasper Snoek. 2019. Can you trust your model's uncertainty? Evaluating predictive uncertainty under dataset shift. In NeurIPS. 13969--13980."},{"key":"e_1_2_1_17_1","volume-title":"Uncertainty-Aware Reinforcement Learning for Collision Avoidance. CoRR abs\/1702.01182","author":"Kahn Gregory","year":"2017","unstructured":"Gregory Kahn , Adam Villaflor , Vitchyr Pong , Pieter Abbeel , and Sergey Levine . 2017. Uncertainty-Aware Reinforcement Learning for Collision Avoidance. CoRR abs\/1702.01182 ( 2017 ). Gregory Kahn, Adam Villaflor, Vitchyr Pong, Pieter Abbeel, and Sergey Levine. 2017. Uncertainty-Aware Reinforcement Learning for Collision Avoidance. CoRR abs\/1702.01182 (2017)."},{"key":"e_1_2_1_18_1","unstructured":"Alex Kendall and Yarin Gal. 2017. What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?. In NIPS. 5574--5584.  Alex Kendall and Yarin Gal. 2017. What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?. In NIPS. 5574--5584."},{"key":"e_1_2_1_19_1","volume-title":"Learned Cardinalities: Estimating Correlated Joins with Deep Learning. In CIDR. www.cidrdb.org.","author":"Kipf Andreas","year":"2019","unstructured":"Andreas Kipf , Thomas Kipf , Bernhard Radke , Viktor Leis , Peter A. Boncz , and Alfons Kemper . 2019 . Learned Cardinalities: Estimating Correlated Joins with Deep Learning. In CIDR. www.cidrdb.org. Andreas Kipf, Thomas Kipf, Bernhard Radke, Viktor Leis, Peter A. Boncz, and Alfons Kemper. 2019. Learned Cardinalities: Estimating Correlated Joins with Deep Learning. In CIDR. www.cidrdb.org."},{"key":"e_1_2_1_20_1","volume-title":"The Case for Learned Index Structures. In SIGMOD Conference","author":"Kraska Tim","year":"2018","unstructured":"Tim Kraska , Alex Beutel , Ed H. Chi , Jeffrey Dean , and Neoklis Polyzotis . 2018 . The Case for Learned Index Structures. In SIGMOD Conference 2018. ACM, 489--504. Tim Kraska, Alex Beutel, Ed H. Chi, Jeffrey Dean, and Neoklis Polyzotis. 2018. The Case for Learned Index Structures. In SIGMOD Conference 2018. ACM, 489--504."},{"key":"e_1_2_1_21_1","volume-title":"Learning to Optimize Join Queries With Deep Reinforcement Learning. CoRR abs\/1808.03196","author":"Krishnan Sanjay","year":"2018","unstructured":"Sanjay Krishnan , Zongheng Yang , Ken Goldberg , Joseph M. Hellerstein , and Ion Stoica . 2018. Learning to Optimize Join Queries With Deep Reinforcement Learning. CoRR abs\/1808.03196 ( 2018 ). Sanjay Krishnan, Zongheng Yang, Ken Goldberg, Joseph M. Hellerstein, and Ion Stoica. 2018. Learning to Optimize Join Queries With Deep Reinforcement Learning. CoRR abs\/1808.03196 (2018)."},{"key":"e_1_2_1_22_1","unstructured":"Balaji Lakshminarayanan Alexander Pritzel and Charles Blundell. 2017. Simple and Scalable Predictive Uncertainty Estimation using Deep Ensembles. In NIPS. 6402--6413.  Balaji Lakshminarayanan Alexander Pritzel and Charles Blundell. 2017. Simple and Scalable Predictive Uncertainty Estimation using Deep Ensembles. In NIPS. 6402--6413."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850594"},{"key":"e_1_2_1_24_1","first-page":"70","article-title":"XuanYuan: An AI-Native Database","volume":"42","author":"Li Guoliang","year":"2019","unstructured":"Guoliang Li , Xuanhe Zhou , and Sihao Li . 2019 . XuanYuan: An AI-Native Database . IEEE Data Eng. Bull. 42 , 2 (2019), 70 -- 81 . Guoliang Li, Xuanhe Zhou, and Sihao Li. 2019. XuanYuan: An AI-Native Database. IEEE Data Eng. Bull. 42, 2 (2019), 70--81.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352129"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476311.3476380"},{"key":"e_1_2_1_27_1","volume-title":"Feature Augmentation with Reinforcement Learning. In ICDE 2022","author":"Liu Jiabin","year":"2022","unstructured":"Jiabin Liu , Chengliang Chai , Yuyu Luo , Yin Lou , Jianhua Feng , and Nan Tang . 2022 . Feature Augmentation with Reinforcement Learning. In ICDE 2022 , Kuala Lumpur, Malaysia, May 9--12 , 2022. IEEE, 3360--3372. Jiabin Liu, Chengliang Chai, Yuyu Luo, Yin Lou, Jianhua Feng, and Nan Tang. 2022. Feature Augmentation with Reinforcement Learning. In ICDE 2022, Kuala Lumpur, Malaysia, May 9--12, 2022. IEEE, 3360--3372."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476254"},{"key":"e_1_2_1_29_1","volume-title":"Bao: Making Learned Query Optimization Practical. In SIGMOD. ACM, 1275--1288.","author":"Marcus Ryan","year":"2021","unstructured":"Ryan Marcus , Parimarjan Negi , Hongzi Mao , Nesime Tatbul , Mohammad Alizadeh , and Tim Kraska . 2021 . Bao: Making Learned Query Optimization Practical. In SIGMOD. ACM, 1275--1288. Ryan Marcus, Parimarjan Negi, Hongzi Mao, Nesime Tatbul, Mohammad Alizadeh, and Tim Kraska. 2021. Bao: Making Learned Query Optimization Practical. In SIGMOD. ACM, 1275--1288."},{"key":"e_1_2_1_30_1","first-page":"1","article-title":"Deep Reinforcement Learning for Join Order Enumeration. In aiDM@SIGMOD 2018","volume":"3","author":"Marcus Ryan","year":"2018","unstructured":"Ryan Marcus and Olga Papaemmanouil . 2018 . Deep Reinforcement Learning for Join Order Enumeration. In aiDM@SIGMOD 2018 . ACM , 3 : 1 -- 3 :4. Ryan Marcus and Olga Papaemmanouil. 2018. Deep Reinforcement Learning for Join Order Enumeration. In aiDM@SIGMOD 2018. ACM, 3:1--3:4.","journal-title":"ACM"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342644"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342646"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1994.374138"},{"key":"e_1_2_1_34_1","volume-title":"Lohman","author":"Ono Kiyoshi","year":"1990","unstructured":"Kiyoshi Ono and Guy M . Lohman . 1990 . Measuring the Complexity of Join Enumeration in Query Optimization. In VLDB. Morgan Kaufmann , 314--325. Kiyoshi Ono and Guy M. Lohman. 1990. Measuring the Complexity of Join Enumeration in Query Optimization. In VLDB. Morgan Kaufmann, 314--325."},{"key":"e_1_2_1_35_1","unstructured":"Ian Osband Charles Blundell Alexander Pritzel and Benjamin Van Roy. 2016. Deep Exploration via Bootstrapped DQN. In NIPS. 4026--4034.  Ian Osband Charles Blundell Alexander Pritzel and Benjamin Van Roy. 2016. Deep Exploration via Bootstrapped DQN. In NIPS. 4026--4034."},{"key":"e_1_2_1_36_1","volume-title":"Deep bayesian bandits showdown: An empirical comparison of bayesian deep networks for thompson sampling. arXiv preprint arXiv:1802.09127","author":"Riquelme Carlos","year":"2018","unstructured":"Carlos Riquelme , George Tucker , and Jasper Snoek . 2018. Deep bayesian bandits showdown: An empirical comparison of bayesian deep networks for thompson sampling. arXiv preprint arXiv:1802.09127 ( 2018 ). Carlos Riquelme, George Tucker, and Jasper Snoek. 2018. Deep bayesian bandits showdown: An empirical comparison of bayesian deep networks for thompson sampling. arXiv preprint arXiv:1802.09127 (2018)."},{"key":"e_1_2_1_37_1","volume-title":"Price","author":"Selinger Patricia G.","year":"1979","unstructured":"Patricia G. Selinger , Morton M. Astrahan , Donald D. Chamberlin , Raymond A. Lorie , and Thomas G . Price . 1979 . Access Path Selection in a Relational Database Management System. In SIGMOD. ACM , 23--34. Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Raymond A. Lorie, and Thomas G. Price. 1979. Access Path Selection in a Relational Database Management System. In SIGMOD. ACM, 23--34."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368296"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3485450.3485459"},{"key":"e_1_2_1_40_1","volume-title":"Improved semantic representations from tree-structured long short-term memory networks. arXiv preprint arXiv:1503.00075","author":"Tai Kai Sheng","year":"2015","unstructured":"Kai Sheng Tai , Richard Socher , and Christopher D Manning . 2015. Improved semantic representations from tree-structured long short-term memory networks. arXiv preprint arXiv:1503.00075 ( 2015 ). Kai Sheng Tai, Richard Socher, and Christopher D Manning. 2015. Improved semantic representations from tree-structured long short-term memory networks. arXiv preprint arXiv:1503.00075 (2015)."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-020-00117-1"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3464389"},{"key":"e_1_2_1_43_1","volume-title":"BNCOD","volume":"1832","author":"Waas Florian","year":"2000","unstructured":"Florian Waas and Arjan Pellenkoft . 2000 . Join Order Selection - Good Enough Is Easy . In BNCOD , Vol. 1832 . Springer, 51--67. Florian Waas and Arjan Pellenkoft. 2000. Join Order Selection - Good Enough Is Easy. In BNCOD, Vol. 1832. Springer, 51--67."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3485450.3485458"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/3561261.3561267"},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the ACM Web Conference 2022. 1807","author":"Wu Ruofan","year":"2022","unstructured":"Ruofan Wu , Feng Zhang , Jiawei Guan , Zhen Zheng , Xiaoyong Du , and Xipeng Shen . 2022 . DREW: Efficient Winograd CNN Inference with Deep Reuse . In Proceedings of the ACM Web Conference 2022. 1807 --1816. Ruofan Wu, Feng Zhang, Jiawei Guan, Zhen Zheng, Xiaoyong Du, and Xipeng Shen. 2022. DREW: Efficient Winograd CNN Inference with Deep Reuse. In Proceedings of the ACM Web Conference 2022. 1807--1816."},{"key":"e_1_2_1_47_1","volume-title":"ICML","volume":"139","author":"Wu Yue","year":"2021","unstructured":"Yue Wu , Shuangfei Zhai , Nitish Srivastava , Joshua M. Susskind , Jian Zhang , Ruslan Salakhutdinov , and Hanlin Goh . 2021 . Uncertainty Weighted Actor-Critic for Offline Reinforcement Learning . In ICML , Vol. 139 . PMLR, 11319--11328. Yue Wu, Shuangfei Zhai, Nitish Srivastava, Joshua M. Susskind, Jian Zhang, Ruslan Salakhutdinov, and Hanlin Goh. 2021. Uncertainty Weighted Actor-Critic for Offline Reinforcement Learning. In ICML, Vol. 139. PMLR, 11319--11328."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368294"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3421424.3421432"},{"key":"e_1_2_1_50_1","volume-title":"Reinforcement Learning with Tree-LSTM for Join Order Selection","author":"Yu Xiang","unstructured":"Xiang Yu , Guoliang Li , Chengliang Chai , and Nan Tang . 2020. Reinforcement Learning with Tree-LSTM for Join Order Selection . In ICDE. IEEE , 1297--1308. Xiang Yu, Guoliang Li, Chengliang Chai, and Nan Tang. 2020. Reinforcement Learning with Tree-LSTM for Join Order Selection. In ICDE. IEEE, 1297--1308."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00133"},{"key":"e_1_2_1_52_1","first-page":"459","article-title":"POCLib: A high-performance framework for enabling near orthogonal processing on compression","volume":"33","author":"Zhang Feng","year":"2022","unstructured":"Feng Zhang , Jidong Zhai , Xipeng Shen , Onur Mutlu , and Xiaoyong Du . 2022 . POCLib: A high-performance framework for enabling near orthogonal processing on compression . IEEE TPDS 33 , 2 (2022), 459 -- 475 . Feng Zhang, Jidong Zhai, Xipeng Shen, Onur Mutlu, and Xiaoyong Du. 2022. POCLib: A high-performance framework for enabling near orthogonal processing on compression. IEEE TPDS 33, 2 (2022), 459--475.","journal-title":"IEEE TPDS"},{"key":"e_1_2_1_53_1","volume-title":"VLDB (CEUR Workshop Proceedings)","volume":"2652","author":"Zhang Ji","year":"2020","unstructured":"Ji Zhang . 2020 . AlphaJoin: Join Order Selection \u00e0 la AlphaGo . In VLDB (CEUR Workshop Proceedings) , Vol. 2652 . CEUR-WS.org. Ji Zhang. 2020. AlphaJoin: Join Order Selection \u00e0 la AlphaGo. In VLDB (CEUR Workshop Proceedings), Vol. 2652. CEUR-WS.org."},{"key":"e_1_2_1_54_1","volume-title":"SIGMOD Conference","author":"Zhang Lixi","year":"2022","unstructured":"Lixi Zhang , Chengliang Chai , Xuanhe Zhou , and Guoliang Li . 2022 . Learned-SQLGen: Constraint-aware SQL Generation using Reinforcement Learning . In SIGMOD Conference 2022. ACM, 945--958. Lixi Zhang, Chengliang Chai, Xuanhe Zhou, and Guoliang Li. 2022. Learned-SQLGen: Constraint-aware SQL Generation using Reinforcement Learning. In SIGMOD Conference 2022. ACM, 945--958."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2994641"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.14778\/3485450.3485456"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3565838.3565846","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T23:14:32Z","timestamp":1674256472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3565838.3565846"}},"subtitle":["A Hybrid Query Optimizer for Query Plan Selection"],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":56,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["10.14778\/3565838.3565846"],"URL":"https:\/\/doi.org\/10.14778\/3565838.3565846","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,9]]},"assertion":[{"value":"2023-01-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}