{"id":"https://openalex.org/W4223472867","doi":"https://doi.org/10.1145/3512769","title":"Joinable Parallel Balanced Binary Trees","display_name":"Joinable Parallel Balanced Binary Trees","publication_year":2022,"publication_date":"2022-04-11","ids":{"openalex":"https://openalex.org/W4223472867","doi":"https://doi.org/10.1145/3512769"},"language":"en","primary_location":{"id":"doi:10.1145/3512769","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3512769","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3512769","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3512769","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Guy Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":"https://orcid.org/0000-0003-0224-9187","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014229496","display_name":"Daniel Ferizovic","orcid":"https://orcid.org/0000-0002-9450-8619"},"institutions":[{"id":"https://openalex.org/I102335020","display_name":"Karlsruhe Institute of Technology","ror":"https://ror.org/04t3en479","country_code":"DE","type":"education","lineage":["https://openalex.org/I102335020","https://openalex.org/I1305996414"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Ferizovic","raw_affiliation_strings":["Karlsruhe Institute of Technology, Karlsruhe, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Karlsruhe Institute of Technology, Karlsruhe, Germany","institution_ids":["https://openalex.org/I102335020"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004374151","display_name":"Yihan Sun","orcid":"https://orcid.org/0000-0002-3212-0934"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yihan Sun","raw_affiliation_strings":["University of California, Riverside, CA, USA"],"raw_orcid":"https://orcid.org/0000-0002-3212-0934","affiliations":[{"raw_affiliation_string":"University of California, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033930662"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":5.698,"has_fulltext":true,"cited_by_count":40,"citation_normalized_percentile":{"value":0.96299935,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"9","issue":"2","first_page":"1","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7330853343009949},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.6827032566070557},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5703476667404175},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5474522709846497},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5388190150260925},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4997398853302002},{"id":"https://openalex.org/keywords/set-operations","display_name":"Set operations","score":0.4584391415119171},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4208880364894867},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.4196149706840515},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.41959571838378906},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4133976101875305},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3952440619468689},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.39044156670570374},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31678277254104614},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.27080196142196655},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.16300725936889648}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7330853343009949},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.6827032566070557},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5703476667404175},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5474522709846497},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5388190150260925},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4997398853302002},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.4584391415119171},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4208880364894867},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.4196149706840515},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.41959571838378906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4133976101875305},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3952440619468689},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.39044156670570374},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31678277254104614},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.27080196142196655},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.16300725936889648},{"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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3512769","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3512769","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3512769","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3512769","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3512769","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3512769","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1814763051","display_name":"AF: Small: Shared-Memory Parallel Algorithms: Theory and Practice","funder_award_id":"1910030","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6550909468","display_name":null,"funder_award_id":"CCF-1919223","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7081150942","display_name":null,"funder_award_id":"CCF-1901381, CCF-1910030, and CCF-1919223","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7587430710","display_name":"SHF: Medium: Algorithmic lambda-Calculus for the Design, Analysis, and Implementation of Parallel Algorithms","funder_award_id":"1901381","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G82646606","display_name":"SPX: Parallel Models and Algorithms for Emerging Memory Systems","funder_award_id":"1919223","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8505467603","display_name":null,"funder_award_id":"2103483","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4223472867.pdf","grobid_xml":"https://content.openalex.org/works/W4223472867.grobid-xml"},"referenced_works_count":57,"referenced_works":["https://openalex.org/W23033198","https://openalex.org/W86593919","https://openalex.org/W104040549","https://openalex.org/W172574161","https://openalex.org/W1504640095","https://openalex.org/W1529638252","https://openalex.org/W1589951597","https://openalex.org/W1963674762","https://openalex.org/W1964669678","https://openalex.org/W1965601023","https://openalex.org/W1966797788","https://openalex.org/W1972027649","https://openalex.org/W1984604031","https://openalex.org/W1985229168","https://openalex.org/W1998676013","https://openalex.org/W2006795057","https://openalex.org/W2009122662","https://openalex.org/W2015255856","https://openalex.org/W2016559894","https://openalex.org/W2017602223","https://openalex.org/W2026166434","https://openalex.org/W2041645394","https://openalex.org/W2065209187","https://openalex.org/W2068096826","https://openalex.org/W2069153338","https://openalex.org/W2071391045","https://openalex.org/W2086664713","https://openalex.org/W2099844038","https://openalex.org/W2104680817","https://openalex.org/W2110692415","https://openalex.org/W2117572751","https://openalex.org/W2119251905","https://openalex.org/W2130566259","https://openalex.org/W2145795182","https://openalex.org/W2165663045","https://openalex.org/W2182283312","https://openalex.org/W2412642011","https://openalex.org/W2431458507","https://openalex.org/W2582648489","https://openalex.org/W2786504829","https://openalex.org/W2798418112","https://openalex.org/W2804736231","https://openalex.org/W2808282456","https://openalex.org/W2809114684","https://openalex.org/W2914535731","https://openalex.org/W2928783453","https://openalex.org/W2963212338","https://openalex.org/W2963374841","https://openalex.org/W2963973157","https://openalex.org/W2963992435","https://openalex.org/W2982604121","https://openalex.org/W3041171185","https://openalex.org/W3106396992","https://openalex.org/W3124031623","https://openalex.org/W4210777595","https://openalex.org/W6685798501","https://openalex.org/W6765902083"],"related_works":["https://openalex.org/W2061004850","https://openalex.org/W2501849745","https://openalex.org/W3169685561","https://openalex.org/W2004985727","https://openalex.org/W2082860502","https://openalex.org/W2038309235","https://openalex.org/W2364382882","https://openalex.org/W1979520615","https://openalex.org/W2072157347","https://openalex.org/W2112680985"],"abstract_inverted_index":{"In":[0,235],"this":[1],"article,":[2],"we":[3,92,167],"show":[4,63,173,273],"how":[5],"a":[6,41,77,116,169],"single":[7],"function,":[8],"join":[9,29,66],",":[10,30,128,130,132,134,136,138,140,142,197,199],"can":[11],"be":[12],"used":[13],"to":[14,34,94,123,172],"implement":[15],"parallel":[16,279],"balanced":[17,36],"binary":[18],"search":[19],"trees":[20,75],"(":[21],"BSTs":[22],")":[23],"simply":[24],"and":[25,40,48,112,143,166,200,208,218,226,281],"efficiently.":[26],"Based":[27],"on":[28,230,265,302],"our":[31,52,228,275,282],"approach":[32],"applies":[33],"multiple":[35],"tree":[37,80,119,247],"data":[38],"structures,":[39],"variety":[42,78,117],"of":[43,79,118,147],"functions":[44],"for":[45,73,76,178,211],"ordered":[46],"sets":[47],"maps.":[49],"We":[50,62,98,114,224],"describe":[51],"technique":[53],"as":[54,82,84,95],"an":[55],"algorithmic":[56],"framework":[57],"called":[58],"join-based":[59],"algorithms":[60,120,152,159,182,229],".":[61,223],"that":[64,103,121,274],"the":[65,85,163,174,193,231,245,250,254,292],"function":[67],"fully":[68],"captures":[69],"what":[70],"is":[71],"needed":[72],"rebalancing":[74],"algorithms,":[81],"long":[83],"balancing":[86,101,156,233],"scheme":[87],"satisfies":[88],"certain":[89],"properties,":[90],"which":[91],"refer":[93],"joinable":[96,124,179],"trees.":[97,180],"discuss":[99],"four":[100,232,238],"schemes":[102,239],"are":[104,153,160,183],"joinable:":[105],"AVL":[106],"trees,":[107,109,111,125],"red-black":[108],"weight-balanced":[110,246],"treaps.":[113],"present":[115],"apply":[122],"including":[126],"insert":[127],"delete":[129],"union":[131,196],"intersection":[133,198],"difference":[135,201],"split":[137],"range":[139],"filter":[141],"so":[144],"on,":[145],"most":[146],"them":[148],"also":[149,272],"parallel.":[150],"These":[151],"generic":[154],"across":[155],"schemes.":[157,234],"Many":[158],"optimal":[161],"in":[162,176,296],"comparison":[164],"model,":[165],"provide":[168],"general":[170],"proof":[171],"efficiency":[175],"work":[177,203],"The":[181],"highly":[184],"parallel,":[185],"all":[186,237],"with":[187],"polylogarithmic":[188,209],"span":[189,210],"(parallel":[190],"dependence).":[191],"Specifically,":[192],"set-set":[194],"operations":[195],"have":[202,240,253],"\\(":[204,215,219,261],"O(m\\log":[205],"(\\frac{n}{m}+1))":[206],"\\)":[207,217,222,263],"input":[212,304],"set":[213],"sizes":[214],"n":[216,221],"m\\le":[220],"implemented":[225],"tested":[227],"general,":[236],"quite":[241],"similar":[242],"performance,":[243],"but":[244],"slightly":[248],"outperforms":[249,277],"others.":[251],"They":[252],"same":[255],"speedup":[256,264],"characteristics,":[257],"getting":[258],"around":[259],"73":[260],"\\times":[262],"72":[266],"cores":[267],"(144":[268],"hyperthreads).":[269],"Experimental":[270],"results":[271],"implementation":[276],"existing":[278],"implementations,":[280],"sequential":[283,293],"version":[284],"achieves":[285],"close":[286],"or":[287],"much":[288],"better":[289],"performance":[290],"than":[291],"merging":[294],"algorithm":[295],"C++":[297],"Standard":[298],"Template":[299],"Library":[300],"(STL)":[301],"various":[303],"sizes.":[305]},"counts_by_year":[{"year":2025,"cited_by_count":34},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}