{"id":"https://openalex.org/W7110045708","doi":"https://doi.org/10.4230/lipics.isaac.2025.37","title":"Parallel Joinable B-Trees in the Fork-Join I/O Model","display_name":"Parallel Joinable B-Trees in the Fork-Join I/O Model","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7110045708","doi":"https://doi.org/10.4230/lipics.isaac.2025.37"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24945","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol359-isaac2025/LIPIcs.ISAAC.2025.37/LIPIcs.ISAAC.2025.37.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol359-isaac2025/LIPIcs.ISAAC.2025.37/LIPIcs.ISAAC.2025.37.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Goodrich, Michael T.","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Goodrich, Michael T.","raw_affiliation_strings":["University of California, Irvine, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Gu, Yan","orcid":null},"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":"Gu, Yan","raw_affiliation_strings":["University of California, Riverside, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Kitagawa, Ryuto","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kitagawa, Ryuto","raw_affiliation_strings":["University of California, Irvine, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":null,"display_name":"Sun, Yihan","orcid":null},"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":"Sun, Yihan","raw_affiliation_strings":["University of California, Riverside, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.64227477,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2793999910354614,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2793999910354614,"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/T11269","display_name":"Algorithms and Data Compression","score":0.21369999647140503,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.1436000019311905,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5805000066757202},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5472999811172485},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5349000096321106},{"id":"https://openalex.org/keywords/inefficiency","display_name":"Inefficiency","score":0.5149000287055969},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.47189998626708984},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.45750001072883606},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.450300008058548},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4041000008583069},{"id":"https://openalex.org/keywords/cost-efficiency","display_name":"Cost efficiency","score":0.3959999978542328},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.3953999876976013}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6992999911308289},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5805000066757202},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5472999811172485},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5349000096321106},{"id":"https://openalex.org/C2778869765","wikidata":"https://www.wikidata.org/wiki/Q6028363","display_name":"Inefficiency","level":2,"score":0.5149000287055969},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.47189998626708984},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.45750001072883606},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.450300008058548},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4253999888896942},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4041000008583069},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39969998598098755},{"id":"https://openalex.org/C11644782","wikidata":"https://www.wikidata.org/wiki/Q15401790","display_name":"Cost efficiency","level":2,"score":0.3959999978542328},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3953999876976013},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3871000111103058},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35589998960494995},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3504999876022339},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.33149999380111694},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3224000036716461},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3212999999523163},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3125},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.28040000796318054},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.27950000762939453},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.27379998564720154},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.26649999618530273},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.25270000100135803},{"id":"https://openalex.org/C2781057727","wikidata":"https://www.wikidata.org/wiki/Q9941","display_name":"Parallel I/O","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:24945","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol359-isaac2025/LIPIcs.ISAAC.2025.37/LIPIcs.ISAAC.2025.37.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24945","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.37","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol359-isaac2025/LIPIcs.ISAAC.2025.37/LIPIcs.ISAAC.2025.37.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W7110045708.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Balanced":[0],"search":[1,141],"trees":[2],"are":[3,248],"widely":[4,30],"used":[5],"in":[6,38,49,126,156,164,167,184],"computer":[7],"science":[8],"to":[9,46,179],"efficiently":[10],"maintain":[11],"dynamic":[12],"ordered":[13],"data.":[14],"To":[15,159],"support":[16],"efficient":[17,54,133],"set":[18,55,137],"operations":[19,56,138],"(e.g.,":[20,89],"union,":[21,218],"intersection,":[22,219],"difference)":[23],"using":[24,144],"trees,":[25,66,254],"the":[26,39,60,78,110,162,175,181,190,217,249,252,258],"join-based":[27,65,146],"framework":[28,33],"is":[29,77,257],"studied.":[31],"This":[32,130,187],"has":[34,43],"received":[35],"particular":[36],"attention":[37],"parallel":[40,64,134,214],"setting,":[41],"and":[42,52,91,196,220,230,244,255],"been":[44,105],"shown":[45],"be":[47],"effective":[48],"enabling":[50],"simple":[51],"theoretically":[53],"on":[57,73,94,108,128,140,152,211],"trees.":[58,129],"Despite":[59],"widespread":[61],"adoption":[62],"of":[63,70,80,98,222,251],"a":[67,145,149,171],"major":[68],"drawback":[69],"previous":[71],"work":[72,88,229],"such":[74],"data":[75],"structures":[76],"inefficiency":[79],"their":[81,197],"input/output":[82],"(I/O)":[83],"access":[84],"patterns.":[85],"Some":[86],"recent":[87],"C-trees":[90],"PaC-trees)":[92],"focused":[93],"more":[95],"I/O-friendly":[96],"implementations":[97],"these":[99,113,119,157,165],"algorithms.":[100,114,158],"Surprisingly,":[101],"however,":[102],"there":[103],"have":[104],"no":[106],"results":[107],"bounding":[109],"I/O-costs":[111,127],"for":[112,136],"It":[115],"remains":[116],"open":[117],"whether":[118],"algorithms":[120,135,143,166],"can":[121],"provide":[122],"tight,":[123],"provable":[124],"guarantees":[125],"paper":[131],"studies":[132],"based":[139,210],"tree":[142],"framework,":[147],"with":[148,225],"special":[150],"focus":[151],"achieving":[153],"I/O":[154,177,182,228,240],"efficiency":[155],"better":[160],"capture":[161],"I/O-efficiency":[163],"parallel,":[168],"we":[169,205],"introduce":[170],"new":[172,208],"computational":[173],"model,":[174,204],"Fork-Join":[176],"Model,":[178],"measure":[180],"costs":[183],"fork-join":[185],"parallelism.":[186],"model":[188],"measures":[189],"total":[191],"block":[192,259],"transfers":[193],"(I/O":[194,200],"work)":[195],"critical":[198],"path":[199],"span).":[201],"Under":[202],"this":[203],"propose":[206],"our":[207],"solution":[209],"B-trees.":[212],"Our":[213],"algorithm":[215],"computes":[216],"difference":[221],"two":[223,253],"B-trees":[224],"O(m":[226],"log_B(n/m))":[227],"O(log_B":[231],"m":[232,245],"\u22c5":[233],"log\u2082":[234],"log_B":[235,238],"n":[236,243,247],"+":[237],"n)":[239],"span,":[241],"where":[242],"\u2264":[246],"sizes":[250],"B":[256],"size.":[260]},"counts_by_year":[],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-12-08T00:00:00"}