{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:43:43Z","timestamp":1770277423399,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T00:00:00Z","timestamp":1708387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NKRDP","award":["2021YFB0300202"],"award-info":[{"award-number":["2021YFB0300202"]}]},{"name":"National Natural Science Foundation of China,","award":["No. 61972377"],"award-info":[{"award-number":["No. 61972377"]}]},{"name":"National Natural Science Foundation of China,","award":["62172391"],"award-info":[{"award-number":["62172391"]}]},{"name":"National Natural Science Foundation of China,","award":["62032023"],"award-info":[{"award-number":["62032023"]}]},{"name":"National Natural Science Foundation of China,","award":["T2125013"],"award-info":[{"award-number":["T2125013"]}]},{"name":"Beijing Science and Technology Program","award":["No. Z2311000 07423002"],"award-info":[{"award-number":["No. Z2311000 07423002"]}]},{"name":"Alibaba Innovative Research Program and Alibaba Research Intern Program."}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,3,2]]},"DOI":"10.1145\/3627535.3638507","type":"proceedings-article","created":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T14:22:41Z","timestamp":1708438961000},"page":"175-187","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Exploiting Fine-Grained Redundancy in Set-Centric Graph Pattern Mining"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-5371-5125","authenticated-orcid":false,"given":"Zhiheng","family":"Lin","sequence":"first","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, University of Chinese Academy of Sciences, beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3629-7892","authenticated-orcid":false,"given":"Ke","family":"Meng","sequence":"additional","affiliation":[{"name":"Alibaba, beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4008-0036","authenticated-orcid":false,"given":"Chaoyang","family":"Shui","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, University of Chinese Academy of Sciences, beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8327-9164","authenticated-orcid":false,"given":"Kewei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, University of Chinese Academy of Sciences, beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0457-4709","authenticated-orcid":false,"given":"Junmin","family":"Xiao","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, University of Chinese Academy of Sciences, beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6361-5948","authenticated-orcid":false,"given":"Guangming","family":"Tan","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, University of Chinese Academy of Sciences, beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2024,2,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-014-0365-y"},{"key":"e_1_3_2_1_3_1","volume-title":"Chains of affection: The structure of adolescent romantic and sexual networks. American journal of sociology 110, 1","author":"Bearman Peter S","year":"2004","unstructured":"Peter S Bearman, James Moody, and Katherine Stovel. 2004. Chains of affection: The structure of adolescent romantic and sexual networks. American journal of sociology 110, 1 (2004), 44--91."},{"key":"e_1_3_2_1_4_1","volume-title":"Graphminesuite: Enabling high-performance and programmable graph mining algorithms with set algebra. arXiv preprint arXiv:2103.03653","author":"Besta Maciej","year":"2021","unstructured":"Maciej Besta, Zur Vonarburg-Shmaria, Yannick Schaffner, Leonardo Schwarz, Grzegorz Kwasniewski, Lukas Gianinazzi, Jakub Beranek, Kacper Janda, Tobias Holenstein, Sebastian Leisinger, et al. 2021. Graphminesuite: Enabling high-performance and programmable graph mining algorithms with set algebra. arXiv preprint arXiv:2103.03653 (2021)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_2_1_7_1","volume-title":"Efficient and Scalable Graph Pattern Mining on GPUs. In 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22)","author":"Chen Xuhao","year":"2022","unstructured":"Xuhao Chen and Arvind. 2022. Efficient and Scalable Graph Pattern Mining on GPUs. In 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22). USENIX Association, Carlsbad, CA, 857--877. https:\/\/www.usenix.org\/conference\/osdi22\/presentation\/chen"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389137"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2324796.2324831"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.127"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-021-00432-y"},{"key":"e_1_3_2_1_13_1","volume-title":"2023 USENIX Annual Technical Conference (USENIX ATC 23)","author":"Gui Chuangyi","year":"2023","unstructured":"Chuangyi Gui, Xiaofei Liao, Long Zheng, and Hai Jin. 2023. Cyclosa: Redundancy-Free Graph Pattern Mining via Set Dataflow. In 2023 USENIX Annual Technical Conference (USENIX ATC 23). USENIX Association, Boston, MA, 71--85. https:\/\/www.usenix.org\/conference\/atc23\/presentation\/gui"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT52795.2021.00030"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387548"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.540050105"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0202-z"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469379.3469383"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359633"},{"key":"e_1_3_2_1_20_1","volume-title":"Network motifs: simple building blocks of complex networks. Science 298, 5594","author":"Milo Ron","year":"2002","unstructured":"Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: simple building blocks of complex networks. Science 298, 5594 (2002), 824--827."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956831"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1048"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1186\/1758-2946-3-S1-O8"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00104"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_3_2_1_26_1","first-page":"763","article-title":"RStream: Marrying Relational Algebra with Streaming for Efficient Graph Mining on A Single Machine","volume":"18","author":"Wang Kai","year":"2018","unstructured":"Kai Wang, Zhiqiang Zuo, John Thorpe, Tien Quang Nguyen, and Guoqing Harry Xu. 2018. RStream: Marrying Relational Algebra with Streaming for Efficient Graph Mining on A Single Machine.. In OSDI, Vol. 18. 763--782.","journal-title":"OSDI"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3476214"}],"event":{"name":"PPoPP '24: 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","location":"Edinburgh United Kingdom","acronym":"PPoPP '24","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627535.3638507","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627535.3638507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:04Z","timestamp":1750287004000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627535.3638507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,20]]},"references-count":27,"alternative-id":["10.1145\/3627535.3638507","10.1145\/3627535"],"URL":"https:\/\/doi.org\/10.1145\/3627535.3638507","relation":{},"subject":[],"published":{"date-parts":[[2024,2,20]]},"assertion":[{"value":"2024-02-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}