{"id":"https://openalex.org/W2024199467","doi":"https://doi.org/10.1145/1328911.1328920","title":"The priority R-tree","display_name":"The priority R-tree","publication_year":2008,"publication_date":"2008-03-01","ids":{"openalex":"https://openalex.org/W2024199467","doi":"https://doi.org/10.1145/1328911.1328920","mag":"2024199467"},"language":"en","primary_location":{"id":"doi:10.1145/1328911.1328920","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328911.1328920","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/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, University of Aarhus, Aarhus N, Denmark"],"affiliations":[{"raw_affiliation_string":"MADALGO, University of Aarhus, Aarhus N, Denmark","institution_ids":["https://openalex.org/I4210095128"]}]},{"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, Eindhoven, the Netherlands","TU Eindhoven, EindHoven, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"TU Eindhoven, Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"TU Eindhoven, EindHoven, The Netherlands#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","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":["TU Eindhoven, Eindhoven, the Netherlands","TU Eindhoven, EindHoven, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"TU Eindhoven, Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"TU Eindhoven, EindHoven, The Netherlands#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009196125","display_name":"Ke Yi","orcid":"https://orcid.org/0000-0002-2178-3716"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Ke Yi","raw_affiliation_strings":["Hong Kong University of Science and Technology, Kowloon, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5084056010"],"corresponding_institution_ids":["https://openalex.org/I4210095128"],"apc_list":null,"apc_paid":null,"fwci":5.7151,"has_fulltext":false,"cited_by_count":116,"citation_normalized_percentile":{"value":0.96340426,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"4","issue":"1","first_page":"1","last_page":"30"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7771542072296143},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.6341139078140259},{"id":"https://openalex.org/keywords/range-tree","display_name":"Range tree","score":0.5956230163574219},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5502128005027771},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.5477827787399292},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.5376341342926025},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5306158661842346},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5265277624130249},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4566177725791931},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4526611566543579},{"id":"https://openalex.org/keywords/r-tree","display_name":"R-tree","score":0.4408806264400482},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3593200147151947},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.30131104588508606},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.248977392911911},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.22519221901893616},{"id":"https://openalex.org/keywords/spatial-database","display_name":"Spatial database","score":0.05878916382789612}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7771542072296143},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.6341139078140259},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.5956230163574219},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5502128005027771},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.5477827787399292},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.5376341342926025},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5306158661842346},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5265277624130249},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4566177725791931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4526611566543579},{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.4408806264400482},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3593200147151947},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.30131104588508606},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.248977392911911},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.22519221901893616},{"id":"https://openalex.org/C203689450","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial database","level":3,"score":0.05878916382789612},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1328911.1328920","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328911.1328920","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/d92cfa39-e086-4621-84a0-6773c6a5d4c7","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/d92cfa39-e086-4621-84a0-6773c6a5d4c7","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 & Yi, K 2008, 'The priority R-tree : A practically efficient and worst-case optimal R-tree', ACM Transactions on Algorithms, vol. 4, no. 1, 9, pp. 9-1/30. https://doi.org/10.1145/1328911.1328920","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/883f22c0-2615-11dc-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/883f22c0-2615-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 & Yi, K 2008, 'The Priority R-tree: A Practically Efficient and Worst-Case Optimal R-tree', A C M Transactions on Algorithms, vol. 4, no. 1. https://doi.org/10.1145/1328911.1328920","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-27191","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-27191","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/d92cfa39-e086-4621-84a0-6773c6a5d4c7","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/d92cfa39-e086-4621-84a0-6773c6a5d4c7","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":"ACM Transactions on Algorithms, 4(1):9, 9 - 1/30. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7755148816","display_name":null,"funder_award_id":"639.023.301612.015.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7999414309","display_name":null,"funder_award_id":"W911NF-04-1-0278","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G8141595998","display_name":null,"funder_award_id":"EIA-9972879","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8536123936","display_name":null,"funder_award_id":"DAG07/08","funder_id":"https://openalex.org/F4320321592","funder_display_name":"Research Grants Council, University Grants Committee"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321592","display_name":"Research Grants Council, University Grants Committee","ror":"https://ror.org/00djwmt25"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1489669349","https://openalex.org/W1489843519","https://openalex.org/W1541475832","https://openalex.org/W1543034750","https://openalex.org/W1559384720","https://openalex.org/W1576347849","https://openalex.org/W1599814229","https://openalex.org/W1633157623","https://openalex.org/W1633222579","https://openalex.org/W1991383761","https://openalex.org/W2041762692","https://openalex.org/W2052074121","https://openalex.org/W2066799613","https://openalex.org/W2077110411","https://openalex.org/W2106642566","https://openalex.org/W2117074936","https://openalex.org/W2118269922","https://openalex.org/W2131620262","https://openalex.org/W2134438395","https://openalex.org/W2135961964","https://openalex.org/W2151135734","https://openalex.org/W2161694911","https://openalex.org/W2209092901","https://openalex.org/W2901608006","https://openalex.org/W3139341974","https://openalex.org/W4242081635","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W22108090","https://openalex.org/W2351720606","https://openalex.org/W4244673516","https://openalex.org/W2227684440","https://openalex.org/W2383581812","https://openalex.org/W272774291","https://openalex.org/W2070665098","https://openalex.org/W2024199467","https://openalex.org/W2036607776","https://openalex.org/W4299788560"],"abstract_inverted_index":{"We":[0,90],"present":[1,92],"the":[2,9,37,46,50,57,83,98,102,114,119],"priority":[3],"R-tree,":[4,47],"or":[5],"PR-tree,":[6],"which":[7],"is":[8,36,49,56,61],"first":[10],"R-tree":[11,70,121],"variant":[12],"that":[13,113],"always":[14],"answers":[15],"a":[16,73],"window":[17],"query":[18,74],"using":[19,104],"O":[20],"((":[21],"N":[22,35,78],"/":[23,30,79],"B":[24,31,48,80],")":[25,32],"1\u22121/":[26],"d":[27,40],"+":[28],"T":[29,55,87],"I/Os,":[33],"where":[34,72],"number":[38],"of":[39,97,101],"-dimensional":[41],"(hyper-)":[42],"rectangles":[43],"stored":[44],"in":[45,82],"disk":[51],"block":[52],"size,":[53],"and":[54,65,107,125],"output":[58],"size.":[59],"This":[60,110],"provably":[62],"asymptotically":[63],"optimal":[64],"significantly":[66,133],"better":[67],"than":[68],"other":[69],"variants,":[71],"may":[75],"visit":[76],"all":[77],"leaves":[81],"tree":[84],"even":[85],"when":[86],"=":[88],"0.":[89],"also":[91],"an":[93],"extensive":[94],"experimental":[95],"study":[96,111],"practical":[99],"performance":[100],"PR-tree":[103,115],"both":[105],"real-life":[106,124],"synthetic":[108],"data.":[109,137],"shows":[112],"performs":[116],"similarly":[117],"to":[118],"best-known":[120],"variants":[122],"on":[123,134],"relatively":[126],"nicely":[127],"distributed":[128],"data,":[129],"but":[130],"outperforms":[131],"them":[132],"more":[135],"extreme":[136]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":19}],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2016-06-24T00:00:00"}