{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T11:53:13Z","timestamp":1769169193821,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2019R1F1A1059795"],"award-info":[{"award-number":["2019R1F1A1059795"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3452780","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:30Z","timestamp":1624036950000},"page":"951-963","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Boosting Graph Similarity Search through Pre-Computation"],"prefix":"10.1145","author":[{"given":"Jongik","family":"Kim","sequence":"first","affiliation":[{"name":"Jeonbuk National University, Jeonju, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5220\/0005209202710278"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2430553.2430557"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00179-7"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00074"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247574"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.06.014"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.07.015"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2736754.2736796"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2015.02.004"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498246"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2018.10.003"},{"key":"e_1_3_2_2_12_1","volume-title":"HGED: A Hybrid Search Algorithm for Efficient Parallel Graph Edit Distance Computation","author":"Kim Jongik","year":"2020","unstructured":"Jongik Kim . 2020 . HGED: A Hybrid Search Algorithm for Efficient Parallel Graph Edit Distance Computation . IEEE Access , Vol . 8 (Sept. 2020), 175776--175787. Jongik Kim. 2020. HGED: A Hybrid Search Algorithm for Efficient Parallel Graph Edit Distance Computation. IEEE Access , Vol. 8 (Sept. 2020), 175776--175787."},{"key":"e_1_3_2_2_13_1","volume-title":"Proceedings of the 22nd International Conference on Extending Database Technology (EDBT '19)","author":"Kim Jongik","year":"2019","unstructured":"Jongik Kim , Dong-Hoon Choi , and Chen Li . 2019 . Inves: Incremental Partitioning-Based Verification for Graph Similarity Search . In Proceedings of the 22nd International Conference on Extending Database Technology (EDBT '19) . 229--240. Jongik Kim, Dong-Hoon Choi, and Chen Li. 2019. Inves: Incremental Partitioning-Based Verification for Graph Similarity Search. In Proceedings of the 22nd International Conference on Extending Database Technology (EDBT '19). 229--240."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498238"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1982185.1982509"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49055-7_43"},{"key":"e_1_3_2_2_17_1","unstructured":"SSPR '16). 485--495.  SSPR '16). 485--495."},{"key":"e_1_3_2_2_18_1","first-page":"3","article-title":"Pass-Join","volume":"5","author":"Li Guoliang","year":"2011","unstructured":"Guoliang Li , Dong Deng , Jiannan Wang , and Jianhua Feng . 2011 . Pass-Join : A Partition-Based Method for Similarity Joins. Proc. VLDB Endow. , Vol. 5 , 3 (Nov. 2011), 253--264. Guoliang Li, Dong Deng, Jiannan Wang, and Jianhua Feng. 2011. Pass-Join: A Partition-Based Method for Similarity Joins. Proc. VLDB Endow. , Vol. 5, 3 (Nov. 2011), 253--264.","journal-title":"A Partition-Based Method for Similarity Joins. Proc. VLDB Endow."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.129"},{"key":"e_1_3_2_2_20_1","volume-title":"Proceedings of the 2011 International Conference on Document Analysis and Recognition. 99--103","author":"Liu Li","unstructured":"Li Liu , Yue Lu , and Ching Y. Suen . 2011. Retrieval of Envelope Images Using Graph Matching . In Proceedings of the 2011 International Conference on Document Analysis and Recognition. 99--103 . Li Liu, Yue Lu, and Ching Y. Suen. 2011. Retrieval of Envelope Images Using Graph Matching. In Proceedings of the 2011 International Conference on Document Analysis and Recognition. 99--103."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11527923_20"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2012.2230186"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.11.002"},{"key":"e_1_3_2_2_25_1","volume-title":"Proceedings of the Mining and Learning with Graphs (MLG '07)","author":"Riesen Kaspar","year":"2007","unstructured":"Kaspar Riesen , Stefan Fankhauser , and Horst Bunke . 2007 . Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic . In Proceedings of the Mining and Learning with Graphs (MLG '07) . Kaspar Riesen, Stefan Fankhauser, and Horst Bunke. 2007. Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic. In Proceedings of the Mining and Learning with Graphs (MLG '07)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2015.06.005"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807264"},{"key":"e_1_3_2_2_29_1","first-page":"2","article-title":"SAGA: a subgraph matching tool for biological graphs","volume":"23","author":"Tian Yuanyuan","year":"2006","unstructured":"Yuanyuan Tian , Richard C. McEachin , Carlos Santos , David J. States , and Jignesh M. Patel . 2006 . SAGA: a subgraph matching tool for biological graphs . Bioinformatics , Vol. 23 , 2 (Nov. 2006), 232--239. Yuanyuan Tian, Richard C. McEachin, Carlos Santos, David J. States, and Jignesh M. Patel. 2006. SAGA: a subgraph matching tool for biological graphs . Bioinformatics , Vol. 23, 2 (Nov. 2006), 232--239.","journal-title":"Bioinformatics"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.28"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.28"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063899"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920843"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCICA.2016.7578355"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732236"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.91"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0306-1"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0487-0"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505723"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349924"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213896"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452780","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3452780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:05Z","timestamp":1750195685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":42,"alternative-id":["10.1145\/3448016.3452780","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3452780","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}