{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:06:56Z","timestamp":1765544816317,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902074"],"award-info":[{"award-number":["61902074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research Grant Council of the Hong Kong Special Administrative Region, China","award":["CUHK 14205617, CUHK 14205618"],"award-info":[{"award-number":["CUHK 14205617, CUHK 14205618"]}]},{"name":"Science and Technology Committee Shanghai Municipality","award":["19ZR1404900"],"award-info":[{"award-number":["19ZR1404900"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467219","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T06:12:05Z","timestamp":1628748725000},"page":"2349-2359","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Accelerating Set Intersections over Graphs by Reducing-Merging"],"prefix":"10.1145","author":[{"given":"Weiguo","family":"Zheng","sequence":"first","affiliation":[{"name":"Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifan","family":"Yang","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengzhi","family":"Piao","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_3_2_2_2_1","unstructured":"Daniel K. Blandford Guy E. Blelloch and Ian A. Kash. [n.d.]. Compact representations of separable graphs. In SODA. 679--688.  Daniel K. Blandford Guy E. Blelloch and Ian A. Kash. [n.d.]. Compact representations of separable graphs. In SODA. 679--688."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Paolo Boldi and Sebastiano Vigna. 2004. The webgraph framework I: compression techniques. In WWW. ACM 595--602.  Paolo Boldi and Sebastiano Vigna. 2004. The webgraph framework I: compression techniques. In WWW. ACM 595--602.","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Lijun Chang Wei Li and Wenjie Zhang. 2017. Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling. In SIGMOD. 1181--1196.  Lijun Chang Wei Li and Wenjie Zhang. 2017. Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling. In SIGMOD. 1181--1196.","DOI":"10.1145\/3035918.3035939"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043652.2043654"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Flavio Chierichetti Ravi Kumar Silvio Lattanzi Michael Mitzenmacher Alessandro Panconesi and Prabhakar Raghavan. 2009. On compressing social networks. In SIGKDD. ACM 219--228.  Flavio Chierichetti Ravi Kumar Silvio Lattanzi Michael Mitzenmacher Alessandro Panconesi and Prabhakar Raghavan. 2009. On compressing social networks. In SIGKDD. ACM 219--228.","DOI":"10.1145\/1557019.1557049"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Shumo Chu and James Cheng. 2011. Triangle listing in massive networks and its applications. In SIGKDD. 672--680.  Shumo Chu and James Cheng. 2011. Triangle listing in massive networks and its applications. In SIGKDD. 672--680.","DOI":"10.1145\/2020408.2020513"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_2_10_1","unstructured":"Erik D. Demaine Alejandro L\u00f3pez-Ortiz and J. Ian Munro. 2000. Adaptive set intersections unions and differences. In SODA. 743--752.  Erik D. Demaine Alejandro L\u00f3pez-Ortiz and J. Ian Munro. 2000. Adaptive set intersections unions and differences. In SODA. 743--752."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Laxman Dhulipala Igor Kabiljo Brian Karrer Giuseppe Ottaviano Sergey Pupyrev and Alon Shalita. 2016. Compressing Graphs and Indexes with Recursive Graph Bisection. In SIGKDD. ACM 1535--1544.  Laxman Dhulipala Igor Kabiljo Brian Karrer Giuseppe Ottaviano Sergey Pupyrev and Alon Shalita. 2016. Compressing Graphs and Indexes with Recursive Graph Bisection. In SIGKDD. ACM 1535--1544.","DOI":"10.1145\/2939672.2939862"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/1938545.1938550"},{"key":"e_1_3_2_2_13_1","volume-title":"Maarten L\u00f6 ffler, and Darren Strash","author":"Eppstein David","year":"2010","unstructured":"David Eppstein , Maarten L\u00f6 ffler, and Darren Strash . 2010 . Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. In ISAAC (Lecture Notes in Computer Science , Vol. 6506), Otfried Cheong, Kyung-Yong Chwa, and Kunsoo Park (Eds.). Springer, 403-- 414 . David Eppstein, Maarten L\u00f6 ffler, and Darren Strash. 2010. Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. In ISAAC (Lecture Notes in Computer Science, Vol. 6506), Otfried Cheong, Kyung-Yong Chwa, and Kunsoo Park (Eds.). Springer, 403--414."},{"key":"e_1_3_2_2_14_1","volume-title":"Johnson","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and David S . Johnson . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman . M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman."},{"key":"e_1_3_2_2_15_1","unstructured":"Myoungji Han Hyunjoon Kim Geonmo Gu Kunsoo Park and Wook-Shin Han. 2019. Efficient Subgraph Matching: Harmonizing Dynamic Programming Adaptive Matching Order and Failing Set Together. In SIGMOD. 1429--1446.  Myoungji Han Hyunjoon Kim Geonmo Gu Kunsoo Park and Wook-Shin Han. 2019. Efficient Subgraph Matching: Harmonizing Dynamic Programming Adaptive Matching Order and Failing Set Together. In SIGMOD. 1429--1446."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Shuo Han Lei Zou and Jeffrey Xu Yu. 2018. Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions. In SIGMOD. 1587--1602.  Shuo Han Lei Zou and Jeffrey Xu Yu. 2018. Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions. In SIGMOD. 1587--1602.","DOI":"10.1145\/3183713.3196924"},{"key":"e_1_3_2_2_17_1","unstructured":"Wook-Shin Han Jinsoo Lee and Jeong-Hoon Lee. [n.d.]. Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In SIGMOD. 337--348.  Wook-Shin Han Jinsoo Lee and Jeong-Hoon Lee. [n.d.]. Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In SIGMOD. 337--348."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735518"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"J\u00e9r\u00f4 me Kunegis. 2013. KONECT: the Koblenz network collection. In WWW. 1343--1350.  J\u00e9r\u00f4 me Kunegis. 2013. KONECT: the Koblenz network collection. In WWW. 1343--1350.","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2560"},{"key":"e_1_3_2_2_22_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2320716"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Smit Patel and Kamath S Sowmya. 2014. Comparative analysis of Vertex Cover computation algorithms for varied graphs. In ICCSP .  Smit Patel and Kamath S Sowmya. 2014. Comparative analysis of Vertex Cover computation algorithms for varied graphs. In ICCSP .","DOI":"10.1109\/ICCSP.2014.6950106"},{"key":"e_1_3_2_2_25_1","unstructured":"Benjamin Schlegel Thomas Willhalm and Wolfgang Lehner. 2011. Fast Sorted-Set Intersection using SIMD Instructions. In ADMS. 1--8.  Benjamin Schlegel Thomas Willhalm and Wolfgang Lehner. 2011. Fast Sorted-Set Intersection using SIMD Instructions. In ADMS. 1--8."},{"key":"e_1_3_2_2_26_1","unstructured":"Julian Shun. [n.d.]. Shared-memory parallelism can be simple fast and scalable. In Morgan & Claypool.  Julian Shun. [n.d.]. Shared-memory parallelism can be simple fast and scalable. In Morgan & Claypool."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Julian Shun and Kanat Tangwongsan. 2015. Multicore triangle computations without tuning. In ICDE. 149--160.  Julian Shun and Kanat Tangwongsan. 2015. Multicore triangle computations without tuning. In ICDE. 149--160.","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"e_1_3_2_2_28_1","volume-title":"Berkant Barla Cambazoglu, and Vassilis Plachouras","author":"Tatikonda Shirish","year":"2009","unstructured":"Shirish Tatikonda , Flavio Junqueira , Berkant Barla Cambazoglu, and Vassilis Plachouras . 2009 . On Efficient Posting List Intersection with Multicore Processors . (2009), 738--739. Shirish Tatikonda, Flavio Junqueira, Berkant Barla Cambazoglu, and Vassilis Plachouras. 2009. On Efficient Posting List Intersection with Multicore Processors. (2009), 738--739."},{"key":"e_1_3_2_2_29_1","volume-title":"Can Lu, and Xuemin Lin.","author":"Wei Hao","year":"2016","unstructured":"Hao Wei , Jeffrey Xu Yu , Can Lu, and Xuemin Lin. 2016 . Speedup Graph Processing by Graph Ordering. In SIGMOD. 1813--1828. Hao Wei, Jeffrey Xu Yu, Can Lu, and Xuemin Lin. 2016. Speedup Graph Processing by Graph Ordering. In SIGMOD. 1813--1828."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339491"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303756"}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Virtual Event Singapore","acronym":"KDD '21"},"container-title":["Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467219","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467219","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:28Z","timestamp":1750191508000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":31,"alternative-id":["10.1145\/3447548.3467219","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467219","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}