{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:51:03Z","timestamp":1755802263175,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T00:00:00Z","timestamp":1741564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3,10]]},"DOI":"10.1145\/3701551.3703516","type":"proceedings-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T12:33:36Z","timestamp":1740573216000},"page":"475-483","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["RSM: Reinforced Subgraph Matching Framework with Fine-grained Operation based Search Plan"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8222-6455","authenticated-orcid":false,"given":"Ziming","family":"Li","sequence":"first","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7569-9572","authenticated-orcid":false,"given":"Yuequn","family":"Dou","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0650-0458","authenticated-orcid":false,"given":"Youhuan","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Electronic Engineering, Hunan University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5854-1075","authenticated-orcid":false,"given":"Xinhuan","family":"Chen","sequence":"additional","affiliation":[{"name":"Tencent Inc., Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8349-7926","authenticated-orcid":false,"given":"Chuxu","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Connecticut, Connecticut, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,3,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2024. RSM. https:\/\/github.com\/zmli6\/RSM."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Junya Arai Yasuhiro Fujiwara and Makoto Onizuka. 2023. GuP: Fast Subgraph Matching by Guard-based Pruning. In SIGMOD.","DOI":"10.1145\/3589312"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Fei Bi Lijun Chang Xuemin Lin Lu Qin and Wenjie Zhang. 2016. Efficient Subgraph Matching by Postponing Cartesian Products. In SIGMOD.","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Paolo Boldi and Sebastiano Vigna. 2004. The WebGraph Framework I: Compression Techniques. In WWW.","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Vincenzo Bonnici Rosalba Giugno Alfredo Pulvirenti Dennis E. Shasha and Alfredo Ferro. 2013. A subgraph isomorphism algorithm and its application to biochemical data. In BMC.","DOI":"10.1186\/1471-2105-14-S7-S13"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Vincenzo Carletti Pasquale Foggia and Mario Vento. 2015. VF2 Plus: An Improved version of VF2 for Biological Graphs. In GbRPR.","DOI":"10.1007\/978-3-319-18224-7_17"},{"key":"e_1_3_2_1_8_1","volume-title":"Khushbu Agarwal, and John Feo.","author":"Choudhury Sutanay","year":"2015","unstructured":"Sutanay Choudhury, Lawrence B. Holder, George Chin Jr., Khushbu Agarwal, and John Feo. 2015. A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs. In EDBT."},{"key":"e_1_3_2_1_9_1","volume-title":"Quoc Viet Hung Nguyen, and Karl Aberer","author":"Duong Chi Thang","year":"2021","unstructured":"Chi Thang Duong, Dung Hoang, Hongzhi Yin, Matthias Weidlich, Quoc Viet Hung Nguyen, and Karl Aberer. 2021. Efficient Streaming Subgraph Isomorphism with Graph Neural Networks. In VLDB."},{"key":"e_1_3_2_1_10_1","volume-title":"Min Wu, Kevin Chen-Chuan Chang, and Xiaoli Li.","author":"Fang Yuan","year":"2016","unstructured":"Yuan Fang, Wenqing Lin, Vincent Wenchen Zheng, Min Wu, Kevin Chen-Chuan Chang, and Xiaoli Li. 2016. Semantic proximity search on graphs with metagraph-based learning. In ICDE."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Christiane Fellbaum. 1998. WordNet: An Electronic Lexical Database. https:\/\/mitpress.mit.edu\/9780262561167\/","DOI":"10.7551\/mitpress\/7287.001.0001"},{"key":"e_1_3_2_1_12_1","unstructured":"William L. Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive Representation Learning on Large Graphs. In NIPS."},{"key":"e_1_3_2_1_13_1","unstructured":"Myoungji Han Hyunjoon Kim Geonmo Gu Kunsoo Park and Wook-Shin Han. 2019. Efficient Subgraph Matching: Harmonizing Dynamic Programming Adaptive Matching Order and Failing Set Together. In SIGMOD."},{"key":"e_1_3_2_1_14_1","unstructured":"Wook-Shin Han Jinsoo Lee and Jeong-Hoon Lee. 2013. Turbo iso : towards ultrafast and robust subgraph isomorphism search in large graph databases. In SIGMOD."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939815"},{"key":"e_1_3_2_1_16_1","volume-title":"Circinus: Fast Redundancy-Reduced Subgraph Matching. In SIGMOD.","author":"Jin Tatiana","year":"2023","unstructured":"Tatiana Jin, Boyang Li, Yichao Li, Qihui Zhou, Qianli Ma, Yunjian Zhao, Hongzhi Chen, and James Cheng. 2023. Circinus: Fast Redundancy-Reduced Subgraph Matching. In SIGMOD."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056445"},{"key":"e_1_3_2_1_18_1","volume-title":"Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching. In SIGMOD.","author":"Kim Hyunjoon","year":"2021","unstructured":"Hyunjoon Kim, Yunyoung Choi, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, and Wook-Shin Han. 2021. Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching. In SIGMOD."},{"key":"e_1_3_2_1_19_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 ICLR."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Zixun Lan Ye Ma Limin Yu Linglong Yuan and Fei Ma. 2023. AEDNet: Adaptive Edge-Deleting Network For Subgraph Matching. In PR.","DOI":"10.1016\/j.patcog.2022.109033"},{"key":"e_1_3_2_1_21_1","unstructured":"Ziming Li Youhuan Li Xinhuan Chen Lei Zou Yang Li Xiaofeng Yang and Hongbo Jiang. 2024. NewSP: A New Search Process for Continuous Subgraph Matching over Dynamic Graphs. In ICDE."},{"key":"e_1_3_2_1_22_1","unstructured":"Baolin Liu and Bo Hu. 2010. HPRD: a high performance RDF database. In IJPEDS."},{"key":"e_1_3_2_1_23_1","unstructured":"Zhaoyu Lou Jiaxuan You Chengtao Wen Arquimedes Canedo Jure Leskovec et al. 2020. Neural subgraph matching. In arXiv."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.24432\/C5KG68"},{"key":"e_1_3_2_1_25_1","unstructured":"Xuguang Ren and Junhu Wang. 2015. Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs. In VLDB."},{"key":"e_1_3_2_1_26_1","volume-title":"Jamil","author":"Rivero Carlos R.","year":"2017","unstructured":"Carlos R. Rivero and Hasan M. Jamil. 2017. Efficient and scalable labeled subgraph matching using SGMatch. In KIS."},{"key":"e_1_3_2_1_27_1","unstructured":"John Schulman Filip Wolski Prafulla Dhariwal Alec Radford and Oleg Klimov. 2017. Proximal policy optimization algorithms. In arXiv."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Haichuan Shang Ying Zhang Xuemin Lin and Jeffrey Xu Yu. 2008. Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. In VLDB.","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_3_2_1_29_1","unstructured":"Shixuan Sun and Qiong Luo. 2020. In-Memory Subgraph Matching: An In-depth Study. In SIGMOD."},{"key":"e_1_3_2_1_30_1","unstructured":"Shixuan Sun Xibo Sun Yulin Che Qiong Luo and Bingsheng He. 2020. Rapid-Match: A Holistic Approach to Subgraph Query Processing. In VLDB."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Julian R. Ullmann. 1976. An Algorithm for Subgraph Isomorphism. In J. ACM.","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_1_32_1","unstructured":"Petar Velickovic Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Hanchen Wang Ying Zhang Lu Qin Wei Wang Wenjie Zhang and Xuemin Lin. 2022. Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching. In ICDE.","DOI":"10.1109\/ICDE53745.2022.00023"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Jaewon Yang and Jure Leskovec. 2012. Defining and evaluating network communities based on ground-truth. In KIS.","DOI":"10.1145\/2350190.2350193"},{"key":"e_1_3_2_1_35_1","volume-title":"Chawla","author":"Zhang Chuxu","year":"2019","unstructured":"Chuxu Zhang, Dongjin Song, Chao Huang, Ananthram Swami, and Nitesh V. Chawla. 2019. Heterogeneous Graph Neural Network. In KDD."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Shijie Zhang Shirong Li and Jiong Yang. 2009. GADDI: distance index based subgraph matching in biological networks. In EDBT.","DOI":"10.1145\/1516360.1516384"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Huan Zhao Quanming Yao Jianda Li Yangqiu Song and Dik Lun Lee. 2017. Meta-Graph Based Recommendation Fusion over Heterogeneous Information Networks. In KDD.","DOI":"10.1145\/3097983.3098063"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Peixiang Zhao and Jiawei Han. 2010. On Graph Query Optimization in Large Networks. In VLDB.","DOI":"10.14778\/1920841.1920887"}],"event":{"name":"WSDM '25: The Eighteenth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Hannover Germany","acronym":"WSDM '25"},"container-title":["Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3703516","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3701551.3703516","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T09:14:59Z","timestamp":1755767699000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3703516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,10]]},"references-count":38,"alternative-id":["10.1145\/3701551.3703516","10.1145\/3701551"],"URL":"https:\/\/doi.org\/10.1145\/3701551.3703516","relation":{},"subject":[],"published":{"date-parts":[[2025,3,10]]},"assertion":[{"value":"2025-03-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}