{"id":"https://openalex.org/W3124031623","doi":"https://doi.org/10.1145/2935764.2935768","title":"Just Join for Parallel Ordered Sets","display_name":"Just Join for Parallel Ordered Sets","publication_year":2016,"publication_date":"2016-07-08","ids":{"openalex":"https://openalex.org/W3124031623","doi":"https://doi.org/10.1145/2935764.2935768","mag":"3124031623"},"language":"en","primary_location":{"id":"doi:10.1145/2935764.2935768","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2935764.2935768","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","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/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 E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"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/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":false,"raw_author_name":"Yihan Sun","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"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.3157,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.96053919,"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":"253","last_page":"264"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9988999962806702,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9988999962806702,"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.9979000091552734,"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/T10142","display_name":"Formal Methods in Verification","score":0.9976000189781189,"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.6757251024246216},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.6726809740066528},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6708801984786987},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.6562743186950684},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5917202234268188},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.588047981262207},{"id":"https://openalex.org/keywords/set-operations","display_name":"Set operations","score":0.48735862970352173},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.46692559123039246},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.459780752658844},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.45795831084251404},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.44845104217529297},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4259554445743561},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3986368775367737},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37953874468803406},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3586147129535675},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30637240409851074},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.1792820394039154},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1542542576789856},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13953176140785217}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6757251024246216},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.6726809740066528},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6708801984786987},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.6562743186950684},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5917202234268188},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.588047981262207},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.48735862970352173},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.46692559123039246},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.459780752658844},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.45795831084251404},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.44845104217529297},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4259554445743561},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3986368775367737},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37953874468803406},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3586147129535675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30637240409851074},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.1792820394039154},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1542542576789856},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13953176140785217}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2935764.2935768","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2935764.2935768","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W23033198","https://openalex.org/W86593919","https://openalex.org/W172574161","https://openalex.org/W1513400187","https://openalex.org/W1541502153","https://openalex.org/W1589951597","https://openalex.org/W1965601023","https://openalex.org/W1966797788","https://openalex.org/W1972027649","https://openalex.org/W1998676013","https://openalex.org/W2009122662","https://openalex.org/W2015255856","https://openalex.org/W2017602223","https://openalex.org/W2018665307","https://openalex.org/W2026166434","https://openalex.org/W2039705515","https://openalex.org/W2053550438","https://openalex.org/W2065209187","https://openalex.org/W2069153338","https://openalex.org/W2099844038","https://openalex.org/W2110692415","https://openalex.org/W2117572751","https://openalex.org/W2119251905","https://openalex.org/W2130055503","https://openalex.org/W2130566259","https://openalex.org/W2431458507","https://openalex.org/W2963973157","https://openalex.org/W2963992435","https://openalex.org/W3006329258","https://openalex.org/W4236393595","https://openalex.org/W4389615622"],"related_works":["https://openalex.org/W1968269736","https://openalex.org/W4376140277","https://openalex.org/W2077383771","https://openalex.org/W2363556447","https://openalex.org/W2091985989","https://openalex.org/W2914983903","https://openalex.org/W2146997899","https://openalex.org/W1837592468","https://openalex.org/W2910653847","https://openalex.org/W1966719344"],"abstract_inverted_index":{"Ordered":[0],"sets":[1],"(and":[2],"maps":[3],"when":[4],"data":[5,19],"is":[6,92,186],"associated":[7],"with":[8],"each":[9],"key)":[10],"are":[11,28,66,115,134,146],"one":[12,125],"of":[13],"the":[14,50,58,67,77,95,113,120,129,190],"most":[15],"important":[16],"and":[17,26,35,62,79,150,166,183],"useful":[18,30],"types.":[20],"The":[21],"set-set":[22],"functions":[23],"union,":[24],"intersection":[25],"difference":[27],"particularly":[29],"in":[31,57,119],"certain":[32,181],"applications.":[33],"Brown":[34],"Tarjan":[36],"first":[37],"described":[38],"an":[39],"algorithm":[40],"for":[41,76,177],"these":[42],"functions,":[43,78],"based":[44,81],"on":[45,82],"2-3":[46],"trees,":[47,160,162],"that":[48,91,99,128,143,179],"meet":[49],"optimal":[51],"\u0398(m":[52],"log":[53],"(n/m+1))":[54],"time":[55],"bounds":[56],"comparison":[59],"model":[60],"(n":[61],"m":[63],"\u2264":[64],"n":[65],"input":[68],"sizes).":[69],"Later":[70],"Adams":[71],"showed":[72],"very":[73],"elegant":[74],"algorithms":[75,114,145,176],"others,":[80],"weight-balanced":[83],"trees.":[84],"They":[85],"only":[86],"require":[87],"a":[88],"single":[89],"function":[90,98],"specific":[93],"to":[94,108],"balancing":[96,110,158],"scheme---a":[97],"joins":[100],"two":[101],"balanced":[102,164],"trees---and":[103],"hence":[104],"can":[105],"be":[106],"applied":[107],"other":[109],"schemes.":[111,191],"Furthermore":[112],"naturally":[116],"parallel.":[117],"However,":[118],"twenty-four":[121],"years":[122],"since,":[123],"no":[124],"has":[126],"shown":[127],"algorithms,":[130],"sequential":[131],"or":[132],"parallel":[133,152],"asymptotically":[135],"work":[136,148],"optimal.":[137],"In":[138],"this":[139,170],"paper":[140],"we":[141,171],"show":[142],"Adams'":[144],"both":[147],"efficient":[149],"highly":[151],"(polylog":[153],"span)":[154],"across":[155,189],"four":[156],"different":[157],"schemes---AVL":[159],"red-black":[161],"weight":[163],"trees":[165],"treaps.":[167],"To":[168],"do":[169],"use":[172],"careful,":[173],"but":[174],"simple,":[175],"Join":[178],"maintain":[180],"invariants,":[182],"our":[184],"proof":[185],"(mostly)":[187],"generic":[188]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2021-02-01T00:00:00"}