{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T15:39:53Z","timestamp":1771515593896,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Research Grant Council of Hong Kong SAR China","award":["14221716"],"award-info":[{"award-number":["14221716"]}]},{"name":"National Natural Science Foundation of China","award":["61532010"],"award-info":[{"award-number":["61532010"]}]},{"name":"National Natural Science Foundation of China","award":["61622201"],"award-info":[{"award-number":["61622201"]}]},{"name":"the National Key Research and Development Program of China","award":["2016YFB1000603"],"award-info":[{"award-number":["2016YFB1000603"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3183713.3196924","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"1587-1602","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":63,"title":["Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions"],"prefix":"10.1145","author":[{"given":"Shuo","family":"Han","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Lei","family":"Zou","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"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\/s00224-006-1350-7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002974.2002975"},{"key":"e_1_3_2_1_4_1","volume-title":"A fast set intersection algorithm for sorted sequences CPM","author":"Baeza-Yates Ricardo","unstructured":"Ricardo Baeza-Yates . 2004. A fast set intersection algorithm for sorted sequences CPM . Springer , 400--408. Ricardo Baeza-Yates. 2004. A fast set intersection algorithm for sorted sequences CPM. Springer, 400--408."},{"key":"e_1_3_2_1_5_1","volume-title":"Adaptive intersection and t-threshold problems","author":"Barbay J\u00e9r\u00e9my","unstructured":"J\u00e9r\u00e9my Barbay and Claire Kenyon . 2002. Adaptive intersection and t-threshold problems . In SODA. Society for Industrial and Applied Mathematics , 390--399. J\u00e9r\u00e9my Barbay and Claire Kenyon. 2002. Adaptive intersection and t-threshold problems. In SODA. Society for Industrial and Applied Mathematics, 390--399."},{"key":"e_1_3_2_1_6_1","volume-title":"Compact representations of separable graphs","author":"Blandford Daniel K","unstructured":"Daniel K Blandford , Guy E Blelloch , and Ian A Kash . 2003. Compact representations of separable graphs . In SODA. Society for Industrial and Applied Mathematics , 679--688. Daniel K Blandford, Guy E Blelloch, and Ian A Kash . 2003. Compact representations of separable graphs. In SODA. Society for Industrial and Applied Mathematics, 679--688."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277660"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.07.018"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020513"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463722"},{"key":"e_1_3_2_1_14_1","unstructured":"Erik D Demaine Alejandro L\u00f3pez-Ortiz and J Ian Munro. 2000. Adaptive set intersections unions and differences SODA. Citeseer.   Erik D Demaine Alejandro L\u00f3pez-Ortiz and J Ian Munro. 2000. Adaptive set intersections unions and differences SODA. Citeseer."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939862"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/1938545.1938550"},{"key":"e_1_3_2_1_17_1","volume-title":"Listing all maximal cliques in sparse graphs in near-optimal time ISAAC","author":"Eppstein David","unstructured":"David Eppstein , Maarten L\u00f6ffler , and Darren Strash . 2010. Listing all maximal cliques in sparse graphs in near-optimal time ISAAC . Springer , 403--414. David Eppstein, Maarten L\u00f6ffler, and Darren Strash. 2010. Listing all maximal cliques in sparse graphs in near-optimal time ISAAC. Springer, 403--414."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2747642"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2017.01.026"},{"key":"e_1_3_2_1_20_1","unstructured":"Michael R Gary and David S Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. (1979).   Michael R Gary and David S Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. (1979)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735518"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_1_25_1","unstructured":"Ilya Katsov. 2012. Fast intersection of sorted lists using SSE instructions. (2012). https:\/\/highlyscalable.wordpress.com\/2012\/06\/05\/fast-intersection-sorted-lists-sse\/  Ilya Katsov. 2012. Fast intersection of sorted lists using SSE instructions. (2012). https:\/\/highlyscalable.wordpress.com\/2012\/06\/05\/fast-intersection-sorted-lists-sse\/"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2326"},{"key":"e_1_3_2_1_28_1","volume-title":"Roaring bitmaps: Implementation of an optimized software library. SPE","author":"Lemire Daniel","year":"2017","unstructured":"Daniel Lemire , Owen Kaser , Nathan Kurz , Luca Deri , Chris O'Hara , Franccois Saint-Jacques , and Gregory Ssi-Yan-Kai . 2017. Roaring bitmaps: Implementation of an optimized software library. SPE ( 2017 ). Daniel Lemire, Owen Kaser, Nathan Kurz, Luca Deri, Chris O'Hara, Franccois Saint-Jacques, and Gregory Ssi-Yan-Kai. 2017. Roaring bitmaps: Implementation of an optimized software library. SPE (2017)."},{"key":"e_1_3_2_1_29_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (2014).  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (2014)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2320716"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"e_1_3_2_1_32_1","unstructured":"Benjamin Schlegel Thomas Willhalm and Wolfgang Lehner. 2011. Fast sorted-Set intersection using SIMD instructions ADMS@VLDB. 1--8.  Benjamin Schlegel Thomas Willhalm and Wolfgang Lehner. 2011. Fast sorted-Set intersection using SIMD instructions ADMS@VLDB. 1--8."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Julian Shun. 2017. Shared-memory parallelism can be simple fast and scalable. Morgan &Claypool.   Julian Shun. 2017. Shared-memory parallelism can be simple fast and scalable. Morgan &Claypool.","DOI":"10.1145\/3018787"},{"key":"e_1_3_2_1_34_1","volume-title":"Multicore triangle computations without tuning","author":"Shun Julian","unstructured":"Julian Shun and Kanat Tangwongsan . 2015. Multicore triangle computations without tuning . In ICDE. IEEE , 149--160. Julian Shun and Kanat Tangwongsan. 2015. Multicore triangle computations without tuning. In ICDE. IEEE, 149--160."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572104"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687722"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064007"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/1921071.1921073"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915220"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687671"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915205"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564709"}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston TX USA","acronym":"SIGMOD\/PODS '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2018 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196924","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:28Z","timestamp":1750208908000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":43,"alternative-id":["10.1145\/3183713.3196924","10.1145\/3183713"],"URL":"https:\/\/doi.org\/10.1145\/3183713.3196924","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}