{"id":"https://openalex.org/W1591568670","doi":"https://doi.org/10.1007/3-540-60220-8_74","title":"The buffer tree: A new technique for optimal I/O-algorithms","display_name":"The buffer tree: A new technique for optimal I/O-algorithms","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1591568670","doi":"https://doi.org/10.1007/3-540-60220-8_74","mag":"1591568670"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-60220-8_74","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-60220-8_74","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5084056010","display_name":"Lars Arge","orcid":null},"institutions":[{"id":"https://openalex.org/I4210087405","display_name":"Danish National Research Foundation","ror":"https://ror.org/00znyv691","country_code":"DK","type":"nonprofit","lineage":["https://openalex.org/I4210087405"]},{"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":"Lars Arge","raw_affiliation_strings":["Acronym for Basic Research in Computer Science, Center of the Danish National Research Foundation Department of Computer Science, University of Aarhus, Denmark","University of Aarhus,"],"affiliations":[{"raw_affiliation_string":"Acronym for Basic Research in Computer Science, Center of the Danish National Research Foundation Department of Computer Science, University of Aarhus, Denmark","institution_ids":["https://openalex.org/I4210087405"]},{"raw_affiliation_string":"University of Aarhus,","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084056010"],"corresponding_institution_ids":["https://openalex.org/I204337017","https://openalex.org/I4210087405"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":15.6424,"has_fulltext":false,"cited_by_count":186,"citation_normalized_percentile":{"value":0.99589111,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"334","last_page":"345"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":1.0,"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/T11181","display_name":"Advanced Data Storage Technologies","score":1.0,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8441417217254639},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.673574686050415},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6606016159057617},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.6521987915039062},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.6414192914962769},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.6023460030555725},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5994327068328857},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5555378794670105},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5504617691040039},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5365943908691406},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5009403228759766},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4591374695301056},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.4525753855705261},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3958948254585266},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2944176197052002},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.19458845257759094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12028026580810547}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8441417217254639},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.673574686050415},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6606016159057617},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.6521987915039062},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.6414192914962769},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.6023460030555725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5994327068328857},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5555378794670105},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5504617691040039},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5365943908691406},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5009403228759766},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4591374695301056},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.4525753855705261},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3958948254585266},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2944176197052002},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.19458845257759094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12028026580810547},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-60220-8_74","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-60220-8_74","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.324","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.324","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/RS/96/28/BRICS-RS-96-28.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.9513","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.9513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/RS/96/28/BRICS-RS-96-28.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/6f0f6ed0-c960-11df-8cb9-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/6f0f6ed0-c960-11df-8cb9-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Arge, L A 1995, The buffer tree: A new technique for optimal I/O-algorithms. in S G Akl, F Dehne, J-R Sack & N Santoro (eds), Algorithms and Data Structures : 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings. Springer, Lecture Notes in Computer Science, vol. 955, pp. 334-345, International Workshop on Algorithms and Data Structures, Kingston, Canada, 18/08/1995. https://doi.org/10.1007/3-540-60220-8_74","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W25426087","https://openalex.org/W123136391","https://openalex.org/W144222265","https://openalex.org/W144979840","https://openalex.org/W1493854191","https://openalex.org/W1501369469","https://openalex.org/W1527662511","https://openalex.org/W1529120744","https://openalex.org/W1607877412","https://openalex.org/W1822595813","https://openalex.org/W1885286792","https://openalex.org/W1993946812","https://openalex.org/W2005314985","https://openalex.org/W2007839042","https://openalex.org/W2015326607","https://openalex.org/W2016582666","https://openalex.org/W2032221993","https://openalex.org/W2038142281","https://openalex.org/W2051156417","https://openalex.org/W2057839002","https://openalex.org/W2060124163","https://openalex.org/W2077180154","https://openalex.org/W2078089286","https://openalex.org/W2085088576","https://openalex.org/W2100059510","https://openalex.org/W2114123275","https://openalex.org/W2161694911","https://openalex.org/W2168395296","https://openalex.org/W2462110278","https://openalex.org/W2472878373","https://openalex.org/W2731750870","https://openalex.org/W2901608006","https://openalex.org/W2911302472","https://openalex.org/W3027900649"],"related_works":["https://openalex.org/W2227684440","https://openalex.org/W2359095153","https://openalex.org/W2351720606","https://openalex.org/W2083751087","https://openalex.org/W2160311168","https://openalex.org/W2280371997","https://openalex.org/W1521720839","https://openalex.org/W2084831204","https://openalex.org/W2156833871","https://openalex.org/W2132255384"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}