{"id":"https://openalex.org/W2799267250","doi":"https://doi.org/10.1145/3183713.3196924","title":"Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions","display_name":"Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions","publication_year":2018,"publication_date":"2018-05-25","ids":{"openalex":"https://openalex.org/W2799267250","doi":"https://doi.org/10.1145/3183713.3196924","mag":"2799267250"},"language":"en","primary_location":{"id":"doi:10.1145/3183713.3196924","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3183713.3196924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 International Conference on Management of Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101905319","display_name":"Shuo Han","orcid":"https://orcid.org/0009-0007-9788-2087"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shuo Han","raw_affiliation_strings":["Peking University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033785339","display_name":"Lei Zou","orcid":"https://orcid.org/0000-0002-8586-4400"},"institutions":[{"id":"https://openalex.org/I20231570","display_name":"Peking University","ror":"https://ror.org/02v51f717","country_code":"CN","type":"education","lineage":["https://openalex.org/I20231570"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lei Zou","raw_affiliation_strings":["Peking University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Peking University, Beijing, China","institution_ids":["https://openalex.org/I20231570"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075642293","display_name":"Jeffrey Xu Yu","orcid":"https://orcid.org/0000-0002-9738-827X"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jeffrey Xu Yu","raw_affiliation_strings":["The Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101905319"],"corresponding_institution_ids":["https://openalex.org/I20231570"],"apc_list":null,"apc_paid":null,"fwci":3.3997,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.94575872,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1587","last_page":"1602"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8300700187683105},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.7463038563728333},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5050273537635803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4749707877635956},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4737585186958313},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4662802219390869},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4423525333404541},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.43578898906707764}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8300700187683105},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.7463038563728333},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5050273537635803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4749707877635956},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4737585186958313},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4662802219390869},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4423525333404541},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.43578898906707764},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3183713.3196924","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3183713.3196924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:opus.lib.uts.edu.au:10453/133012","is_oa":false,"landing_page_url":"http://hdl.handle.net/10453/133012","pdf_url":null,"source":{"id":"https://openalex.org/S4306401357","display_name":"UTS ePRESS (University of Technology Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114017466","host_organization_name":"University of Technology Sydney","host_organization_lineage":["https://openalex.org/I114017466"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceeding"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W1556741196","https://openalex.org/W1567562836","https://openalex.org/W1582397847","https://openalex.org/W1994840070","https://openalex.org/W1998676013","https://openalex.org/W2004951603","https://openalex.org/W2011039300","https://openalex.org/W2012720017","https://openalex.org/W2013414394","https://openalex.org/W2022490362","https://openalex.org/W2025244835","https://openalex.org/W2029852131","https://openalex.org/W2035173902","https://openalex.org/W2037487875","https://openalex.org/W2053550438","https://openalex.org/W2060778826","https://openalex.org/W2061997675","https://openalex.org/W2063039343","https://openalex.org/W2096496252","https://openalex.org/W2116007667","https://openalex.org/W2119757574","https://openalex.org/W2125895010","https://openalex.org/W2140944908","https://openalex.org/W2147076738","https://openalex.org/W2147405597","https://openalex.org/W2157405322","https://openalex.org/W2163422235","https://openalex.org/W2164928285","https://openalex.org/W2232813226","https://openalex.org/W2249320699","https://openalex.org/W2292193262","https://openalex.org/W2399701057","https://openalex.org/W2419855244","https://openalex.org/W2444127451","https://openalex.org/W2495876702","https://openalex.org/W2586844605","https://openalex.org/W2613215397","https://openalex.org/W2623521343","https://openalex.org/W2755088640","https://openalex.org/W2951870329","https://openalex.org/W3101346938","https://openalex.org/W3123260685","https://openalex.org/W3124442824","https://openalex.org/W4244579861"],"related_works":["https://openalex.org/W2291920536","https://openalex.org/W2022397046","https://openalex.org/W2162726111","https://openalex.org/W1603583590","https://openalex.org/W338671845","https://openalex.org/W2286348849","https://openalex.org/W2018511057","https://openalex.org/W2478126787","https://openalex.org/W1587248296","https://openalex.org/W2063770303"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,75,107,119,155],"focus":[4],"on":[5],"accelerating":[6],"a":[7,17,35,45,54,90,99,163],"widely":[8],"employed":[9],"computing":[10],"pattern":[11],"---":[12,113],"set":[13,32,46,185],"intersection,":[14],"to":[15,166,175],"boost":[16],"group":[18],"of":[19,61,80,127,133,144,147,184],"graph":[20,40,138,188],"algorithms.":[21,41],"Graph's":[22],"adjacency-lists":[23],"can":[24,161,180],"be":[25],"naturally":[26],"considered":[27],"as":[28,141],"node":[29,122],"sets,":[30],"thus":[31],"intersection":[33,47,128,186],"is":[34,73],"primitive":[36],"operation":[37],"in":[38,83,98,110,187],"many":[39],"We":[42,87,135,171],"propose":[43,156],"QFilter,":[44],"algorithm":[48,159],"using":[49],"SIMD":[50,65],"instructions.":[51,66],"QFilter":[52,104],"adopts":[53],"merge-based":[55],"framework":[56],"and":[57,105,115,149],"compares":[58],"two":[59,111],"blocks":[60],"elements":[62],"iteratively":[63],"by":[64,129],"The":[67],"key":[68],"insight":[69],"for":[70],"our":[71,178],"improvement":[72],"that":[74,95,121,160,177],"quickly":[76],"filter":[77],"out":[78],"most":[79],"unnecessary":[81],"comparisons":[82],"one":[84],"byte-checking":[85],"step.":[86],"also":[88],"present":[89],"binary":[91],"representation":[92],"called":[93],"BSR":[94],"encodes":[96],"sets":[97],"compact":[100],"layout.":[101],"By":[102],"combining":[103],"BSR,":[106,148],"achieve":[108],"data-parallelism":[109],"levels":[112],"inter-chunk":[114],"intra-chunk":[116,169],"parallelism.":[117,170],"Moreover,":[118],"find":[120,162],"ordering":[123,165],"impacts":[124],"the":[125,131,137,145,168,182],"performance":[126,183],"affecting":[130],"compactness":[132,146],"BSR.":[134],"formulate":[136],"reordering":[139],"problem":[140],"an":[142,157],"optimization":[143],"prove":[150],"its":[151],"strong":[152],"NP-completeness.":[153],"Thus":[154],"approximate":[158],"better":[164],"enhance":[167],"conduct":[172],"extensive":[173],"experiments":[174],"confirm":[176],"approach":[179],"improve":[181],"algorithms":[189],"significantly.":[190]},"counts_by_year":[{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}