{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:38:05Z","timestamp":1776883085615,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T00:00:00Z","timestamp":1671408000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2127543,CCF-1750656,CCF-1717754"],"award-info":[{"award-number":["CCF-2127543,CCF-1750656,CCF-1717754"]}],"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":[[2022,12,19]]},"DOI":"10.1145\/3567955.3567956","type":"proceedings-article","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T18:24:44Z","timestamp":1671647084000},"page":"47-61","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["DecoMine: A Compilation-Based Graph Pattern Mining System with Pattern Decomposition"],"prefix":"10.1145","author":[{"given":"Jingji","family":"Chen","sequence":"first","affiliation":[{"name":"Purdue University, USA"}]},{"given":"Xuehai","family":"Qian","sequence":"additional","affiliation":[{"name":"Purdue University, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.60"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.141"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Khaled Ammar Frank McSherry Semih Salihoglu and Manas Joglekar. 2018. Distributed evaluation of subgraph queries using worstcase optimal lowmemory dataflows. arXiv preprint arXiv:1802.03760. \t\t\t\t  Khaled Ammar Frank McSherry Semih Salihoglu and Manas Joglekar. 2018. Distributed evaluation of subgraph queries using worstcase optimal lowmemory dataflows. arXiv preprint arXiv:1802.03760.","DOI":"10.14778\/3184470.3184473"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_5_1","volume-title":"Graph Partitioning and Graph Clustering. In 10th DIMACS Implementation Challenge Workshop.","author":"Bader David A","year":"2012","unstructured":"David A Bader , Henning Meyerhenke , Peter Sanders , and Dorothea Wagner . 2012 . Graph Partitioning and Graph Clustering. In 10th DIMACS Implementation Challenge Workshop. David A Bader, Henning Meyerhenke, Peter Sanders, and Dorothea Wagner. 2012. Graph Partitioning and Graph Clustering. In 10th DIMACS Implementation Challenge Workshop."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401898"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_2_1_9_1","volume-title":"Motif counting beyond five nodes. ACM Transactions on Knowledge Discovery from Data (TKDD), 12, 4","author":"Bressan Marco","year":"2018","unstructured":"Marco Bressan , Flavio Chierichetti , Ravi Kumar , Stefano Leucci , and Alessandro Panconesi . 2018. Motif counting beyond five nodes. ACM Transactions on Knowledge Discovery from Data (TKDD), 12, 4 ( 2018 ), 1\u201325. Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, and Alessandro Panconesi. 2018. Motif counting beyond five nodes. ACM Transactions on Knowledge Discovery from Data (TKDD), 12, 4 (2018), 1\u201325."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342640"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190545"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3460359"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389137"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319875"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SACI.2014.6840083"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732289"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Robert Geisberger Peter Sanders and Dominik Schultes. 2008. Better Approximation of Betweenness Centrality.. In ALENEX. 90\u2013100. \t\t\t\t  Robert Geisberger Peter Sanders and Dominik Schultes. 2008. Better Approximation of Betweenness Centrality.. In ALENEX. 90\u2013100.","DOI":"10.1137\/1.9781611972887.9"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2015.46"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71681-5_7"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916438"},{"key":"e_1_3_2_1_25_1","volume-title":"Approximate Graph Pattern Mining at Scale. In 13th $USENIX$ Symposium on Operating Systems Design and Implementation ($OSDI$ 18). 745\u2013761.","author":"Iyer Anand Padmanabha","unstructured":"Anand Padmanabha Iyer , Zaoxing Liu , Xin Jin , Shivaram Venkataraman , Vladimir Braverman , and Ion Stoica . 2018. $ASAP$ : Fast , Approximate Graph Pattern Mining at Scale. In 13th $USENIX$ Symposium on Operating Systems Design and Implementation ($OSDI$ 18). 745\u2013761. Anand Padmanabha Iyer, Zaoxing Liu, Xin Jin, Shivaram Venkataraman, Vladimir Braverman, and Ion Stoica. 2018. $ASAP$: Fast, Approximate Graph Pattern Mining at Scale. In 13th $USENIX$ Symposium on Operating Systems Design and Implementation ($OSDI$ 18). 745\u2013761."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387548"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741101"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888912000331"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the 24th International Conference on Parallel Architectures and Compilation Techniques (PACT \u201915)","author":"Khorasani Farzad","unstructured":"Farzad Khorasani , Rajiv Gupta , and Laxmi N. Bhuyan . 2015. Scalable SIMD-Efficient Graph Processing on GPUs . In Proceedings of the 24th International Conference on Parallel Architectures and Compilation Techniques (PACT \u201915) . 39\u201350. Farzad Khorasani, Rajiv Gupta, and Laxmi N. Bhuyan. 2015. Scalable SIMD-Efficient Graph Processing on GPUs. In Proceedings of the 24th International Conference on Parallel Architectures and Compilation Techniques (PACT \u201915). 39\u201350."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915209"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588563"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2794367.2794368"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_36_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data \t\t\t\t  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137660"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187963"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1074\/jbc.R800056200"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469379.3469383"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359633"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.007"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl301"},{"key":"e_1_3_2_1_46_1","volume-title":"David Aparicio, and Fernando Silva.","author":"Ribeiro Pedro","year":"2019","unstructured":"Pedro Ribeiro , Pedro Paredes , Miguel EP Silva , David Aparicio, and Fernando Silva. 2019 . A Survey on Subgraph Counting : Concepts, Algorithms and Applications to Network Motifs and Graphlets . arXiv preprint arXiv:1910.13011. Pedro Ribeiro, Pedro Paredes, Miguel EP Silva, David Aparicio, and Fernando Silva. 2019. A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets. arXiv preprint arXiv:1910.13011."},{"key":"e_1_3_2_1_47_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K . Ahmed . 2015 . The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. http:\/\/networkrepository.com Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. http:\/\/networkrepository.com"},{"key":"e_1_3_2_1_48_1","volume-title":"\u03b2 -motif finder for identification of phenotype-related functional modules. BMC bioinformatics, 12, 1","author":"Schmidt Matthew C","year":"2011","unstructured":"Matthew C Schmidt , Andrea M Rocha , Kanchana Padmanabhan , Zhengzhang Chen , Kathleen Scott , James R Mihelcic , and Nagiza F Samatova . 2011. Efficient \u03b1 , \u03b2 -motif finder for identification of phenotype-related functional modules. BMC bioinformatics, 12, 1 ( 2011 ), 440. Matthew C Schmidt, Andrea M Rocha, Kanchana Padmanabhan, Zhengzhang Chen, Kathleen Scott, James R Mihelcic, and Nagiza F Samatova. 2011. Efficient \u03b1 , \u03b2 -motif finder for identification of phenotype-related functional modules. BMC bioinformatics, 12, 1 (2011), 440."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3127479.3131625"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588557"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.2307\/2647547"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00104"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0466-x"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.4236\/sn.2013.21004"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118242.3118587"},{"key":"e_1_3_2_1_58_1","volume-title":"Tien Quang Nguyen, and Guoqing Harry Xu","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 13th $USENIX$ Symposium on Operating Systems Design and Implementation ( $OSDI$ 18). 763\u2013782. 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 13th $USENIX$ Symposium on Operating Systems Design and Implementation ($OSDI$ 18). 763\u2013782."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2756836"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544815"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00122"},{"key":"e_1_3_2_1_62_1","volume-title":"2002 IEEE International Conference on Data Mining, 2002. Proceedings.. 721\u2013724","author":"Yan Xifeng","year":"2002","unstructured":"Xifeng Yan and Jiawei Han . 2002 . gspan: Graph-based substructure pattern mining . In 2002 IEEE International Conference on Data Mining, 2002. Proceedings.. 721\u2013724 . Xifeng Yan and Jiawei Han. 2002. gspan: Graph-based substructure pattern mining. In 2002 IEEE International Conference on Data Mining, 2002. Proceedings.. 721\u2013724."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"}],"event":{"name":"ASPLOS '23: 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1","location":"Vancouver BC Canada","acronym":"ASPLOS '23","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","SIGOPS ACM Special Interest Group on Operating Systems","SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3567955.3567956","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3567955.3567956","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3567955.3567956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:26:14Z","timestamp":1750281974000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3567955.3567956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,19]]},"references-count":64,"alternative-id":["10.1145\/3567955.3567956","10.1145\/3567955"],"URL":"https:\/\/doi.org\/10.1145\/3567955.3567956","relation":{},"subject":[],"published":{"date-parts":[[2022,12,19]]},"assertion":[{"value":"2022-12-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}