{"id":"https://openalex.org/W2131383217","doi":"https://doi.org/10.1145/1007568.1007608","title":"The Priority R-tree","display_name":"The Priority R-tree","publication_year":2004,"publication_date":"2004-06-13","ids":{"openalex":"https://openalex.org/W2131383217","doi":"https://doi.org/10.1145/1007568.1007608","mag":"2131383217"},"language":"en","primary_location":{"id":"doi:10.1145/1007568.1007608","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007568.1007608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-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/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lars Arge","raw_affiliation_strings":["Duke University, Durham, NC"],"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC","institution_ids":["https://openalex.org/I170897317"]}]},{"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/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Herman J. Haverkort","raw_affiliation_strings":["Utrecht University, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"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/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ke Yi","raw_affiliation_strings":["Duke University, Durham, NC"],"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5084056010"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":6.2978,"has_fulltext":false,"cited_by_count":115,"citation_normalized_percentile":{"value":0.97063173,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"347","last_page":"358"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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":1.0,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9976000189781189,"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/tree","display_name":"Tree (set theory)","score":0.775025486946106},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.6168156862258911},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.5782644748687744},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5649392008781433},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.5573794841766357},{"id":"https://openalex.org/keywords/range-tree","display_name":"Range tree","score":0.5340897440910339},{"id":"https://openalex.org/keywords/fractal-tree-index","display_name":"Fractal tree index","score":0.5194653868675232},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5161731839179993},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.515108048915863},{"id":"https://openalex.org/keywords/tree-of-life","display_name":"Tree of life (biology)","score":0.45082733035087585},{"id":"https://openalex.org/keywords/r-tree","display_name":"R-tree","score":0.4354987144470215},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37258702516555786},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3665848672389984},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34251484274864197},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2992713749408722},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.23388007283210754},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.19864752888679504},{"id":"https://openalex.org/keywords/phylogenetic-tree","display_name":"Phylogenetic tree","score":0.1408931016921997},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.08295300602912903}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.775025486946106},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.6168156862258911},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.5782644748687744},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5649392008781433},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.5573794841766357},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.5340897440910339},{"id":"https://openalex.org/C163736687","wikidata":"https://www.wikidata.org/wiki/Q17014592","display_name":"Fractal tree index","level":5,"score":0.5194653868675232},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5161731839179993},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.515108048915863},{"id":"https://openalex.org/C124388736","wikidata":"https://www.wikidata.org/wiki/Q3247497","display_name":"Tree of life (biology)","level":4,"score":0.45082733035087585},{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.4354987144470215},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37258702516555786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3665848672389984},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34251484274864197},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2992713749408722},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.23388007283210754},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.19864752888679504},{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.1408931016921997},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.08295300602912903},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C203689450","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial database","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1007568.1007608","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007568.1007608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2004 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/ed59bdb0-e888-11dc-9afb-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/ed59bdb0-e888-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 & Yi, K 2004, The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-tree. in G Weikum, A C K\u00f6nig & S Dessloch (eds), Proceedings of ACM SIGMOD International Conference on Management of Data. Association for Computing Machinery, pp. 347-358, ACM SIGMOD international conference on Management of data, Paris, France, 13/06/2004. https://doi.org/10.1145/1007568.1007608","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/0048545c-7af9-4118-af7c-92d38ddddd93","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/0048545c-7af9-4118-af7c-92d38ddddd93","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 2004, The priority R-tree : a practically efficient and worst-case optimal R-tree. in Proceedings ACM Special Interest Group on Management of Data (SIGMOD 2004, Paris, France, June 13-18, 2004). Association for Computing Machinery, Inc., New York, pp. 347-358.","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":26,"referenced_works":["https://openalex.org/W1489669349","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/W1991383761","https://openalex.org/W2041762692","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/W2515109297","https://openalex.org/W2901608006","https://openalex.org/W4285719527","https://openalex.org/W6632562042","https://openalex.org/W6636710603","https://openalex.org/W6679274366"],"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,78],"present":[1,80],"the":[2,9,28,36,40,47,71,86,90,102,107],"Priority":[3],"R-tree,":[4,37],"or":[5],"PR-tree,":[6],"which":[7],"is":[8,27,39,46,51],"first":[10],"R-tree":[11,60,110],"variant":[12],"that":[13,101],"always":[14],"answers":[15],"a":[16,63],"window":[17],"query":[18,64],"using":[19,92],"O((N/B)1":[20],"1/d":[21],"+":[22],"T/B)":[23],"I/Os,":[24],"where":[25,62],"N":[26],"number":[29],"of":[30,85,89],"d-dimensional":[31],"(hyper-)":[32],"rectangles":[33],"stored":[34],"in":[35,70],"B":[38],"disk":[41],"block":[42],"size,":[43],"and":[44,55,95,114],"T":[45,75],"output":[48],"size.":[49],"This":[50,98],"provably":[52],"asymptotically":[53],"optimal":[54],"significantly":[56,122],"better":[57],"than":[58],"other":[59],"variants,":[61],"may":[65],"visit":[66],"all":[67],"N/B":[68],"leaves":[69],"tree":[72],"even":[73],"when":[74],"=":[76],"0.":[77],"also":[79],"an":[81],"extensive":[82],"experimental":[83],"study":[84,99],"practical":[87],"performance":[88],"PR-tree":[91,103],"both":[93],"real-life":[94,113],"synthetic":[96],"data.":[97,126],"shows":[100],"performs":[104],"similar":[105],"to":[106],"best":[108],"known":[109],"variants":[111],"on":[112,123],"relatively":[115],"nicely":[116],"distributed":[117],"data,":[118],"but":[119],"outperforms":[120],"them":[121],"more":[124],"extreme":[125]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":14}],"updated_date":"2026-03-25T14:56:36.534964","created_date":"2025-10-10T00:00:00"}