{"id":"https://openalex.org/W2146529252","doi":"https://doi.org/10.1007/s00453-007-9007-8","title":"Cache-Oblivious R-Trees","display_name":"Cache-Oblivious R-Trees","publication_year":2007,"publication_date":"2007-09-27","ids":{"openalex":"https://openalex.org/W2146529252","doi":"https://doi.org/10.1007/s00453-007-9007-8","mag":"2146529252"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9007-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9007-8","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-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/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"]},{"id":"https://openalex.org/I4210095128","display_name":"Center for Massive Data Algorithmics","ror":"https://ror.org/00qbzpp62","country_code":"DK","type":"facility","lineage":["https://openalex.org/I4210095128"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Lars Arge","raw_affiliation_strings":["MADALGO, Department of Computer Science, University of Aarhus, IT-Parken, Aabogade 34, 8200, Aarhus N, Denmark","University of Aarhus, IT-Parken, MADALGO, Department of Computer Science, Aabogade 34, 8200, Aarhus N, Denmark#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MADALGO, Department of Computer Science, University of Aarhus, IT-Parken, Aabogade 34, 8200, Aarhus N, Denmark","institution_ids":["https://openalex.org/I204337017","https://openalex.org/I4210095128"]},{"raw_affiliation_string":"University of Aarhus, IT-Parken, MADALGO, Department of Computer Science, Aabogade 34, 8200, Aarhus N, Denmark#TAB#","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":["Department of Computer Science, TU Eindhoven, P.O. Box 513, 5600, MB Eindhoven, The Netherlands","TU Eindhoven, Department of Computer Science, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Eindhoven, P.O. Box 513, 5600, MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"TU Eindhoven, Department of Computer Science, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands#TAB#","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/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":"Herman Haverkort","raw_affiliation_strings":["Department of Computer Science, TU Eindhoven, P.O. Box 513, 5600, MB Eindhoven, The Netherlands","TU Eindhoven, Department of Computer Science, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Eindhoven, P.O. Box 513, 5600, MB Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"TU Eindhoven, Department of Computer Science, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands#TAB#","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084056010"],"corresponding_institution_ids":["https://openalex.org/I204337017","https://openalex.org/I4210095128"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.3356,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.68099274,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"53","issue":"1","first_page":"50","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"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.9994999766349792,"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.9987000226974487,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.7111451625823975},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5714071989059448},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5643479824066162},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5039319396018982},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.46810078620910645},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4527169167995453},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.4488834738731384},{"id":"https://openalex.org/keywords/out-of-core-algorithm","display_name":"Out-of-core algorithm","score":0.44414469599723816},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.43851515650749207},{"id":"https://openalex.org/keywords/block-size","display_name":"Block size","score":0.4376845359802246},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4317358136177063},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43097975850105286},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.42676201462745667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41250357031822205},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41106054186820984},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3550204932689667},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.28538399934768677}],"concepts":[{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.7111451625823975},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5714071989059448},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5643479824066162},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5039319396018982},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.46810078620910645},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4527169167995453},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.4488834738731384},{"id":"https://openalex.org/C79470037","wikidata":"https://www.wikidata.org/wiki/Q279748","display_name":"Out-of-core algorithm","level":2,"score":0.44414469599723816},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.43851515650749207},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.4376845359802246},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4317358136177063},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43097975850105286},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.42676201462745667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41250357031822205},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41106054186820984},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3550204932689667},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.28538399934768677},{"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/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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-007-9007-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9007-8","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/2b1eff2a-8738-4393-ae72-5fb524a3f148","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/2b1eff2a-8738-4393-ae72-5fb524a3f148","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Arge, L, Berg, de, M & Haverkort, H J 2009, 'Cache-oblivious R-trees', Algorithmica, vol. 53, no. 1, pp. 50-68. https://doi.org/10.1007/s00453-007-9007-8","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:publications/fa97a550-9da1-11dc-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/fa97a550-9da1-11dc-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Arge, L, de Berg, M & Haverkort, H 2009, 'Cache-Oblivious R-trees', Algorithmica, vol. 53, no. 1, pp. 50-68. https://doi.org/10.1007/s00453-007-9007-8","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/2b1eff2a-8738-4393-ae72-5fb524a3f148","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/2b1eff2a-8738-4393-ae72-5fb524a3f148","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 53(1), 50 - 68. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/13","display_name":"Climate action"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W96629302","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/W2498714246","https://openalex.org/W2901608006","https://openalex.org/W2997027240","https://openalex.org/W4206206918","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2047790048","https://openalex.org/W2804593871","https://openalex.org/W2963552320","https://openalex.org/W4288359125","https://openalex.org/W2784958031","https://openalex.org/W2072336782","https://openalex.org/W1706180934","https://openalex.org/W2113547954","https://openalex.org/W2041762692","https://openalex.org/W144222265"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}