{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T00:16:25Z","timestamp":1782519385124,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T00:00:00Z","timestamp":1665187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,8]]},"DOI":"10.1145\/3559009.3569658","type":"proceedings-article","created":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T14:02:50Z","timestamp":1674828170000},"page":"185-197","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["SampleMine"],"prefix":"10.1145","author":[{"given":"Peng","family":"Jiang","sequence":"first","affiliation":[{"name":"The University of Iowa"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yihua","family":"Wei","sequence":"additional","affiliation":[{"name":"The University of Iowa"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiya","family":"Su","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rujia","family":"Wang","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Wu","sequence":"additional","affiliation":[{"name":"Colorado School of Mines"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,1,27]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Dataset for \"Statistics and Social Network of YouTube Videos\". http:\/\/netsg.cs.sfu.ca\/youtubedata\/.  Dataset for \"Statistics and Social Network of YouTube Videos\". http:\/\/netsg.cs.sfu.ca\/youtubedata\/."},{"key":"e_1_3_2_2_2_1","unstructured":"Orkut social network. http:\/\/snap.stanford.edu\/data\/com-Orkut.html.  Orkut social network. http:\/\/snap.stanford.edu\/data\/com-Orkut.html."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.60"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687710"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403073"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.04.010"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342640"},{"key":"e_1_3_2_2_8_1","volume-title":"Motif counting beyond five nodes. ACM Transactions on Knowledge Discovery from Data (TKDD), 12(4):1--25","author":"Bressan Marco","year":"2018","unstructured":"Marco Bressan , Flavio Chierichetti , Ravi Kumar , Stefano Leucci , and Alessandro Panconesi . Motif counting beyond five nodes. ACM Transactions on Knowledge Discovery from Data (TKDD), 12(4):1--25 , 2018 . Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, and Alessandro Panconesi. Motif counting beyond five nodes. ACM Transactions on Knowledge Discovery from Data (TKDD), 12(4):1--25, 2018."},{"key":"e_1_3_2_2_9_1","volume-title":"Motivo: fast motif counting via succinct color coding and adaptive sampling. arXiv preprint arXiv:1906.01599","author":"Bressan Marco","year":"2019","unstructured":"Marco Bressan , Stefano Leucci , and Alessandro Panconesi . Motivo: fast motif counting via succinct color coding and adaptive sampling. arXiv preprint arXiv:1906.01599 , 2019 . Marco Bressan, Stefano Leucci, and Alessandro Panconesi. Motivo: fast motif counting via succinct color coding and adaptive sampling. arXiv preprint arXiv:1906.01599, 2019."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1786574.1786663"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.01.042"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190545"},{"key":"e_1_3_2_2_13_1","volume-title":"Dwarvesgraph: A high-performance graph mining system with pattern decomposition","author":"Chen Jingji","year":"2020","unstructured":"Jingji Chen and Xuehai Qian . Dwarvesgraph: A high-performance graph mining system with pattern decomposition , 2020 . Jingji Chen and Xuehai Qian. Dwarvesgraph: A high-performance graph mining system with pattern decomposition, 2020."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3460359"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389137"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2324796.2324831"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319875"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732289"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2016.7511156"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36182-0_9"},{"key":"e_1_3_2_2_21_1","unstructured":"Michel Goemans. Chernoff bounds and some applications. https:\/\/math.mit.edu\/~goemans\/18310S15\/chernoff-notes.pdf.  Michel Goemans. Chernoff bounds and some applications. https:\/\/math.mit.edu\/~goemans\/18310S15\/chernoff-notes.pdf."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0029"},{"key":"e_1_3_2_2_23_1","first-page":"745","volume-title":"13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18)","author":"Iyer Anand Padmanabha","year":"2018","unstructured":"Anand Padmanabha Iyer , Zaoxing Liu , Xin Jin , Shivaram Venkataraman , Vladimir Braverman , and Ion Stoica . ASAP : Fast, approximate graph pattern mining at scale . In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18) , pages 745 -- 761 , Carlsbad, CA , October 2018 . USENIX Association. Anand Padmanabha Iyer, Zaoxing Liu, Xin Jin, Shivaram Venkataraman, Vladimir Braverman, and Ion Stoica. ASAP: Fast, approximate graph pattern mining at scale. In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18), pages 745--761, Carlsbad, CA, October 2018. USENIX Association."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387548"},{"key":"e_1_3_2_2_25_1","first-page":"135","volume-title":"Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics","author":"Junttila Tommi","year":"2007","unstructured":"Tommi Junttila and Petteri Kaski . Engineering an efficient canonical labeling tool for large and sparse graphs. In David Applegate, Gerth St\u00f8lting Brodal, Daniel Panario, and Robert Sedgewick, editors , Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics , pages 135 -- 149 . SIAM, 2007 . Tommi Junttila and Petteri Kaski. Engineering an efficient canonical labeling tool for large and sparse graphs. In David Applegate, Gerth St\u00f8lting Brodal, Daniel Panario, and Robert Sedgewick, editors, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics, pages 135--149. SIAM, 2007."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1032649.1033500"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0459-4"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021937"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205289.3205317"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359633"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2018.00080"},{"key":"e_1_3_2_2_33_1","volume-title":"Practical graph isomorphism. Department of Computer Science","author":"McKay Brendan D","year":"1981","unstructured":"Brendan D McKay Practical graph isomorphism. Department of Computer Science , Vanderbilt University Tennessee , USA , 1981 . Brendan D McKay et al. Practical graph isomorphism. Department of Computer Science, Vanderbilt University Tennessee, USA, 1981."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556569"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467344"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8258022"},{"key":"e_1_3_2_2_39_1","volume-title":"David Aparicio, and Fernando Silva. A survey on subgraph counting: Concepts, algorithms, and applications to network motifs and graphlets. ACM Computing Surveys (CSUR), 54(2):1--36","author":"Ribeiro Pedro","year":"2021","unstructured":"Pedro Ribeiro , Pedro Paredes , Miguel EP Silva , David Aparicio, and Fernando Silva. A survey on subgraph counting: Concepts, algorithms, and applications to network motifs and graphlets. ACM Computing Surveys (CSUR), 54(2):1--36 , 2021 . Pedro Ribeiro, Pedro Paredes, Miguel EP Silva, David Aparicio, and Fernando Silva. A survey on subgraph counting: Concepts, algorithms, and applications to network motifs and graphlets. ACM Computing Surveys (CSUR), 54(2):1--36, 2021."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11277"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2025113.2025133"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0466-x"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488502"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0406024101"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411862"},{"key":"e_1_3_2_2_47_1","first-page":"763","volume-title":"13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18)","author":"Wang Kai","year":"2018","unstructured":"Kai Wang , Zhiqiang Zuo , John Thorpe , Tien Quang Nguyen , and Guoqing Harry Xu. 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) , pages 763 -- 782 , 2018 . Kai Wang, Zhiqiang Zuo, John Thorpe, Tien Quang Nguyen, and Guoqing Harry Xu. 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), pages 763--782, 2018."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498312"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/ICDM.2002.1184038","volume-title":"2002 IEEE International Conference on Data Mining, 2002. Proceedings.","author":"Yan Xifeng","year":"2002","unstructured":"Xifeng Yan and Jiawei Han . gspan : graph-based substructure pattern mining . In 2002 IEEE International Conference on Data Mining, 2002. Proceedings. , pages 721 -- 724 , 2002 . Xifeng Yan and Jiawei Han. gspan: graph-based substructure pattern mining. In 2002 IEEE International Conference on Data Mining, 2002. Proceedings., pages 721--724, 2002."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"}],"event":{"name":"PACT '22: International Conference on Parallel Architectures and Compilation Techniques","location":"Chicago Illinois","acronym":"PACT '22","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","IFIP WG 10.3 IFIP WG 10.3","IEEE CS"]},"container-title":["Proceedings of the International Conference on Parallel Architectures and Compilation Techniques"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3559009.3569658","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3559009.3569658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:38Z","timestamp":1750186958000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3559009.3569658"}},"subtitle":["A Framework for Applying Random Sampling to Subgraph Pattern Mining through Loop Perforation"],"short-title":[],"issued":{"date-parts":[[2022,10,8]]},"references-count":50,"alternative-id":["10.1145\/3559009.3569658","10.1145\/3559009"],"URL":"https:\/\/doi.org\/10.1145\/3559009.3569658","relation":{},"subject":[],"published":{"date-parts":[[2022,10,8]]},"assertion":[{"value":"2023-01-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}