{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:26:05Z","timestamp":1774974365248,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Okawa Foundation for Information and Telecommunications"},{"DOI":"10.13039\/100008536","name":"Amazon Web Services","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008536","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR00112090027"],"award-info":[{"award-number":["HR00112090027"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF III-1705169, NSF CAREER Award 1741634, NSF #1937599"],"award-info":[{"award-number":["NSF III-1705169, NSF CAREER Award 1741634, NSF #1937599"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403257","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:04:00Z","timestamp":1597964640000},"page":"2062-2072","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["GHashing: Semantic Graph Hashing for Approximate Similarity Search in Graph Databases"],"prefix":"10.1145","author":[{"given":"Zongyue","family":"Qin","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Yunsheng","family":"Bai","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}]},{"given":"Yizhou","family":"Sun","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Yunsheng Bai Hao Ding Song Bian Ting Chen Yizhou Sun and Wei Wang. 2019 a. SimGNN: A Neural Network Approach to Fast Graph Similarity Computation. In WSDM.  Yunsheng Bai Hao Ding Song Bian Ting Chen Yizhou Sun and Wei Wang. 2019 a. SimGNN: A Neural Network Approach to Fast Graph Similarity Computation. In WSDM."},{"key":"e_1_3_2_1_2_1","volume-title":"Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching. AAAI","author":"Bai Yunsheng","year":"2020","unstructured":"Yunsheng Bai , Hao Ding , Ken Gu , Yizhou Sun , and Wei Wang . 2020. Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching. AAAI ( 2020 ). Yunsheng Bai, Hao Ding, Ken Gu, Yizhou Sun, and Wei Wang. 2020. Learning-based Efficient Graph Similarity Computation via Multi-Scale Convolutional Set Matching. AAAI (2020)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/275"},{"key":"e_1_3_2_1_4_1","first-page":"509","article-title":"Albert, R","volume":"286","author":"Barabasi Albert-Laszlo","year":"1999","unstructured":"Albert-Laszlo Barabasi and Reka Albert . 1999 . Albert, R .: Emergence of Scaling in Random Networks. Science 286 , 509 -- 512 . Science (New York, N.Y.), Vol. 286 (11 1999), 509--12. https:\/\/doi.org\/10.1126\/science.286.5439.509 10.1126\/science.286.5439.509 Albert-Laszlo Barabasi and Reka Albert. 1999. Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509--512. Science (New York, N.Y.), Vol. 286 (11 1999), 509--12. https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Emergence of Scaling in Random Networks. Science"},{"key":"e_1_3_2_1_5_1","first-page":"35","article-title":"What is the distance between graphs","volume":"20","author":"Bunke Horst","year":"1983","unstructured":"Horst Bunke . 1983 . What is the distance between graphs . Bulletin of the EATCS , Vol. 20 (1983), 35 -- 39 . Horst Bunke. 1983. What is the distance between graphs. Bulletin of the EATCS, Vol. 20 (1983), 35--39.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_6_1","volume-title":"A graph distance metric based on the maximal common subgraph. Pattern recognition letters","author":"Bunke Horst","year":"1998","unstructured":"Horst Bunke and Kim Shearer . 1998. A graph distance metric based on the maximal common subgraph. Pattern recognition letters , Vol. 19 , 3--4 ( 1998 ), 255--259. Horst Bunke and Kim Shearer. 1998. A graph distance metric based on the maximal common subgraph. Pattern recognition letters, Vol. 19, 3--4 (1998), 255--259."},{"key":"e_1_3_2_1_7_1","volume-title":"2019 a. Alchemy: A Quantum Chemistry Dataset for Benchmarking AI Models. arXiv preprint arXiv:1906.09427","author":"Chen Guangyong","year":"2019","unstructured":"Guangyong Chen , Pengfei Chen , Chang-Yu Hsieh , Chee-Kong Lee , Benben Liao , Renjie Liao , Weiwen Liu , Jiezhong Qiu , Qiming Sun , Jie Tang , Richard Zemel , and Shengyu Zhang . 2019 a. Alchemy: A Quantum Chemistry Dataset for Benchmarking AI Models. arXiv preprint arXiv:1906.09427 ( 2019 ). Guangyong Chen, Pengfei Chen, Chang-Yu Hsieh, Chee-Kong Lee, Benben Liao, Renjie Liao, Weiwen Liu, Jiezhong Qiu, Qiming Sun, Jie Tang, Richard Zemel, and Shengyu Zhang. 2019 a. Alchemy: A Quantum Chemistry Dataset for Benchmarking AI Models. arXiv preprint arXiv:1906.09427 (2019)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.10.002"},{"key":"e_1_3_2_1_9_1","volume-title":"Publ. Math. Debrecen","volume":"6","author":"Erd\u00f6s P\u00e0l","year":"1959","unstructured":"P\u00e0l Erd\u00f6s and A. R\u00e9nyi . 1959. On random graphs I . Publ. Math. Debrecen , Vol. 6 (01 1959 ), 290--297. P\u00e0l Erd\u00f6s and A. R\u00e9nyi. 1959. On random graphs I. Publ. Math. Debrecen, Vol. 6 (01 1959), 290--297."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning, ICML 2017","author":"Gilmer Justin","year":"2017","unstructured":"Justin Gilmer , Samuel S. Schoenholz , Patrick F. Riley , Oriol Vinyals , and George E. Dahl . 2017. Neural Message Passing for Quantum Chemistry . In Proceedings of the 34th International Conference on Machine Learning, ICML 2017 , Sydney, NSW, Australia, 6- -11 August 2017 . 1263--1272. http:\/\/proceedings.mlr.press\/v70\/gilmer17a.html Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, and George E. Dahl. 2017. Neural Message Passing for Quantum Chemistry. In Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6--11 August 2017. 1263--1272. http:\/\/proceedings.mlr.press\/v70\/gilmer17a.html"},{"key":"e_1_3_2_1_11_1","volume-title":"Inves: Incremental Partitioning-Based Verification for Graph Similarity Search. In EDBT.","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 EDBT. Jongik Kim, Dong-Hoon Choi, and Chen Li. 2019. Inves: Incremental Partitioning-Based Verification for Graph Similarity Search. In EDBT."},{"key":"e_1_3_2_1_12_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling . 2017 . Semi-Supervised Classification with Graph Convolutional Networks. In 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24--26, 2017, Conference Track Proceedings . https:\/\/openreview.net\/forum?id=SJU4ayYgl Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24--26, 2017, Conference Track Proceedings. https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"key":"e_1_3_2_1_13_1","volume-title":"2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE Computer Society","author":"Lai H.","year":"2015","unstructured":"H. Lai , Y. Pan , Ye Liu , and S. Yan . 2015. Simultaneous feature learning and hash coding with deep neural networks . In 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE Computer Society , Los Alamitos, CA, USA, 3270--3278. https:\/\/doi.org\/10.1109\/CVPR. 2015 .7298947 10.1109\/CVPR.2015.7298947 H. Lai, Y. Pan, Ye Liu, and S. Yan. 2015. Simultaneous feature learning and hash coding with deep neural networks. In 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE Computer Society, Los Alamitos, CA, USA, 3270--3278. https:\/\/doi.org\/10.1109\/CVPR.2015.7298947"},{"key":"e_1_3_2_1_14_1","unstructured":"Yujia Li Chengcun Gu Thomas Dullien Oriol Vinyals and Pushmeet Kohli. 2019. Graph Matching Networks for Learning the Similarity of Graph Structured Objects. In ICML.  Yujia Li Chengcun Gu Thomas Dullien Oriol Vinyals and Pushmeet Kohli. 2019. Graph Matching Networks for Learning the Similarity of Graph Structured Objects. In ICML."},{"key":"e_1_3_2_1_15_1","volume-title":"An Efficient Probabilistic Approach for Graph Similarity Search. 2018 IEEE 34th International Conference on Data Engineering (ICDE)","author":"Li Zijian","year":"2017","unstructured":"Zijian Li , Xun Jian , Xiang Lian , and Lei Chen . 2017 . An Efficient Probabilistic Approach for Graph Similarity Search. 2018 IEEE 34th International Conference on Data Engineering (ICDE) (2017), 533--544. Zijian Li, Xun Jian, Xiang Lian, and Lei Chen. 2017. An Efficient Probabilistic Approach for Graph Similarity Search. 2018 IEEE 34th International Conference on Data Engineering (ICDE) (2017), 533--544."},{"key":"e_1_3_2_1_16_1","volume-title":"Similarity Search in Graph Databases: A Multi-Layered Indexing Approach. In 33rd IEEE International Conference on Data Engineering, ICDE 2017","author":"Liang Yongjiang","year":"2017","unstructured":"Yongjiang Liang and Peixiang Zhao . 2017 . Similarity Search in Graph Databases: A Multi-Layered Indexing Approach. In 33rd IEEE International Conference on Data Engineering, ICDE 2017 , San Diego, CA, USA, April 19--22 , 2017. 783--794. https:\/\/doi.org\/10.1109\/ICDE.2017.129 10.1109\/ICDE.2017.129 Yongjiang Liang and Peixiang Zhao. 2017. Similarity Search in Graph Databases: A Multi-Layered Indexing Approach. In 33rd IEEE International Conference on Data Engineering, ICDE 2017, San Diego, CA, USA, April 19--22, 2017. 783--794. https:\/\/doi.org\/10.1109\/ICDE.2017.129"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-019-01174-4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"e_1_3_2_1_19_1","volume-title":"MLG 2007, Firence, Italy, August 1--3, 2007, Proceedings.","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 Mining and Learning with Graphs , MLG 2007, Firence, Italy, August 1--3, 2007, Proceedings. Kaspar Riesen, Stefan Fankhauser, and Horst Bunke. 2007. Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic. In Mining and Learning with Graphs, MLG 2007, Firence, Italy, August 1--3, 2007, Proceedings."},{"key":"e_1_3_2_1_20_1","volume-title":"Approximate Graph Edit Distance in Quadratic Time","author":"Riesen Kaspar","year":"2015","unstructured":"Kaspar Riesen , Miquel Ferrer , and Horst Bunke . 2015. Approximate Graph Edit Distance in Quadratic Time . IEEE\/ACM Transactions on Computational Biology and Bioinformatics , Vol. PP ( 09 2015 ), 1--1. https:\/\/doi.org\/10.1109\/TCBB.2015.2478463 10.1109\/TCBB.2015.2478463 Kaspar Riesen, Miquel Ferrer, and Horst Bunke. 2015. Approximate Graph Edit Distance in Quadratic Time. IEEE\/ACM Transactions on Computational Biology and Bioinformatics, Vol. PP (09 2015), 1--1. https:\/\/doi.org\/10.1109\/TCBB.2015.2478463"},{"key":"e_1_3_2_1_21_1","volume-title":"Theoretical Computer Science","volume":"92","author":"Ukkonen Esko","year":"1992","unstructured":"Esko Ukkonen . 1992 . Approximate string-matching with Q-grams and maximal matches . Theoretical Computer Science , Vol. 92 (01 1992), 191--211. https:\/\/doi.org\/10.1016\/0304--3975(92)90143--4 10.1016\/0304--3975(92)90143--4 Esko Ukkonen. 1992. Approximate string-matching with Q-grams and maximal matches. Theoretical Computer Science, Vol. 92 (01 1992), 191--211. https:\/\/doi.org\/10.1016\/0304--3975(92)90143--4"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.28"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2487976"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.28"},{"key":"e_1_3_2_1_25_1","volume-title":"Dan Xu, Byron C. Wallace, and Matthew Lease.","author":"Zhang Ye","year":"2016","unstructured":"Ye Zhang , Md. Mustafizur Rahman , Alex Braylan , Brandon Dang , Heng-Lu Chang , Henna Kim , Quinten McNamara , Aaron Angert , Edward Banner , Vivek Khetan , Tyler McDonnell , An Thanh Nguyen , Dan Xu, Byron C. Wallace, and Matthew Lease. 2016 . Neural Information Retrieval: A Literature Review. CoRR , Vol. abs\/ 1611 .06792 (2016). arxiv: 1611.06792 http:\/\/arxiv.org\/abs\/1611.06792 Ye Zhang, Md. Mustafizur Rahman, Alex Braylan, Brandon Dang, Heng-Lu Chang, Henna Kim, Quinten McNamara, Aaron Angert, Edward Banner, Vivek Khetan, Tyler McDonnell, An Thanh Nguyen, Dan Xu, Byron C. Wallace, and Matthew Lease. 2016. Neural Information Retrieval: A Literature Review. CoRR, Vol. abs\/1611.06792 (2016). arxiv: 1611.06792 http:\/\/arxiv.org\/abs\/1611.06792"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732236"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0306-1"}],"event":{"name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event CA USA","acronym":"KDD '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403257","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403257","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:47Z","timestamp":1750197707000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":27,"alternative-id":["10.1145\/3394486.3403257","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403257","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}