{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T18:15:34Z","timestamp":1760552134632,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T00:00:00Z","timestamp":1720569600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U22B2019, 62272372, 62272379"],"award-info":[{"award-number":["U22B2019, 62272372, 62272379"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,10]]},"DOI":"10.1145\/3626772.3657773","type":"proceedings-article","created":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T12:40:05Z","timestamp":1720701605000},"page":"1639-1648","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Grand: A Fast and Accurate Graph Retrieval Framework via Knowledge Distillation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7363-1143","authenticated-orcid":false,"given":"Lin","family":"Lan","sequence":"first","affiliation":[{"name":"MOE KLINNS Lab, Xi'an Jiaotong University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5779-6108","authenticated-orcid":false,"given":"Pinghui","family":"Wang","sequence":"additional","affiliation":[{"name":"MOE KLINNS Lab, Xi'an Jiaotong University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8243-9492","authenticated-orcid":false,"given":"Rui","family":"Shi","sequence":"additional","affiliation":[{"name":"MOE KLINNS Lab, Xi'an Jiaotong University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1829-1582","authenticated-orcid":false,"given":"Tingqing","family":"Liu","sequence":"additional","affiliation":[{"name":"MOE KLINNS Lab, Xi'an Jiaotong University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0935-0715","authenticated-orcid":false,"given":"Juxiang","family":"Zeng","sequence":"additional","affiliation":[{"name":"MOE KLINNS Lab, Xi'an Jiaotong University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0908-0559","authenticated-orcid":false,"given":"Feiyang","family":"Sun","sequence":"additional","affiliation":[{"name":"MOE KLINNS Lab, Xi'an Jiaotong University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7796-4930","authenticated-orcid":false,"given":"Yang","family":"Ren","sequence":"additional","affiliation":[{"name":"GaussDB, Huawei Technologies Co Ltd, Shenzhen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1779-6290","authenticated-orcid":false,"given":"Jing","family":"Tao","sequence":"additional","affiliation":[{"name":"MOE KLINNS Lab, Xi'an Jiaotong University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8826-0362","authenticated-orcid":false,"given":"Xiaohong","family":"Guan","sequence":"additional","affiliation":[{"name":"MOE KLINNS Lab, Xi'an Jiaotong University & Tsinghua National Lab for Information Science and Technology, Tsinghua University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290967"},{"key":"e_1_3_2_1_2_1","unstructured":"Yunsheng Bai Hao Ding Ken Gu Yizhou Sun and Wei Wang. 2020. Learningbased efficient graph similarity computation via multi-scale convolutional set matching. In AAAI."},{"key":"e_1_3_2_1_3_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 (1998)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Zhe Cao Tao Qin Tie-Yan Liu Ming-Feng Tsai and Hang Li. 2007. Learning to rank: from pairwise approach to listwise approach. In ICML.","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_5_1","volume-title":"An efficient algorithm for graph edit distance computation. Knowledge-Based Systems","author":"Chen Xiaoyang","year":"2019","unstructured":"Xiaoyang Chen, Hongwei Huo, Jun Huan, and Jeffrey Scott Vitter. 2019. An efficient algorithm for graph edit distance computation. Knowledge-Based Systems (2019)."},{"key":"e_1_3_2_1_6_1","unstructured":"Zhengdao Chen Lei Chen Soledad Villar and Joan Bruna. 2020. Can graph neural networks count substructures?. In NeurIPS."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Tyler Derr Hamid Karimi Xiaorui Liu Jiejun Xu and Jiliang Tang. 2021. Deep adversarial network alignment. In CIKM.","DOI":"10.1145\/3459637.3482418"},{"key":"e_1_3_2_1_8_1","unstructured":"Matthias Fey Jan E Lenssen Christopher Morris Jonathan Masci and Nils M Kriege. 2020. Deep Graph Matching Consensus. In ICLR."},{"key":"e_1_3_2_1_9_1","unstructured":"Justin Gilmer Samuel S Schoenholz Patrick F Riley Oriol Vinyals and George E Dahl. 2017. Neural message passing for quantum chemistry. In ICML."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Kunal Goyal Utkarsh Gupta Abir De and Soumen Chakrabarti. 2020. Deep Neural Matching Models for Graph Retrieval. In SIGIR.","DOI":"10.1145\/3397271.3401216"},{"key":"e_1_3_2_1_11_1","unstructured":"William L Hamilton Rex Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NIPS."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271788"},{"key":"e_1_3_2_1_14_1","volume-title":"Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531","author":"Hinton Geoffrey","year":"2015","unstructured":"Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. 2015. Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531 (2015)."},{"volume-title":"Deep metric learning using triplet network","author":"Hoffer Elad","key":"e_1_3_2_1_15_1","unstructured":"Elad Hoffer and Nir Ailon. 2015. Deep metric learning using triplet network. In SIMBAD. Springer."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Jui-Ting Huang Ashish Sharma Shuying Sun Li Xia David Zhang Philip Pronin Janani Padmanabhan Giuseppe Ottaviano and Linjun Yang. 2020. Embeddingbased retrieval in facebook search. In KDD.","DOI":"10.1145\/3394486.3403305"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_19_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."},{"key":"e_1_3_2_1_20_1","unstructured":"Thomas N Kipf and MaxWelling. 2017. Semi-supervised classification with graph convolutional networks. In ICLR."},{"key":"e_1_3_2_1_21_1","unstructured":"Yujia Li Chenjie 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_22_1","doi-asserted-by":"crossref","unstructured":"Yongjiang Liang and Peixiang Zhao. 2017. Similarity search in graph databases: A multi-layered indexing approach. In ICDE.","DOI":"10.1109\/ICDE.2017.129"},{"key":"e_1_3_2_1_23_1","volume-title":"Multilevel Graph Matching Networks for Deep Graph Similarity Learning. TNNLS","author":"Ling Xiang","year":"2021","unstructured":"Xiang Ling, Lingfei Wu, Saizhuo Wang, Tengfei Ma, Fangli Xu, Alex X Liu, Chunming Wu, and Shouling Ji. 2021. Multilevel Graph Matching Networks for Deep Graph Similarity Learning. TNNLS (2021)."},{"key":"e_1_3_2_1_24_1","volume-title":"Deep Graph Matching and Searching for Semantic Code Retrieval. TKDD","author":"Ling Xiang","year":"2021","unstructured":"Xiang Ling, Lingfei Wu, Saizhuo Wang, Gaoning Pan, Tengfei Ma, Fangli Xu, Alex X Liu, Chunming Wu, and Shouling Ji. 2021. Deep Graph Matching and Searching for Semantic Code Retrieval. TKDD (2021)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Xin Liu Haojie Pan Mutian He Yangqiu Song Xin Jiang and Lifeng Shang. 2020. Neural subgraph isomorphism counting. In KDD.","DOI":"10.1145\/3394486.3403247"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Michel Neuhaus and Horst Bunke. 2007. Bridging the gap between graph edit distance and kernel machines. World Scientific.","DOI":"10.1142\/9789812770202"},{"key":"e_1_3_2_1_27_1","volume-title":"Armand Vilalta, Jonatan Moreno, Eduard Ayguad\u00e9, Jes\u00fas Labarta, Ulises Cort\u00e9s, and Toyotaro Suzumura.","author":"Par\u00e9s Ferran","year":"2017","unstructured":"Ferran Par\u00e9s, Dario Garcia Gasulla, Armand Vilalta, Jonatan Moreno, Eduard Ayguad\u00e9, Jes\u00fas Labarta, Ulises Cort\u00e9s, and Toyotaro Suzumura. 2017. Fluid communities: A competitive, scalable and diverse community detection algorithm. In Complex Networks & Their Applications."},{"key":"e_1_3_2_1_28_1","first-page":"14110","article-title":"Slow learning and fast inference: Efficient graph similarity computation via knowledge distillation","volume":"34","author":"Qin Can","year":"2021","unstructured":"Can Qin, Handong Zhao, Lichen Wang, Huan Wang, Yulun Zhang, and Yun Fu. 2021. Slow learning and fast inference: Efficient graph similarity computation via knowledge distillation. Advances in Neural Information Processing Systems 34 (2021), 14110--14121.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_29_1","unstructured":"Zongyue Qin Yunsheng Bai and Yizhou Sun. 2020. GHashing: Semantic Graph Hashing for Approximate Similarity Search in Graph Databases. In KDD."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Sayan Ranu Minh Hoang and Ambuj Singh. 2014. Answering top-k representative queries on graph databases. In SIGMOD.","DOI":"10.1145\/2588555.2610524"},{"key":"e_1_3_2_1_31_1","volume-title":"Jeffrey Xu Yu, and Wei Wang","author":"Shang Haichuan","year":"2010","unstructured":"Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu Yu, and Wei Wang. 2010. Connected substructure similarity search. In SIGMOD."},{"key":"e_1_3_2_1_32_1","volume-title":"Lars Juhl Jensen, Peer Bork, and Michael Kuhn.","author":"Szklarczyk Damian","year":"2016","unstructured":"Damian Szklarczyk, Alberto Santos, Christian Von Mering, Lars Juhl Jensen, Peer Bork, and Michael Kuhn. 2016. STITCH 5: augmenting protein-chemical interaction networks with tissue and affinity data. Nucleic acids research (2016)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Michael Taylor John Guiver Stephen Robertson and Tom Minka. 2008. Softrank: optimizing non-smooth rank metrics. In WSDM.","DOI":"10.1145\/1341531.1341544"},{"key":"e_1_3_2_1_34_1","volume-title":"David J States, and JigneshM Patel","author":"Tian Yuanyuan","year":"2007","unstructured":"Yuanyuan Tian, Richard C Mceachin, Carlos Santos, David J States, and JigneshM Patel. 2007. SAGA: a subgraph matching tool for biological graphs. Bioinformatics (2007)."},{"key":"e_1_3_2_1_35_1","volume-title":"Approximate string-matching with q-grams and maximal matches. Theoretical computer science","author":"Ukkonen Esko","year":"1992","unstructured":"Esko Ukkonen. 1992. Approximate string-matching with q-grams and maximal matches. Theoretical computer science (1992)."},{"key":"e_1_3_2_1_36_1","unstructured":"Petar Veli?kovi? Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Lio and Yoshua Bengio. 2018. Graph attention networks. In ICLR."},{"key":"e_1_3_2_1_37_1","volume-title":"Efficiently indexing large sparse graphs for similarity search. TKDE","author":"Wang Guoren","year":"2010","unstructured":"Guoren Wang, Bin Wang, Xiaochun Yang, and Ge Yu. 2010. Efficiently indexing large sparse graphs for similarity search. TKDE (2010)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Fen Xia Tie-Yan Liu Jue Wang Wensheng Zhang and Hang Li. 2008. Listwise approach to learning to rank: theory and algorithm. In ICML.","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_1_39_1","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2019. How powerful are graph neural networks?. In ICLR."},{"key":"e_1_3_2_1_40_1","unstructured":"Xifeng Yan Philip S Yu and Jiawei Han. 2005. Substructure similarity search in graph databases. In SIGMOD."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450068"},{"key":"e_1_3_2_1_42_1","volume-title":"Neural subgraph matching. arXiv preprint arXiv:2007.03092","author":"Ying Zhitao","year":"2020","unstructured":"Zhitao Ying, Andrew Wang, Jiaxuan You, Chengtao Wen, Arquimedes Canedo, and Jure Leskovec. 2020. Neural subgraph matching. arXiv preprint arXiv:2007.03092 (2020)."},{"key":"e_1_3_2_1_43_1","volume-title":"Jeffery Yu Xu, and Lei Chen","author":"Yuan Ye","year":"2015","unstructured":"Ye Yuan, Guoren Wang, Jeffery Yu Xu, and Lei Chen. 2015. Efficient distributed subgraph similarity matching. The VLDB Journal (2015)."},{"key":"e_1_3_2_1_44_1","volume-title":"Jianyong Wang, Jianhua Feng, and Lizhu Zhou.","author":"Zeng Zhiping","year":"2009","unstructured":"Zhiping Zeng, Anthony KH Tung, Jianyong Wang, Jianhua Feng, and Lizhu Zhou. 2009. Comparing stars: On approximating graph edit distance. In VLDB."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920988"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Ying Zhang Tao Xiang Timothy M Hospedales and Huchuan Lu. 2018. Deep mutual learning. In CVPR.","DOI":"10.1109\/CVPR.2018.00454"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Zhen Zhang Jiajun Bu Martin Ester Zhao Li Chengwei Yao Zhi Yu and Can Wang. 2021. H2MN: Graph Similarity Learning with Hierarchical Hypergraph Matching Networks. In KDD.","DOI":"10.1145\/3447548.3467328"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Xiang Zhao Chuan Xiao Xuemin Lin Qing Liu and Wenjie Zhang. 2013. A partition-based approach to structure similarity search. In VLDB.","DOI":"10.14778\/2732232.2732236"},{"key":"e_1_3_2_1_49_1","volume-title":"Efficient processing of graph similarity queries with edit distance constraints. The VLDB Journal","author":"Zhao Xiang","year":"2013","unstructured":"Xiang Zhao, Chuan Xiao, Xuemin Lin, Wei Wang, and Yoshiharu Ishikawa. 2013. Efficient processing of graph similarity queries with edit distance constraints. The VLDB Journal (2013)."},{"key":"e_1_3_2_1_50_1","unstructured":"Gaoping Zhu Xuemin Lin Ke Zhu Wenjie Zhang and Jeffrey Xu Yu. 2012. TreeSpan: efficiently computing similarity all-matching. In SIGMOD."}],"event":{"name":"SIGIR 2024: The 47th International ACM SIGIR Conference on Research and Development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Washington DC USA","acronym":"SIGIR 2024"},"container-title":["Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626772.3657773","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626772.3657773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:38:00Z","timestamp":1755841080000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626772.3657773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,10]]},"references-count":50,"alternative-id":["10.1145\/3626772.3657773","10.1145\/3626772"],"URL":"https:\/\/doi.org\/10.1145\/3626772.3657773","relation":{},"subject":[],"published":{"date-parts":[[2024,7,10]]},"assertion":[{"value":"2024-07-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}