{"id":"https://openalex.org/W3170379488","doi":"https://doi.org/10.1145/3447548.3467219","title":"Accelerating Set Intersections over Graphs by Reducing-Merging","display_name":"Accelerating Set Intersections over Graphs by Reducing-Merging","publication_year":2021,"publication_date":"2021-08-12","ids":{"openalex":"https://openalex.org/W3170379488","doi":"https://doi.org/10.1145/3447548.3467219","mag":"3170379488"},"language":"en","primary_location":{"id":"doi:10.1145/3447548.3467219","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3447548.3467219","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining","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/A5101658368","display_name":"Weiguo Zheng","orcid":"https://orcid.org/0000-0003-1200-7368"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Weiguo Zheng","raw_affiliation_strings":["Fudan University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Fudan University, Shanghai, China","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100629264","display_name":"Y. F. Yang","orcid":"https://orcid.org/0000-0003-4237-5874"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yifan Yang","raw_affiliation_strings":["Fudan University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Fudan University, Shanghai, China","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023644315","display_name":"Chengzhi Piao","orcid":"https://orcid.org/0009-0003-4942-0815"},"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":"Chengzhi Piao","raw_affiliation_strings":["Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"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/A5101658368"],"corresponding_institution_ids":["https://openalex.org/I24943067"],"apc_list":null,"apc_paid":null,"fwci":0.5764,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.67720588,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2349","last_page":"2359"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9962999820709229,"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.9958000183105469,"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.5180532932281494},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.508366048336029},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5064197778701782},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.5005862712860107},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4797588288784027},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.44274380803108215},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39282602071762085},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3668442368507385},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.359773725271225},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3422619104385376},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2980327010154724},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14320874214172363},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.08672302961349487}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5180532932281494},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.508366048336029},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5064197778701782},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.5005862712860107},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4797588288784027},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.44274380803108215},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39282602071762085},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3668442368507385},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.359773725271225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3422619104385376},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2980327010154724},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14320874214172363},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.08672302961349487},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3447548.3467219","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3447548.3467219","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.4300000071525574}],"awards":[{"id":"https://openalex.org/G5493607173","display_name":null,"funder_award_id":"61902074","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W1582397847","https://openalex.org/W1994727615","https://openalex.org/W1994840070","https://openalex.org/W1998341696","https://openalex.org/W2004951603","https://openalex.org/W2012720017","https://openalex.org/W2029852131","https://openalex.org/W2035173902","https://openalex.org/W2045660197","https://openalex.org/W2053550438","https://openalex.org/W2060778826","https://openalex.org/W2116007667","https://openalex.org/W2147405597","https://openalex.org/W2157405322","https://openalex.org/W2249320699","https://openalex.org/W2292193262","https://openalex.org/W2399701057","https://openalex.org/W2612032746","https://openalex.org/W2623521343","https://openalex.org/W2759878005","https://openalex.org/W2799267250","https://openalex.org/W2917106292","https://openalex.org/W2948359422","https://openalex.org/W2966124701","https://openalex.org/W3101346938","https://openalex.org/W3123260685","https://openalex.org/W4244579861"],"related_works":["https://openalex.org/W1913458311","https://openalex.org/W2567779821","https://openalex.org/W2950880198","https://openalex.org/W4297854970","https://openalex.org/W2040062736","https://openalex.org/W2951262621","https://openalex.org/W1738343536","https://openalex.org/W2953260685","https://openalex.org/W4366999499","https://openalex.org/W2950236379"],"abstract_inverted_index":{"Given":[0],"two":[1,63,130],"sets":[2,64],"of":[3,8,115,152],"vertices":[4,71],"Sa":[5],"and":[6,33,119,135],"Sb":[7],"a":[9,50,141],"graph,":[10],"computing":[11],"their":[12],"common":[13],"vertices,":[14,110],"namely":[15],"set":[16,38,55],"intersection,":[17],"is":[18,40],"one":[19],"primitive":[20],"operation":[21],"in":[22],"many":[23],"graph":[24],"algorithms":[25,128],"such":[26],"as":[27],"triangle":[28],"counting,":[29],"maximal":[30],"clique":[31],"enumeration,":[32],"subgraph":[34],"matching.":[35],"Thus,":[36],"accelerating":[37],"intersections":[39,56],"beneficial":[41],"to":[42,146,167],"these":[43],"algorithms.":[44],"In":[45,66],"the":[46,62,67,70,76,83,88,91,98,104,109,113,148,168],"paper,":[47],"we":[48,111,139],"propose":[49],"novel":[51,142],"reducing-merging":[52],"framework":[53],"for":[54,129],"over":[57,155],"graphs":[58,157],"rather":[59],"than":[60],"intersecting":[61],"directly.":[65],"reducing":[68],"phase,":[69],"that":[72,107,159],"cannot":[73],"fall":[74],"into":[75],"intersection":[77,92,134],"are":[78],"screened":[79],"out":[80],"by":[81],"applying":[82],"range":[84,105,116],"reduction.":[85],"Based":[86],"on":[87],"truncated":[89],"subsets,":[90],"can":[93,162],"be":[94],"easily":[95],"obtained":[96],"using":[97],"classic":[99],"merging":[100,144],"algorithm.":[101,170],"To":[102],"optimize":[103],"codes":[106],"sketch":[108],"formulate":[112],"problem":[114],"code":[117],"optimization":[118],"prove":[120],"its":[121],"NP-hardness.":[122],"We":[123],"develop":[124],"efficient":[125],"yet":[126],"effective":[127],"typical":[131],"scenarios":[132],"global":[133],"local":[136],"intersection.":[137],"Moreover,":[138],"present":[140],"two-level":[143],"algorithm":[145],"enhance":[147],"performance.":[149],"The":[150],"results":[151],"extensive":[153],"experiments":[154],"real":[156],"show":[158],"our":[160],"approach":[161],"achieve":[163],"significant":[164],"speedups":[165],"compared":[166],"merge-based":[169]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}