{"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","alternate_titles":[],"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","doi":null,"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,"listed_in":[],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"parent_works":[{"id":"https://openalex.org/W7107862953","display_name":"LIPIcs, Volume 359, ISAAC 2025, Complete Volume","relationship":"part"}],"lineage":["https://openalex.org/W7110045708","https://openalex.org/W7107862953"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["arxiv","datacite"],"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":"https://openalex.org/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X","observed_orcids":["https://orcid.org/0000-0002-8943-191X"]},"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":"Goodrich, Michael T.","raw_affiliation_strings":["University of California, Irvine, CA, USA"],"raw_orcid":"https://orcid.org/0000-0002-8943-191X","affiliations":[{"raw_affiliation_string":"University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043897310","display_name":"Yan Gu","orcid":"https://orcid.org/0000-0002-8510-3193","observed_orcids":["https://orcid.org/0000-0002-8510-3193"]},"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":"https://orcid.org/0000-0002-4392-4022","affiliations":[{"raw_affiliation_string":"University of California, Riverside, CA, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114425523","display_name":"Ryuto Kitagawa","orcid":"https://orcid.org/0009-0000-7329-9590","observed_orcids":["https://orcid.org/0009-0000-7329-9590"]},"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":"https://orcid.org/0009-0000-7329-9590","affiliations":[{"raw_affiliation_string":"University of California, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004374151","display_name":"Yihan Sun","orcid":"https://orcid.org/0000-0002-3212-0934","observed_orcids":["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":"Sun, Yihan","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":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4014,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.4732992,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.5595999956130981,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.5595999956130981,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.358599990606308,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.023600000888109207,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/b-tree","display_name":"B-trees","score":0.7680000066757202},{"id":"https://openalex.org/keywords/i-o-efficiency","display_name":"I/O efficiency","score":0.7390000224113464},{"id":"https://openalex.org/keywords/set-operations","display_name":"set operations","score":0.6489999890327454},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.6869999766349792},{"id":"https://openalex.org/keywords/block-transfer","display_name":"block transfer","score":0.6269999742507935},{"id":"https://openalex.org/keywords/balanced-search-trees","display_name":"balanced search trees","score":0.8349999785423279}],"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":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:24945","doi":null,"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,"listed_in":[],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"pmh:oai:arXiv.org:2510.20053","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.20053","pdf_url":"https://arxiv.org/pdf/2510.20053","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2510.20053","doi":"https://doi.org/10.48550/arxiv.2510.20053","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.20053","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.isaac.2025.37","doi":"https://doi.org/10.4230/lipics.isaac.2025.37","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.isaac.2025.37","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24945","doi":null,"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,"listed_in":[],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7110045708.pdf","grobid_xml":"https://content.openalex.org/works/W7110045708.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1965708711","https://openalex.org/W1998676013","https://openalex.org/W2016559894","https://openalex.org/W2020022171","https://openalex.org/W2110692415","https://openalex.org/W2218693137","https://openalex.org/W2562123954","https://openalex.org/W2913844428","https://openalex.org/W2928783453","https://openalex.org/W2938791877","https://openalex.org/W2982604121","https://openalex.org/W3037464308","https://openalex.org/W3037631006","https://openalex.org/W3124031623","https://openalex.org/W3163863197","https://openalex.org/W4205919306","https://openalex.org/W4223901115","https://openalex.org/W4282050459","https://openalex.org/W4316652336","https://openalex.org/W4391054886"],"related_works":["https://openalex.org/W4223472867","https://openalex.org/W2218693137","https://openalex.org/W3124031623","https://openalex.org/W2963973157","https://openalex.org/W2269461203","https://openalex.org/W2798813697","https://openalex.org/W2008070110","https://openalex.org/W7095234799","https://openalex.org/W4207048139"],"abstract_inverted_index":{"Balanced":[0],"search":[1,141],"trees":[2],"are":[3,247],"widely":[4,30],"used":[5],"in":[6,38,49,126,156,164,167,183],"computer":[7],"science":[8],"to":[9,46,178],"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,217],"intersection,":[22,218],"difference)":[23],"using":[24,144],"trees,":[25,66,253],"the":[26,39,60,78,110,162,180,189,216,248,251,257],"join-based":[27,65,146],"framework":[28,33],"is":[29,77,256],"studied.":[31],"This":[32,130,186],"has":[34,43],"received":[35],"particular":[36],"attention":[37],"parallel":[40,64,134,213],"setting,":[41],"and":[42,52,91,195,219,229,243,254],"been":[44,105],"shown":[45],"be":[47],"effective":[48],"enabling":[50],"simple":[51],"theoretically":[53],"on":[57,73,94,108,128,140,152,210],"trees.":[58,129],"Despite":[59],"widespread":[61],"adoption":[62],"of":[63,70,80,98,221,250],"a":[67,145,149,171],"major":[68],"drawback":[69],"previous":[71],"work":[72,88,228],"such":[74],"data":[75],"structures":[76],"inefficiency":[79],"their":[81,196],"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,209],"tree":[142],"framework,":[147],"with":[148,224],"special":[150],"focus":[151],"achieving":[153],"I/O":[154,176,181,227,239],"efficiency":[155],"better":[160],"capture":[161],"I/O-efficiency":[163],"parallel,":[168],"we":[169,204],"introduce":[170],"new":[172,207],"computational":[173],"model,":[174,203],"Fork-Join":[175],"Model,":[177],"measure":[179],"costs":[182],"fork-join":[184],"parallelism.":[185],"model":[187],"measures":[188],"total":[190],"block":[191,258],"transfers":[192],"(I/O":[193,199],"work)":[194],"critical":[197],"path":[198],"span).":[200],"Under":[201],"this":[202],"propose":[205],"our":[206],"solution":[208],"B-trees.":[211],"Our":[212],"algorithm":[214],"computes":[215],"difference":[220],"two":[222,252],"B-trees":[223],"$O(m":[225],"\\log_B(n/m))$":[226],"$O(\\log_B":[230],"m":[231],"\\cdot":[232],"\\log_2":[233],"\\log_B":[234,237],"n":[235],"+":[236],"n)$":[238],"span,":[240],"where":[241],"$n$":[242],"$m":[244],"\\leq":[245],"n$":[246],"sizes":[249],"$B$":[255],"size.":[259]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7110045708","counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2025-12-08T00:00:00"}
