{"doi":"10.7146/brics.v3i28.20009","title":"The Buffer Tree: A New Technique for Optimal I/O Algorithms","abstract":"<jats:p>In this paper we develop a technique for transforming an internal-memory tree data structure into an external-memory structure. We show how the technique can be used to develop a search tree like structure, a priority queue, a (one-dimensional) range tree and a segment tree, and give examples of how these structures can be used to develop efficient I/O algorithms. All our algorithms are either extremely simple or straightforward generalizations of known internal-memory algorithms - given the developed external data structures. We believe that algorithms relying on the developed structure will be of practical interest due to relatively small constants in the asymptotic bounds.</jats:p>","journal":"BRICS Report Series","year":1996,"id":683017,"datarank":0.47670807455219194,"base_score":3.1780538303479458,"endowment":3.1780538303479458,"self_citation_contribution":0.47670807455219194,"citation_network_contribution":0.0,"self_endowment_contribution":0.47670807455219194,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":23,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":1784331,"name":"Lars Arge","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"The Buffer Tree: A New Technique for Optimal I/O Algorithms","abstract":"<jats:p>In this paper we develop a technique for transforming an internal-memory tree data structure into an external-memory structure. We show how the technique can be used to develop a search tree like structure, a priority queue, a (one-dimensional) range tree and a segment tree, and give examples of how these structures can be used to develop efficient I/O algorithms. All our algorithms are either extremely simple or straightforward generalizations of known internal-memory algorithms - given the developed external data structures. We believe that algorithms relying on the developed structure will be of practical interest due to relatively small constants in the asymptotic bounds.</jats:p>","is_dataset_classified":null,"base_score":3.1780538303479458,"endowment":3.1780538303479458,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"26207759","pmcid":null,"openalex_id":"https://openalex.org/W2227630426","authors":[],"funders":[],"total_grants":0,"fwci":3.3609,"citation_percentile":0.93327368,"influential_citations":0,"citation_trend":[{"year":2012,"count":1},{"year":2015,"count":1}],"oa_status":"hybrid","license":"cc-by-nc-nd","oa_locations":[{"url":"https://tidsskrift.dk/brics/article/download/20009/17642","host_type":"journal"},{"url":"https://tidsskrift.dk/brics/article/download/20009/17642","host_type":"publisher"},{"url":"http://ojs.statsbiblioteket.dk/index.php/brics/article/viewFile/20009/17642","host_type":"publisher"},{"url":"https://doi.org/10.7146/brics.v3i28.20009","host_type":"journal"}],"fields_of_study":["Algorithms and Data Compression","Parallel Computing and Optimization Techniques","Advanced Database Systems and Queries"],"mesh_terms":[],"keywords":["Computer science","Tree (set theory)","Data structure","Tree structure","Algorithm","Priority queue","Queue","Simple (philosophy)","Search tree","Segment tree","Range (aeronautics)","Interval tree","Theoretical computer science","Binary tree","Mathematics","Search algorithm"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-08-17T22:02:36.010341Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}