{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T08:00:40Z","timestamp":1776931240425,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2024YFB4504200"],"award-info":[{"award-number":["2024YFB4504200"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,10,18]]},"DOI":"10.1145\/3725843.3756112","type":"proceedings-article","created":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T17:19:56Z","timestamp":1760721596000},"page":"1505-1519","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["X-SET: An Efficient Graph Pattern Matching Accelerator With Order-Aware Parallel Intersection Units"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-0405-436X","authenticated-orcid":false,"given":"Chenxi","family":"Xu","sequence":"first","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2418-4007","authenticated-orcid":false,"given":"Tianhui","family":"Shi","sequence":"additional","affiliation":[{"name":"QingCheng.AI, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4060-9438","authenticated-orcid":false,"given":"Shixuan","family":"Sun","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7656-6428","authenticated-orcid":false,"given":"Jidong","family":"Zhai","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1951-5015","authenticated-orcid":false,"given":"Xinyu","family":"Chen","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","unstructured":"Bal\u00e1zs Adamcsek Gergely Palla Ill\u00e9s\u00a0J. Farkas Imre Der\u00e9nyi and Tam\u00e1s Vicsek. 2006. CFinder: locating cliques and overlapping modules in biological networks. Bioinformatics 22 8 (April 2006) 1021\u20131023. 10.1093\/bioinformatics\/btl039","DOI":"10.1093\/bioinformatics\/btl039"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","unstructured":"Noga Alon Phuong Dao Iman Hajirasouliha Fereydoun Hormozdiari and S.\u00a0Cenk Sahinalp. 2008. Biomolecular network motif counting and discovery by color coding. Bioinformatics 24 13 (July 2008) i241\u2013i249. 10.1093\/bioinformatics\/btn163","DOI":"10.1093\/bioinformatics\/btn163"},{"key":"e_1_3_3_2_4_2","volume-title":"Heterogeneous Accelerated Compute Cluster (HACC) at NUS","year":"2025","unstructured":"AMD Xilinx 2025. Heterogeneous Accelerated Compute Cluster (HACC) at NUS. https:\/\/xacchead.d2.comp.nus.edu.sg\/."},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","unstructured":"Alon Amid David Biancolin Abraham Gonzalez Daniel Grubb Sagar Karandikar Harrison Liew Albert Magyar Howard Mao Albert Ou Nathan Pemberton Paul Rigge Colin Schmidt John Wright Jerry Zhao Yakun\u00a0Sophia Shao Krste Asanovi\u0107 and Borivoje Nikoli\u0107. 2020. Chipyard: Integrated Design Simulation and Implementation Framework for Custom SoCs. IEEE Micro 40 4 (2020) 10\u201321. 10.1109\/MM.2020.2996616","DOI":"10.1109\/MM.2020.2996616"},{"key":"e_1_3_3_2_6_2","unstructured":"Krste Asanovic Rimas Avizienis Jonathan Bachrach Scott Beamer David Biancolin Christopher Celio Henry Cook Daniel Dabbelt John Hauser Adam Izraelevitz et\u00a0al. 2016. The rocket chip generator. EECS Department University of California Berkeley Tech. Rep. UCB\/EECS-2016-17 4 (2016) 6\u20132."},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228584"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","unstructured":"Rajeev Balasubramonian Andrew\u00a0B. Kahng Naveen Muralimanohar Ali Shafiee and Vaishnav Srinivas. 2017. CACTI 7: New Tools for Interconnect Exploration in Innovative Off-Chip Memories. ACM Transactions on Architecture and Code Optimization 14 2 (June 2017) 1\u201325. 10.1145\/3085572","DOI":"10.1145\/3085572"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3466752.3480133"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3710848.3710889"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190545"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503222.3507730"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3460359"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","unstructured":"Xuhao Chen Roshan Dathathri Gurbinder Gill and Keshav Pingali. 2020. Pangolin: an efficient and flexible graph mining system on CPU and GPU. Proceedings of the VLDB Endowment 13 8 (April 2020) 1190\u20131205. 10.14778\/3389133.3389137","DOI":"10.14778\/3389133.3389137"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA52012.2021.00052"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3470496.3527388"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/SACI.2014.6840083"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","unstructured":"Mohammed Elseidy Ehab Abdelhamid Spiros Skiadopoulos and Panos Kalnis. 2014. GraMi: frequent subgraph and pattern mining in a single large graph. Proceedings of the VLDB Endowment 7 7 (March 2014) 517\u2013528. 10.14778\/2732286.2732289","DOI":"10.14778\/2732286.2732289"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","unstructured":"Katherine Faust. 2010. A puzzle concerning triads in social networks: Graph constraints and the triad census. Social Networks 32 3 (2010) 221\u2013233. 10.1016\/j.socnet.2010.03.004","DOI":"10.1016\/j.socnet.2010.03.004"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2008.ECP.466"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","unstructured":"Benoit Ga\u00fcz\u00e8re Luc Brun and Didier Villemin. 2012. Two new graphs kernels in chemoinformatics. Pattern Recognition Letters 33 15 (Nov. 2012) 2038\u20132047. 10.1016\/j.patrec.2012.03.020","DOI":"10.1016\/j.patrec.2012.03.020"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586216"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"crossref","unstructured":"Mark\u00a0S. Granovetter. 1973. The Strength of Weak Ties. Amer. J. Sociology 78 6 (1973) 1360\u20131380. http:\/\/www.jstor.org\/stable\/2776392","DOI":"10.1086\/225469"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","unstructured":"Paul\u00a0W. Holland and Samuel Leinhardt. 1976. Local Structure in Social Networks. Sociological Methodology 7 (1976) 1. 10.2307\/270703","DOI":"10.2307\/270703"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387548"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","unstructured":"D.\u00a0N. Joanes and C.\u00a0A. Gill. 1998. Comparing measures of sample skewness and kurtosis. Journal of the Royal Statistical Society: Series D (The Statistician) 47 1 (1998) 183\u2013189. 10.1111\/1467-9884.00122 arXiv:https:\/\/rss.onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/1467-9884.00122","DOI":"10.1111\/1467-9884.00122"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378524"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2018.00014"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-61520-911-8.ch001"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2011.152"},{"key":"e_1_3_3_2_31_2","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO61859.2024.00096"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3627535.3638507"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.1993.23"},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"publisher","unstructured":"Yu\u00a0A. Malkov and D.\u00a0A. Yashunin. 2020. Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 42 4 (April 2020) 824\u2013836. 10.1109\/TPAMI.2018.2889473","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"publisher","unstructured":"Daniel Mawhirter Sam Reinehr Connor Holmes Tongping Liu and Bo Wu. 2021. GraphZero: A High-Performance Subgraph Matching System. SIGOPS Oper. Syst. Rev. 55 1 (June 2021) 21\u201337. 10.1145\/3469379.3469383","DOI":"10.1145\/3469379.3469383"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359633"},{"key":"e_1_3_3_2_38_2","doi-asserted-by":"crossref","unstructured":"Tijana Milenkovi\u0107 and Nata\u0161a Pr\u017eulj. 2008. Uncovering biological network function via graphlet degree signatures. Cancer informatics 6 (2008) CIN\u2013S680.","DOI":"10.4137\/CIN.S680"},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"publisher","unstructured":"Philippos Papaphilippou Wayne Luk and Chris Brooks. 2022. FLiMS: A Fast Lightweight 2-Way Merger for Sorting. IEEE Trans. Comput. 71 12 (Dec. 2022) 3215\u20133226. 10.1109\/TC.2022.3146509Conference Name: IEEE Transactions on Computers.","DOI":"10.1109\/TC.2022.3146509"},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"publisher","unstructured":"Liva Ralaivola Sanjay\u00a0J. Swamidass Hiroto Saigo and Pierre Baldi. 2005. Graph kernels for chemical informatics. Neural Networks 18 8 (2005) 1093\u20131110. 10.1016\/j.neunet.2005.07.009Neural Networks and Kernel Methods for Structured Domains.","DOI":"10.1016\/j.neunet.2005.07.009"},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503222.3507705"},{"key":"e_1_3_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3581784.3613213"},{"key":"e_1_3_3_2_43_2","series-title":"(SC \u201920)","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","author":"Shi Tianhui","year":"2020","unstructured":"Tianhui Shi, Mingshu Zhai, Yi Xu, and Jidong Zhai. 2020. GraphPi: high performance graph pattern matching through effective redundancy elimination. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (Atlanta, Georgia) (SC \u201920). IEEE Press, Article 100, 14\u00a0pages."},{"key":"e_1_3_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60939-9_8"},{"key":"e_1_3_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO56248.2022.00089"},{"key":"e_1_3_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3470496.3527437"},{"key":"e_1_3_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_3_3_2_48_2","series-title":"(OSDI\u201918)","first-page":"763","volume-title":"Proceedings of the 13th USENIX Conference on Operating Systems Design and Implementation","author":"Wang Kai","year":"2018","unstructured":"Kai Wang, Zhiqiang Zuo, John Thorpe, Tien\u00a0Quang Nguyen, and Guoqing\u00a0Harry Xu. 2018. RStream: marrying relational algebra with streaming for efficient graph mining on a single machine. In Proceedings of the 13th USENIX Conference on Operating Systems Design and Implementation (Carlsbad, CA, USA) (OSDI\u201918). USENIX Association, USA, 763\u2013782."},{"key":"e_1_3_3_2_49_2","doi-asserted-by":"publisher","unstructured":"Yujiang Wang Ying Cao Zhaobo Zhang Pingpeng Yuan and Hai Jin. 2025. SymmPi: Exploiting Symmetry Removal for Fast Subgraph Matching. Data Science and Engineering 10 2 (June 2025) 230\u2013245. 10.1007\/s41019-024-00271-w","DOI":"10.1007\/s41019-024-00271-w"},{"key":"e_1_3_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/3579371.3589086"},{"key":"e_1_3_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00122"},{"key":"e_1_3_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO50266.2020.00077"},{"key":"e_1_3_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"e_1_3_3_2_54_2","doi-asserted-by":"publisher","unstructured":"Young-Rae Cho and Aidong Zhang. 2010. Predicting Protein Function by Frequent Functional Association Pattern Mining in Protein Interaction Networks. IEEE Transactions on Information Technology in Biomedicine 14 1 (Jan. 2010) 30\u201336. 10.1109\/TITB.2009.2028234","DOI":"10.1109\/TITB.2009.2028234"},{"key":"e_1_3_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00064"}],"event":{"name":"MICRO 2025: 58th IEEE\/ACM International Symposium on Microarchitecture","location":"Seoul Korea","acronym":"MICRO 2025","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the 58th IEEE\/ACM International Symposium on Microarchitecture"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725843.3756112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T21:41:41Z","timestamp":1769463701000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725843.3756112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"references-count":54,"alternative-id":["10.1145\/3725843.3756112","10.1145\/3725843"],"URL":"https:\/\/doi.org\/10.1145\/3725843.3756112","relation":{},"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"2025-10-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}