{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,14]],"date-time":"2026-11-14T00:48:12Z","timestamp":1794617292178,"version":"4.9.1"},"reference-count":75,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["652976"],"award-info":[{"award-number":["652976"]}]},{"name":"Royal Society Wolfson Research Merit Award","award":["WRM\/R1\/180014"],"award-info":[{"award-number":["WRM\/R1\/180014"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2022,6,30]]},"abstract":"<jats:p>\n            The incremental problem for a class\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\( {\\mathcal {Q}} \\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            of graph queries aims to compute, given a query\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\( Q \\in {\\mathcal {Q}} \\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            , graph\n            <jats:italic>G<\/jats:italic>\n            , answers\n            <jats:italic>Q<\/jats:italic>\n            (\n            <jats:italic>G<\/jats:italic>\n            ) to\n            <jats:italic>Q<\/jats:italic>\n            in\n            <jats:italic>G<\/jats:italic>\n            and updates\n            <jats:italic>\u0394G<\/jats:italic>\n            to\n            <jats:italic>G<\/jats:italic>\n            as input, changes\n            <jats:italic>\u0394O<\/jats:italic>\n            to output\n            <jats:italic>Q<\/jats:italic>\n            (\n            <jats:italic>G<\/jats:italic>\n            ) such that\n            <jats:italic>Q<\/jats:italic>\n            (\n            <jats:italic>G<\/jats:italic>\n            \u2295\n            <jats:italic>\u0394G<\/jats:italic>\n            ) =\n            <jats:italic>Q<\/jats:italic>\n            (\n            <jats:italic>G<\/jats:italic>\n            )\u2295\n            <jats:italic>\u0394O<\/jats:italic>\n            . It is called\n            <jats:italic>bounded<\/jats:italic>\n            if its cost can be expressed as a polynomial function in the sizes of\n            <jats:italic>Q<\/jats:italic>\n            ,\n            <jats:italic>\u0394G<\/jats:italic>\n            and\n            <jats:italic>\u0394O<\/jats:italic>\n            , which reduces the computations on possibly big\n            <jats:italic>G<\/jats:italic>\n            to small\n            <jats:italic>\u0394G<\/jats:italic>\n            and\n            <jats:italic>\u0394O<\/jats:italic>\n            . No matter how desirable, however, our first results are negative: For common graph queries such as traversal, connectivity, keyword search, pattern matching, and maximum cardinality matching, their incremental problems are unbounded.\n          <\/jats:p>\n          <jats:p>\n            In light of the negative results, we propose two characterizations for the effectiveness of incremental graph computation: (a)\n            <jats:italic>localizable<\/jats:italic>\n            , if its cost is decided by small neighbors of nodes in\n            <jats:italic>\u0394G<\/jats:italic>\n            instead of the entire\n            <jats:italic>G<\/jats:italic>\n            ; and (b)\n            <jats:italic>bounded relative to<\/jats:italic>\n            a batch graph algorithm\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\( {\\mathcal {T}} \\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            , if the cost is determined by the sizes of\n            <jats:italic>\u0394G<\/jats:italic>\n            and changes to the affected area that is necessarily checked by any algorithms that incrementalize\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\( {\\mathcal {T}} \\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            . We show that the incremental computations above are either localizable or relatively bounded by providing corresponding incremental algorithms. That is, we can either reduce the incremental computations on big graphs to small data, or incrementalize existing batch graph algorithms by minimizing unnecessary recomputation. Using real-life and synthetic data, we experimentally verify the effectiveness of our incremental algorithms.\n          <\/jats:p>","DOI":"10.1145\/3500930","type":"journal-article","created":{"date-parts":[[2022,3,10]],"date-time":"2022-03-10T22:03:03Z","timestamp":1646949783000},"page":"1-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Incremental Graph Computations: Doable and Undoable"],"prefix":"10.1145","volume":"47","author":[{"given":"Wenfei","family":"Fan","sequence":"first","affiliation":[{"name":"University of Edinburgh &amp; Shenzhen Institute of Computing Sciences &amp; Beihang University, Edinburgh, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9670-367X","authenticated-orcid":false,"given":"Chao","family":"Tian","sequence":"additional","affiliation":[{"name":"Institute of Software, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,5,23]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"DBpedia Association. 2014. DBpedia. Retrieved from http:\/\/wiki.dbpedia.org\/Downloads2014."},{"key":"e_1_3_1_3_2","unstructured":"Retrieved from http:\/\/snap.stanford.edu\/data\/index.html 2016 SNAP"},{"key":"e_1_3_1_4_2","unstructured":"Retrieved from 2020 GraphScope"},{"key":"e_1_3_1_5_2","unstructured":"Retrieved from 2020 Size of Wikipedia"},{"key":"e_1_3_1_6_2","unstructured":"Retrieved from 2021 MovieLens"},{"key":"e_1_3_1_7_2","volume-title":"VLDB","author":"Abiteboul Serge","year":"1998","unstructured":"Serge Abiteboul, Jason McHugh, Michael Rys, Vasilis Vassalos, and Janet L. Wiener. 1998. Incremental maintenance for materialized views over semistructured data. In VLDB."},{"key":"e_1_3_1_8_2","unstructured":"Umut A. Acar. 2005. Self-adjusting Computation . Ph. D. Dissertation. CMU."},{"key":"e_1_3_1_9_2","volume-title":"POPL","author":"Acar Umut A.","year":"2002","unstructured":"Umut A. Acar, Guy E. Blelloch, and Robert Harper. 2002. Adaptive functional programming. In POPL."},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00182-4"},{"key":"e_1_3_1_11_2","article-title":"Practice of streaming processing of dynamic graphs: Concepts, models, and systems","author":"Besta Maciej","year":"2019","unstructured":"Maciej Besta, Marc Fischer, Vasiliki Kalavri, Michael Kapralov, and Torsten Hoefler. 2019. Practice of streaming processing of dynamic graphs: Concepts, models, and systems. arXiv preprint arXiv:1912.12740 (2019).","journal-title":"arXiv preprint arXiv:1912.12740"},{"key":"e_1_3_1_12_2","volume-title":"ICDE","author":"Bhalotia Gaurav","year":"2002","unstructured":"Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, Soumen Chakrabarti, and S. Sudarshan. 2002. Keyword searching and browsing in databases using BANKS. In ICDE."},{"key":"e_1_3_1_13_2","volume-title":"SOCC","author":"Bhatotia Pramod","year":"2011","unstructured":"Pramod Bhatotia, Alexander Wieder, Rodrigo Rodrigues, Umut A. Acar, and Rafael Pasquin. 2011. Incoop: MapReduce for incremental computations. In SOCC."},{"key":"e_1_3_1_14_2","unstructured":"Pramod Kumar Bhatotia. 2015. Incremental Parallel and Distributed Systems . Ph. D. Dissertation. Saarland University."},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.2200\/S00873ED1V01Y201808DTM051"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2508020.2508021"},{"key":"e_1_3_1_17_2","volume-title":"WWW","author":"Bramandia Ramadhana","year":"2008","unstructured":"Ramadhana Bramandia, Byron Choi, and Wee Keong Ng. 2008. On incremental maintenance of 2-hop labeling of graphs. In WWW."},{"key":"e_1_3_1_18_2","volume-title":"An NSA Big Graph experiment","author":"Burkhardt Paul","year":"2013","unstructured":"Paul Burkhardt and Chris Waring. 2013. An NSA Big Graph experiment. Technical Report NSA-RD-2013-056002v1. U.S. National Security Agency."},{"key":"e_1_3_1_19_2","volume-title":"VLDB","author":"Ceri Stefano","year":"1991","unstructured":"Stefano Ceri and Jennifer Widom. 1991. Deriving production rules for incremental view maintenance. In VLDB."},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1561\/1900000020"},{"key":"e_1_3_1_21_2","volume-title":"SIGMOD","author":"Colby Latha S.","year":"1996","unstructured":"Latha S. Colby, Timothy Griffin, Leonid Libkin, Inderpal Singh Mumick, and Howard Trickey. 1996. Algorithms for deferred view maintenance. In SIGMOD."},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00540-5"},{"key":"e_1_3_1_24_2","volume-title":"Algorithms and Theory of Computation Handbook","author":"Demetrescu Camil","year":"2010","unstructured":"Camil Demetrescu, David Eppstein, Zvi Galil, and Giuseppe F. Italiano. 2010. Dynamic graph algorithms. In Algorithms and Theory of Computation Handbook. Chapman & Hall\/CRC."},{"key":"e_1_3_1_25_2","volume-title":"ICLR","author":"Errica Federico","year":"2020","unstructured":"Federico Errica, Marco Podda, Davide Bacciu, and Alessio Micheli. 2020. A fair comparison of graph neural networks for graph classification. In ICLR."},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824056"},{"key":"e_1_3_1_27_2","volume-title":"SIGMOD","author":"Fan Wenfei","year":"2017","unstructured":"Wenfei Fan, Chunming Hu, and Chao Tian. 2017. Incremental graph computations: Doable and undoable. In SIGMOD."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389142"},{"key":"e_1_3_1_29_2","volume-title":"SIGMOD","author":"Fan Wenfei","year":"2018","unstructured":"Wenfei Fan, Xueli Liu, Ping Lu, and Chao Tian. 2018. Catching numeric inconsistencies in graphs. In SIGMOD."},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.14778\/3457390.3457400"},{"key":"e_1_3_1_31_2","volume-title":"SIGMOD","author":"Fan Wenfei","year":"2021","unstructured":"Wenfei Fan, Chao Tian, Qiang Yin, Ruiqi Xu, Wenyuan Yu, and Jingren Zhou. 2021. Incrementalizing graph algorithms. In SIGMOD."},{"issue":"3","key":"e_1_3_1_32_2","first-page":"18:1\u201318:47","article-title":"Incremental graph pattern matching","volume":"38","author":"Fan Wenfei","year":"2013","unstructured":"Wenfei Fan, Xin Wang, and Yinghui Wu. 2013. Incremental graph pattern matching. ACM Trans. Datab. Syst. 38, 3 (2013), 18:1\u201318:47.","journal-title":"ACM Trans. Datab. Syst."},{"key":"e_1_3_1_33_2","volume-title":"SIGMOD","author":"Fan Wenfei","year":"2014","unstructured":"Wenfei Fan, Xin Wang, and Yinghui Wu. 2014. Querying big graphs within bounded resources. In SIGMOD."},{"key":"e_1_3_1_34_2","volume-title":"SIGMOD","author":"Fan Wenfei","year":"2017","unstructured":"Wenfei Fan, Jingbo Xu, Yinghui Wu, Jiaxin Jiang, Yang Cao, Chao Tian, Wenyuan Yu, Bohan Zhang, and Zeyu Zheng. 2017. Parallelizing sequential graph computations. In SIGMOD."},{"key":"e_1_3_1_35_2","article-title":"RisGraph: A real-time streaming system for evolving graphs","volume":"2004","author":"Feng Guanyu","year":"2020","unstructured":"Guanyu Feng, Zixuan Ma, Daixuan Li, Xiaowei Zhu, Yanzheng Cai, Wentao Han, and Wenguang Chen. 2020. RisGraph: A real-time streaming system for evolving graphs. CoRR abs\/2004.00803 (2020).","journal-title":"CoRR"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_1_37_2","volume-title":"USEWOD workshop","author":"Gallego Mario Arias","year":"2011","unstructured":"Mario Arias Gallego, Javier D. Fern\u00e1ndez, Miguel A. Mart\u00ednez-Prieto, and Pablo de la Fuente. 2011. An empirical study of real-world SPARQL queries. In USEWOD workshop."},{"key":"e_1_3_1_38_2","volume-title":"ICT Innovations","author":"Grujic Ivana","year":"2014","unstructured":"Ivana Grujic, Sanja Bogdanovic-Dinic, and Leonid Stoimenov. 2014. Collecting and analyzing data from E-Government Facebook pages. In ICT Innovations."},{"key":"e_1_3_1_39_2","volume-title":"EDBT","author":"Gupta Ashish","year":"1996","unstructured":"Ashish Gupta, H. V. Jagadish, and Inderpal Singh Mumick. 1996. Data integration using self-maintainable views. In EDBT."},{"key":"e_1_3_1_40_2","volume-title":"SIGMOD","author":"Gupta Ashish","year":"1993","unstructured":"Ashish Gupta, Inderpal Singh Mumick, and V. S. Subrahmanian. 1993. Maintaining views incrementally. In SIGMOD."},{"issue":"1","key":"e_1_3_1_41_2","first-page":"3:1\u20133:33","article-title":"Incremental cycle detection, topological ordering, and strong component maintenance","volume":"8","author":"Haeupler Bernhard","year":"2012","unstructured":"Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, and Robert Endre Tarjan. 2012. Incremental cycle detection, topological ordering, and strong component maintenance. ACM Trans. Algor. 8, 1 (2012), 3:1\u20133:33.","journal-title":"ACM Trans. Algor."},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/369275.369284"},{"key":"e_1_3_1_43_2","volume-title":"SIGMOD","author":"He Hao","year":"2007","unstructured":"Hao He, Haixun Wang, Jun Yang, and Philip S. Yu. 2007. BLINKS: Ranked keyword searches on graphs. In SIGMOD."},{"key":"e_1_3_1_44_2","volume-title":"ICALP","author":"Henzinger Monika Rauch","year":"1997","unstructured":"Monika Rauch Henzinger and Valerie King. 1997. Maintaining minimum spanning trees in dynamic graphs. In ICALP."},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1748"},{"key":"e_1_3_1_47_2","volume-title":"VLDB","author":"Kacholia Varun","year":"2005","unstructured":"Varun Kacholia, Shashank Pandit, Soumen Chakrabarti, S. Sudarshan, Rushi Desai, and Hrishikesh Karambelkar. 2005. Bidirectional expansion for keyword search on graph databases. In VLDB."},{"key":"e_1_3_1_48_2","volume-title":"SIGMOD","author":"Katsis Yannis","year":"2015","unstructured":"Yannis Katsis, Kian Win Ong, Yannis Papakonstantinou, and Kevin Keliang Zhao. 2015. Utilizing IDs to accelerate incremental view maintenance. In SIGMOD."},{"key":"e_1_3_1_49_2","volume-title":"Vision Image and Signal Processing","author":"Kropatsch Walter","year":"1996","unstructured":"Walter Kropatsch. 1996. Building irregular pyramids by dual-graph contraction. In Vision Image and Signal Processing. Institute of Electrical Engineers."},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023607406540"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/69.729731"},{"issue":"3","key":"e_1_3_1_52_2","first-page":"27:1\u201327:15","article-title":"Improved deterministic algorithms for decremental reachability and strongly connected components","volume":"9","author":"Lacki Jakub","year":"2013","unstructured":"Jakub Lacki. 2013. Improved deterministic algorithms for decremental reachability and strongly connected components. ACM Trans. Algor. 9, 3 (2013), 27:1\u201327:15.","journal-title":"ACM Trans. Algor."},{"key":"e_1_3_1_53_2","volume-title":"ICDE","author":"Larson Per-Ake","year":"2007","unstructured":"Per-Ake Larson and Jingren Zhou. 2007. Efficient maintenance of materialized outer-join views. In ICDE."},{"key":"e_1_3_1_54_2","volume-title":"ICML","author":"Loukas Andreas","year":"2018","unstructured":"Andreas Loukas and Pierre Vandergheynst. 2018. Spectrally approximating large graphs with smaller graphs. In ICML."},{"key":"e_1_3_1_55_2","volume-title":"SIGMOD","author":"Malewicz Grzegorz","year":"2010","unstructured":"Grzegorz Malewicz, Matthew H. Austern, Aart J. C. Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010. Pregel: A system for large-scale graph processing. In SIGMOD."},{"key":"e_1_3_1_56_2","volume-title":"EuroSys","author":"Mariappan Mugilan","year":"2019","unstructured":"Mugilan Mariappan and Keval Vora. 2019. GraphBolt: Dependency-Driven synchronous processing of streaming graphs. In EuroSys."},{"key":"e_1_3_1_57_2","volume-title":"CIDR","author":"McSherry Frank","year":"2013","unstructured":"Frank McSherry, Derek Gordon Murray, Rebecca Isaacs, and Michael Isard. 2013. Differential dataflow. In CIDR."},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"key":"e_1_3_1_59_2","volume-title":"Computational Complexity","author":"Papadimitriou Christos H.","year":"1994","unstructured":"Christos H. Papadimitriou. 1994. Computational Complexity. Addison-Wesley."},{"key":"e_1_3_1_60_2","volume-title":"POPL","author":"Pugh William","year":"1989","unstructured":"William Pugh and Tim Teitelbaum. 1989. Incremental computation via function caching. In POPL."},{"key":"e_1_3_1_61_2","volume-title":"SIGMOD","author":"Qin Lu","year":"2014","unstructured":"Lu Qin, Jeffrey Xu Yu, Lijun Chang, Hong Cheng, Chengqi Zhang, and Xuemin Lin. 2014. Scalable big graph processing in MapReduce. In SIGMOD."},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00079-8"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0046"},{"key":"e_1_3_1_64_2","volume-title":"STOC","author":"Roditty Liam","year":"2004","unstructured":"Liam Roditty and Uri Zwick. 2004. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In STOC."},{"key":"e_1_3_1_65_2","volume-title":"FSTTCS","author":"Saha Diptikalyan","year":"2007","unstructured":"Diptikalyan Saha. 2007. An incremental bisimulation algorithm. In FSTTCS."},{"key":"e_1_3_1_66_2","volume-title":"The Algorithm Design Manual","author":"Skiena Steven S.","year":"2012","unstructured":"Steven S. Skiena. 2012. Sorting and searching. In The Algorithm Design Manual. Springer."},{"key":"e_1_3_1_67_2","volume-title":"FUSION","author":"Stotz A.","year":"2009","unstructured":"A. Stotz, R. Nagi, and M. Sudit. 2009. Incremental graph matching for situation awareness. In FUSION."},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_3_1_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/358746.358755"},{"key":"e_1_3_1_70_2","volume-title":"ASPLOS","author":"Vora Keval","year":"2017","unstructured":"Keval Vora, Rajiv Gupta, and Guoqing (Harry) Xu. 2017. KickStarter: Fast and accurate computations on streaming graphs via trimmed approximations. In ASPLOS."},{"key":"e_1_3_1_71_2","doi-asserted-by":"publisher","DOI":"10.1145\/2206869.2206879"},{"issue":"1","key":"e_1_3_1_72_2","first-page":"67","article-title":"Keyword search in relational databases: A survey","volume":"33","author":"Yu Jeffrey Xu","year":"2010","unstructured":"Jeffrey Xu Yu, Lu Qin, and Lijun Chang. 2010. Keyword search in relational databases: A survey. IEEE Data Eng. Bull. 33, 1 (2010), 67\u201378.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_3_1_73_2","volume-title":"SIGMOD","author":"Zhang Yikai","year":"2019","unstructured":"Yikai Zhang and Jeffrey Xu Yu. 2019. Unboundedness and efficiency of truss maintenance in evolving graphs. In SIGMOD."},{"key":"e_1_3_1_74_2","volume-title":"IJCAI","author":"Zheng Li","year":"2019","unstructured":"Li Zheng, Zhenpeng Li, Jian Li, Zhao Li, and Jun Gao. 2019. AddGraph: Anomaly detection in dynamic graph using attention-based temporal GCN. In IJCAI."},{"key":"e_1_3_1_75_2","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352127"},{"key":"e_1_3_1_76_2","volume-title":"ICDE","author":"Zhuge Yue","year":"1998","unstructured":"Yue Zhuge and Hector Garcia-Molina. 1998. Graph structured views and their incremental maintenance. In ICDE."}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3500930","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3500930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:40Z","timestamp":1750182580000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3500930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,23]]},"references-count":75,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6,30]]}},"alternative-id":["10.1145\/3500930"],"URL":"https:\/\/doi.org\/10.1145\/3500930","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,23]]},"assertion":[{"value":"2021-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-05-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}