{"id":"https://openalex.org/W7125905334","doi":"https://doi.org/10.1145/3774934.3786431","title":"UFO Trees: Practical and Provably-Efficient Parallel Batch-Dynamic Trees","display_name":"UFO Trees: Practical and Provably-Efficient Parallel Batch-Dynamic Trees","publication_year":2026,"publication_date":"2026-01-28","ids":{"openalex":"https://openalex.org/W7125905334","doi":"https://doi.org/10.1145/3774934.3786431"},"language":null,"primary_location":{"id":"doi:10.1145/3774934.3786431","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3774934.3786431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","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/A5114730512","display_name":"Quinten De Man","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Quinten De Man","raw_affiliation_strings":["University of Maryland, College Park, USA"],"raw_orcid":"https://orcid.org/0009-0009-1321-9590","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Atharva Sharma","orcid":"https://orcid.org/0009-0008-4469-1997"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Atharva Sharma","raw_affiliation_strings":["University of Maryland, College Park, USA"],"raw_orcid":"https://orcid.org/0009-0008-4469-1997","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061083611","display_name":"Kishen N. Gowda","orcid":"https://orcid.org/0000-0001-6573-9445"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kishen N Gowda","raw_affiliation_strings":["University of Maryland, College Park, USA"],"raw_orcid":"https://orcid.org/0000-0001-6573-9445","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065818820","display_name":"Laxman Dhulipala","orcid":"https://orcid.org/0000-0003-0685-064X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Laxman Dhulipala","raw_affiliation_strings":["University of Maryland, College Park, USA"],"raw_orcid":"https://orcid.org/0000-0003-0685-064X","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11974454,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"109","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.5605000257492065,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.5605000257492065,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.2003999948501587,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.07450000196695328,"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/path","display_name":"Path (computing)","score":0.6215000152587891},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5242000222206116},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.46889999508857727},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4560999870300293},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.37310001254081726}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6876000165939331},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6215000152587891},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5242000222206116},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48559999465942383},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.46889999508857727},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4560999870300293},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.37310001254081726},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33489999175071716},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32350000739097595},{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.29580000042915344},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.27730000019073486},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2606000006198883}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3774934.3786431","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3774934.3786431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 31st ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming","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":23,"referenced_works":["https://openalex.org/W2007921877","https://openalex.org/W2009122662","https://openalex.org/W2018804864","https://openalex.org/W2025791989","https://openalex.org/W2045430818","https://openalex.org/W2072725684","https://openalex.org/W2090193162","https://openalex.org/W2092720654","https://openalex.org/W2101196063","https://openalex.org/W2104224360","https://openalex.org/W2121473031","https://openalex.org/W2562676961","https://openalex.org/W2964265366","https://openalex.org/W3037464308","https://openalex.org/W3041215255","https://openalex.org/W4237877977","https://openalex.org/W4280508381","https://openalex.org/W4315705185","https://openalex.org/W4399344968","https://openalex.org/W4409219286","https://openalex.org/W4412481722","https://openalex.org/W4412482059","https://openalex.org/W7118121637"],"related_works":[],"abstract_inverted_index":{"The":[0],"dynamic":[1],"trees":[2,53],"problem":[3],"is":[4],"to":[5],"maintain":[6],"a":[7],"tree":[8],"under":[9],"edge":[10],"updates":[11,58],"while":[12],"supporting":[13],"queries":[14,17,66],"like":[15],"connectivity":[16],"or":[18],"path":[19],"queries.":[20],"Despite":[21],"the":[22,43,49,63],"first":[23],"data":[24,46],"structure":[25,47],"for":[26,48],"this":[27],"fundamental":[28],"problem---the":[29],"link-cut":[30,52],"tree---being":[31],"invented":[32],"40":[33],"years":[34],"ago,":[35],"our":[36],"experiments":[37],"reveal":[38],"that":[39],"they":[40,67],"are":[41],"still":[42],"fastest":[44],"sequential":[45],"problem.":[50],"However,":[51],"cannot":[54],"support":[55],"parallel":[56],"batch-dynamic":[57],"and":[59],"have":[60],"limitations":[61],"on":[62],"kinds":[64],"of":[65],"support.":[68]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-01-29T00:00:00"}