{"id":"https://openalex.org/W4376639545","doi":"https://doi.org/10.1145/3564246.3585140","title":"External Memory Fully Persistent Search Trees","display_name":"External Memory Fully Persistent Search Trees","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639545","doi":"https://doi.org/10.1145/3564246.3585140"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585140","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.scopus.com/pages/publications/85163099341","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":["Aarhus University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091954508","display_name":"Casper Moldrup Rysgaard","orcid":"https://orcid.org/0000-0002-3989-123X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Casper Moldrup Rysgaard","raw_affiliation_strings":["Aarhus University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091954509","display_name":"Rolf Svenning","orcid":"https://orcid.org/0000-0002-9903-4651"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rolf Svenning","raw_affiliation_strings":["Aarhus University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5039943336"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":0.3497,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63194806,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1410","last_page":"1423"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.993399977684021,"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/combinatorics","display_name":"Combinatorics","score":0.7397364974021912},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.7380053997039795},{"id":"https://openalex.org/keywords/block-size","display_name":"Block size","score":0.5531017780303955},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5296040773391724},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.515663743019104},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4984276294708252},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4852409362792969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4752514064311981},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4712144434452057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47101151943206787},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.4525063931941986},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4520667493343353},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4179615378379822},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41300728917121887},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41142237186431885},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1535964012145996},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.12611982226371765}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7397364974021912},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.7380053997039795},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.5531017780303955},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5296040773391724},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.515663743019104},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4984276294708252},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4852409362792969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4752514064311981},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4712144434452057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47101151943206787},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.4525063931941986},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4520667493343353},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4179615378379822},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41300728917121887},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41142237186431885},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1535964012145996},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.12611982226371765},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3564246.3585140","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire/89ed8b33-d0a7-4f7b-8c5c-71fc09bc5777","is_oa":true,"landing_page_url":"https://www.scopus.com/pages/publications/85163099341","pdf_url":null,"source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brodal, G S, Rysgaard, C M & Svenning, R 2023, External Memory Fully Persistent Search Trees. in B Saha & R A Servedio (eds), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, pp. 1410-1423, 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, United States, 20/06/2023. https://doi.org/10.1145/3564246.3585140","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/89ed8b33-d0a7-4f7b-8c5c-71fc09bc5777","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/89ed8b33-d0a7-4f7b-8c5c-71fc09bc5777","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brodal, G S, Rysgaard, C M & Svenning, R 2023, External Memory Fully Persistent Search Trees. in B Saha & R A Servedio (eds), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, pp. 1410-1423, 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, United States, 20/06/2023. https://doi.org/10.1145/3564246.3585140","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:openaire/89ed8b33-d0a7-4f7b-8c5c-71fc09bc5777","is_oa":true,"landing_page_url":"https://www.scopus.com/pages/publications/85163099341","pdf_url":null,"source":{"id":"https://openalex.org/S4306400063","display_name":"Scopus (Elsevier)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brodal, G S, Rysgaard, C M & Svenning, R 2023, External Memory Fully Persistent Search Trees. in B Saha & R A Servedio (eds), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, pp. 1410-1423, 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, United States, 20/06/2023. https://doi.org/10.1145/3564246.3585140","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8070246968","display_name":null,"funder_award_id":"9131-00113B","funder_id":"https://openalex.org/F4320322928","funder_display_name":"Danmarks Frie Forskningsfond"}],"funders":[{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W172574161","https://openalex.org/W1978588217","https://openalex.org/W1987225278","https://openalex.org/W2011297770","https://openalex.org/W2012714839","https://openalex.org/W2021615496","https://openalex.org/W2026511056","https://openalex.org/W2029814178","https://openalex.org/W2034413563","https://openalex.org/W2038142281","https://openalex.org/W2055385473","https://openalex.org/W2077180154","https://openalex.org/W2116268321","https://openalex.org/W2119570197","https://openalex.org/W2121573131","https://openalex.org/W2136963423","https://openalex.org/W2152301310","https://openalex.org/W2614079713","https://openalex.org/W2901608006","https://openalex.org/W2932744841","https://openalex.org/W2997525450","https://openalex.org/W3005557970","https://openalex.org/W3040250498","https://openalex.org/W4212894040","https://openalex.org/W4213048098"],"related_works":["https://openalex.org/W8290509","https://openalex.org/W2184537587","https://openalex.org/W2065411828","https://openalex.org/W3092127654","https://openalex.org/W1482484961","https://openalex.org/W4205704978","https://openalex.org/W2006811735","https://openalex.org/W2076407808","https://openalex.org/W2119570197","https://openalex.org/W2093612905"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,15,56,63,68,72,80,91,98,117,130,135,155],"first":[3],"fully-persistent":[4],"external-memory":[5,81],"search":[6],"tree":[7,73],"achieving":[8],"amortized":[9,34],"I/O":[10],"bounds":[11,101,133],"matching":[12],"those":[13],"of":[14,27,58,65,71,94,123,138,161],"classic":[16],"(ephemeral)":[17],"B-tree":[18],"by":[19],"Bayer":[20],"and":[21,25,38,77,109,144,168],"McCreight.":[22],"The":[23,84],"insertion":[24],"deletion":[26],"a":[28,39,158],"value":[29],"in":[30,43,67,90],"any":[31,44],"version":[32,45,69],"requires":[33,46,87],"O(logB":[35,48],"Nv)":[36],"I/Os":[37],"range":[40],"reporting":[41],"query":[42],"worst-case":[47],"Nv":[49,61],"+":[50],"K/B)":[51],"I/Os,":[52],"where":[53],"K":[54],"is":[55,62,79,152],"number":[57,64,93],"values":[59,66],"reported,":[60],"v":[70],"queried":[74],"or":[75],"updated,":[76],"B":[78],"block":[82],"size.":[83],"data":[85],"structure":[86],"space":[88],"linear":[89],"total":[92],"updates.":[95],"Compared":[96],"to":[97,149,153],"previous":[99,131],"best":[100,132],"for":[102,134],"fully":[103],"persistent":[104,140],"B-trees":[105,141],"[Brodal,":[106],"Sioutas,":[107],"Tsakalidis,":[108],"Tsichlas,":[110],"SODA":[111],"2012],":[112],"this":[113],"paper":[114],"eliminates":[115],"from":[116],"update":[118],"bound":[119],"an":[120],"additive":[121],"term":[122],"O(log2":[124],"B)":[125],"I/Os.":[126],"This":[127],"result":[128],"matches":[129],"restricted":[136],"case":[137],"partial":[139],"[Arge,":[142],"Danner":[143],"Teh,":[145],"JEA":[146],"2003].":[147],"Central":[148],"our":[150],"approach":[151],"consider":[154],"problem":[156],"as":[157],"dynamic":[159],"set":[160],"two-dimensional":[162],"rectangles":[163],"that":[164],"can":[165],"be":[166],"merged":[167],"split.":[169]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}