{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:27:00Z","timestamp":1750220820805,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T00:00:00Z","timestamp":1599436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China","award":["61832007 61622403 61621091 U19B2019"],"award-info":[{"award-number":["61832007 61622403 61621091 U19B2019"]}]},{"name":"National Key Research and Development Program of China","award":["2017YFA0207600"],"award-info":[{"award-number":["2017YFA0207600"]}]},{"name":"China Postdoctoral Science Foundation","award":["2019M660641"],"award-info":[{"award-number":["2019M660641"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,9,7]]},"DOI":"10.1145\/3386263.3406912","type":"proceedings-article","created":{"date-parts":[[2020,9,4]],"date-time":"2020-09-04T21:34:20Z","timestamp":1599255260000},"page":"357-362","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["An Order Sampling Processing-in-Memory Architecture for Approximate Graph Pattern Mining"],"prefix":"10.1145","author":[{"given":"Ziqian","family":"Wan","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohao","family":"Dai","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun Joon","family":"Soh","sequence":"additional","affiliation":[{"name":"University of California, San Diego, San Diego, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jishen","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of California, San Diego, San Diego, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Wang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,9,7]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872887.2750386"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433496"},{"key":"e_1_3_2_2_3_1","first-page":"640","article-title":"Graphh: A processing-in-memory architecture for largescale graph processing","volume":"38","author":"Guohao Dai","year":"2018","journal-title":"IEEE TCAD"},{"volume-title":"Powergraph: Distributed graph-parallel computation on natural graphs. In OSDI. 17--30.","year":"2012","author":"Gonzalez Joseph E","key":"e_1_3_2_2_4_1"},{"volume-title":"ASAP: Fast, Approximate Graph Pattern Mining at Scale. In OSDI. 745--761.","year":"2018","author":"Iyer Anand Padmanabha","key":"e_1_3_2_2_5_1"},{"volume-title":"Pegasus: A peta-scale graph mining system implementation and observations. In SIGMOD.","year":"2009","author":"Kang U","key":"e_1_3_2_2_6_1"},{"key":"e_1_3_2_2_7_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014). Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014)."},{"key":"e_1_3_2_2_8_1","unstructured":"Jure Leskovec and Julian J Mcauley. 2012. Learning to discover social circles in ego networks. In NIPS. 539--547. Jure Leskovec and Julian J Mcauley. 2012. Learning to discover social circles in ego networks. In NIPS. 539--547."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"},{"key":"e_1_3_2_2_10_1","unstructured":"Bernardete Ribeiro Ning Chen and Alexander Kovacec. 2017. Shaping graph pattern mining for financial risk. Neurocomputing shaping (2017). Bernardete Ribeiro Ning Chen and Alexander Kovacec. 2017. Shaping graph pattern mining for financial risk. Neurocomputing shaping (2017)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341161.3342890"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Ichigaku Takigawa and Hiroshi Mamitsuka. 2013. Graph mining: procedure application to drug discovery and recent advances. Drug discovery today 18 1--2 (2013) 50--57. Ichigaku Takigawa and Hiroshi Mamitsuka. 2013. Graph mining: procedure application to drug discovery and recent advances. Drug discovery today 18 1--2 (2013) 50--57.","DOI":"10.1016\/j.drudis.2012.07.016"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Carlos HC Teixeira and other. 2015. Arabesque: a system for distributed graph mining. In SOSP. ACM 425--440. Carlos HC Teixeira and other. 2015. Arabesque: a system for distributed graph mining. In SOSP. ACM 425--440.","DOI":"10.1145\/2815400.2815410"},{"key":"e_1_3_2_2_14_1","unstructured":"Kai Wang et al. 2018. RStream: marrying relational algebra with streaming for efficient graph mining on a single machine. In OSDI. 763--782. Kai Wang et al. 2018. RStream: marrying relational algebra with streaming for efficient graph mining on a single machine. In OSDI. 763--782."},{"key":"e_1_3_2_2_15_1","unstructured":"Kai Wang Guoqing Xu Zhendong Su and Yu David Liu. 2015. GraphQ: Graph Query Processing with Abstraction Refinement Scalable and Programmable Analytics over Very Large Graphs on a Single PC. In ATC. 387--401. Kai Wang Guoqing Xu Zhendong Su and Yu David Liu. 2015. GraphQ: Graph Query Processing with Abstraction Refinement Scalable and Programmable Analytics over Very Large Graphs on a Single PC. In ATC. 387--401."},{"key":"e_1_3_2_2_16_1","unstructured":"Siyuan Wang Chang Lou Rong Chen and Haibo Chen. 2018. Fast and Concurrent RDF Queries using RDMA-assisted GPU Graph Exploration. In ATC. 651--664. Siyuan Wang Chang Lou Rong Chen and Haibo Chen. 2018. Fast and Concurrent RDF Queries using RDMA-assisted GPU Graph Exploration. In ATC. 651--664."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Wei Wang Chen Wang Yongtai Zhu Baile Shi Jian Pei Xifeng Yan and Jiawei Han. 2005. Graphminer: a structural pattern-mining system for large disk-based graph databases and its applications. In SIGMOD. ACM 879--881. Wei Wang Chen Wang Yongtai Zhu Baile Shi Jian Pei Xifeng Yan and Jiawei Han. 2005. Graphminer: a structural pattern-mining system for large disk-based graph databases and its applications. In SIGMOD. ACM 879--881.","DOI":"10.1145\/1066157.1066273"},{"key":"e_1_3_2_2_18_1","unstructured":"Jaewon Yang and Jure Leskovec. 2012. Defining and Evaluating Network Communities based on Ground-truth. CoRR abs\/1205.6233 (2012). arXiv:1205.6233 http:\/\/arxiv.org\/abs\/1205.6233 Jaewon Yang and Jure Leskovec. 2012. Defining and Evaluating Network Communities based on Ground-truth. CoRR abs\/1205.6233 (2012). arXiv:1205.6233 http:\/\/arxiv.org\/abs\/1205.6233"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Mingxing Zhang et al. 2018. GraphP: Reducing communication for PIM-based graph processing with efficient data partition. In HPCA. IEEE 544--557. Mingxing Zhang et al. 2018. GraphP: Reducing communication for PIM-based graph processing with efficient data partition. In HPCA. IEEE 544--557.","DOI":"10.1109\/HPCA.2018.00053"}],"event":{"name":"GLSVLSI '20: Great Lakes Symposium on VLSI 2020","acronym":"GLSVLSI '20","location":"Virtual Event China"},"container-title":["Proceedings of the 2020 on Great Lakes Symposium on VLSI"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3386263.3406912","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3386263.3406912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:13Z","timestamp":1750201993000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3386263.3406912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,7]]},"references-count":20,"alternative-id":["10.1145\/3386263.3406912","10.1145\/3386263"],"URL":"https:\/\/doi.org\/10.1145\/3386263.3406912","relation":{},"subject":[],"published":{"date-parts":[[2020,9,7]]},"assertion":[{"value":"2020-09-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}