{"id":"https://openalex.org/W2006706309","doi":"https://doi.org/10.1145/1064092.1064120","title":"Cache-oblivious R-trees","display_name":"Cache-oblivious R-trees","publication_year":2005,"publication_date":"2005-06-06","ids":{"openalex":"https://openalex.org/W2006706309","doi":"https://doi.org/10.1145/1064092.1064120","mag":"2006706309"},"language":"en","primary_location":{"id":"doi:10.1145/1064092.1064120","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1064092.1064120","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-first annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"conference-paper","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/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":"Lars Arge","raw_affiliation_strings":["University of Aarhus, Aarhus N, Denmark","University of Aarhus, Aarhus N., Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Aarhus, Aarhus N, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"University of Aarhus, Aarhus N., Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["TU Eindhoven, MB Eindhoven, the Netherlands","TU Eindhoven, MB Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Eindhoven, MB Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"TU Eindhoven, MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083767409","display_name":"Herman Haverkort","orcid":null},"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":"Herman Haverkort","raw_affiliation_strings":["University of Aarhus, Aarhus N, Denmark","University of Aarhus, Aarhus N., Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Aarhus, Aarhus N, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"University of Aarhus, Aarhus N., Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7169,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.9122491,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"170","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9983000159263611,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/rectangle","display_name":"Rectangle","score":0.7303428649902344},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6627638339996338},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5629251599311829},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.5224646329879761},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5064557790756226},{"id":"https://openalex.org/keywords/out-of-core-algorithm","display_name":"Out-of-core algorithm","score":0.4640101194381714},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4595460295677185},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.4541844129562378},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4499847888946533},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4461977779865265},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44604599475860596},{"id":"https://openalex.org/keywords/block-size","display_name":"Block size","score":0.4442339539527893},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"Memory hierarchy","score":0.4435364007949829},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4344913065433502},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4190135598182678},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.41590213775634766},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.39611175656318665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25398099422454834},{"id":"https://openalex.org/keywords/cache-coloring","display_name":"Cache coloring","score":0.2484378218650818}],"concepts":[{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.7303428649902344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6627638339996338},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5629251599311829},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.5224646329879761},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5064557790756226},{"id":"https://openalex.org/C79470037","wikidata":"https://www.wikidata.org/wiki/Q279748","display_name":"Out-of-core algorithm","level":2,"score":0.4640101194381714},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4595460295677185},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.4541844129562378},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4499847888946533},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4461977779865265},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44604599475860596},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.4442339539527893},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.4435364007949829},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4344913065433502},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4190135598182678},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.41590213775634766},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.39611175656318665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25398099422454834},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.2484378218650818},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/1064092.1064120","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1064092.1064120","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-first annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/c7c1fb70-e3ca-11dc-9afb-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/c7c1fb70-e3ca-11dc-9afb-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Arge, L, de Berg, M & Haverkort, H 2005, Cache-Oblivious R-trees. in J Mitchell & G Rote (eds), Proceedings of 21th ACM Symposium on Computational Geometry. Association for Computing Machinery, pp. 170-179, Annual Symposium on Computational Geometry, Piza, Italy, 06/06/2005.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:645493","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=645493","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0178-4617","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1020.8581","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1020.8581","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.win.tue.nl/%7Emdberg/Papers/co-rtree.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.96.140","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.win.tue.nl/~hermanh/stack/cache-oblivious-rtree.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:645493","is_oa":false,"landing_page_url":"http://repository.tue.nl/645493","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0178-4617","raw_type":"Article / Letter to the editor"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1489669349","https://openalex.org/W1543034750","https://openalex.org/W1592580490","https://openalex.org/W1633157623","https://openalex.org/W1633222579","https://openalex.org/W1801456964","https://openalex.org/W2017799838","https://openalex.org/W2022117185","https://openalex.org/W2038142281","https://openalex.org/W2041762692","https://openalex.org/W2046441184","https://openalex.org/W2060978628","https://openalex.org/W2083576929","https://openalex.org/W2095875205","https://openalex.org/W2097224604","https://openalex.org/W2098130516","https://openalex.org/W2106642566","https://openalex.org/W2118269922","https://openalex.org/W2131383217","https://openalex.org/W2131620262","https://openalex.org/W2134438395","https://openalex.org/W2138145917","https://openalex.org/W2151135734","https://openalex.org/W2161694911","https://openalex.org/W2167637943","https://openalex.org/W2171038510","https://openalex.org/W2183676805","https://openalex.org/W2515109297","https://openalex.org/W2901608006","https://openalex.org/W4285719527","https://openalex.org/W6631045115","https://openalex.org/W6636710603","https://openalex.org/W6674733012","https://openalex.org/W6679274366"],"related_works":["https://openalex.org/W3179328532","https://openalex.org/W1944865817","https://openalex.org/W2560781234","https://openalex.org/W2072336782","https://openalex.org/W1706180934","https://openalex.org/W2113547954","https://openalex.org/W2081192312","https://openalex.org/W2159725480","https://openalex.org/W2776790103","https://openalex.org/W1999298169"],"abstract_inverted_index":{"We":[0,112],"develop":[1,114],"a":[2,8,25,72,82,108,115],"cache-oblivious":[3,48],"data":[4],"structure":[5,35,70,119],"for":[6,89],"storing":[7],"set":[9],"S":[10,23],"of":[11,100,107,117,141],"N":[12],"axis-aligned":[13,38],"rectangles":[14,21,66],"in":[15,22,57,62,67],"the":[16,46,58,69,97,122,132,139,142],"plane,":[17],"such":[18,43],"that":[19,120],"all":[20],"intersecting":[24],"query":[26,74,84,136],"rectangle":[27,73,135],"or":[28,64],"point":[29,56,83],"can":[30],"be":[31],"found":[32],"efficiently.":[33],"Our":[34],"is":[36,45,60,96],"an":[37],"bounding-box":[39],"hierarchy":[40],"and":[41,81],"as":[42],"it":[44],"first":[47],"R-tree":[49],"with":[50,128],"provable":[51],"performance":[52,124],"guarantees.":[53],"If":[54],"no":[55],"plane":[59],"contained":[61],"B":[63,95],"more":[65],"S,":[68],"answers":[71],"using":[75,85],"O(\u221aN/B":[76],"+":[77],"T/B)":[78],"memory":[79,87,101,110],"transfers":[80,88,102],"O((N/B)\u03b5)":[86],"any":[90,104],"\u03b5":[91],">":[92],"0,":[93],"where":[94],"block":[98],"size":[99],"between":[103],"two":[105],"levels":[106],"multilevel":[109],"hierarchy.":[111],"also":[113],"variant":[116],"our":[118],"achieves":[121],"same":[123],"on":[125],"input":[126],"sets":[127],"arbitrary":[129],"overlap":[130],"among":[131],"rectangles.":[133],"The":[134],"bound":[137,140],"matches":[138],"best":[143],"known":[144],"linear-space":[145],"cache-aware":[146],"structure.":[147]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}