{"id":"https://openalex.org/W2134438395","doi":"https://doi.org/10.1007/s00454-002-2817-1","title":"Box-Trees and R-Trees with Near-Optimal Query Time","display_name":"Box-Trees and R-Trees with Near-Optimal Query Time","publication_year":2002,"publication_date":"2002-08-01","ids":{"openalex":"https://openalex.org/W2134438395","doi":"https://doi.org/10.1007/s00454-002-2817-1","mag":"2134438395"},"language":"en","primary_location":{"id":"doi:10.1007/s00454-002-2817-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-002-2817-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-002-2817-1.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/s00454-002-2817-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110913337","display_name":"Agarwal","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":"Agarwal","raw_affiliation_strings":["Department of Computer Science, Box 90129, Duke University, Durham, NC 27708-0129, USA pankaj@cs.duke.edu , USA","Department of Computer Science, Box 90129, Duke University, Durham, NC 27708-0129, USA pankaj@cs.duke.edu, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Box 90129, Duke University, Durham, NC 27708-0129, USA pankaj@cs.duke.edu , USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Department of Computer Science, Box 90129, Duke University, Durham, NC 27708-0129, USA pankaj@cs.duke.edu, USA#TAB#","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046666783","display_name":"de Mt Mark Berg","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":"de Berg","raw_affiliation_strings":["Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands herman@cs.uu.nl, joachim@cs.uu.nl, markdb@cs.uu.nl , The Netherlands"],"affiliations":[{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands herman@cs.uu.nl, joachim@cs.uu.nl, markdb@cs.uu.nl , The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087003217","display_name":"Joachim Gudmundsson","orcid":"https://orcid.org/0000-0002-6778-7990"},"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":"Gudmundsson","raw_affiliation_strings":["Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands herman@cs.uu.nl, joachim@cs.uu.nl, markdb@cs.uu.nl , The Netherlands"],"affiliations":[{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands herman@cs.uu.nl, joachim@cs.uu.nl, markdb@cs.uu.nl , The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089036996","display_name":"Mikael Hammar","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"M. Hammar","raw_affiliation_strings":["Department of Computer Science, Lund University, Box 118, 221 00 Lund, Sweden mikael@cs.lth.se, Sweden","Department of Computer Science, Lund University, Box 118, 221 00 Lund, Sweden mikael@cs.lth.se, Sweden#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 221 00 Lund, Sweden mikael@cs.lth.se, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Computer Science, Lund University, Box 118, 221 00 Lund, Sweden mikael@cs.lth.se, Sweden#TAB#","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"last","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":"H. J. Haverkort","raw_affiliation_strings":["Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands herman@cs.uu.nl, joachim@cs.uu.nl, markdb@cs.uu.nl , The Netherlands"],"affiliations":[{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, The Netherlands herman@cs.uu.nl, joachim@cs.uu.nl, markdb@cs.uu.nl , The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5110913337"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.9198,"has_fulltext":true,"cited_by_count":60,"citation_normalized_percentile":{"value":0.96137765,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"28","issue":"3","first_page":"291","last_page":"312"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9973999857902527,"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/mathematics","display_name":"Mathematics","score":0.6750658750534058},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5610426664352417},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.5547159314155579},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5101628303527832},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4663977026939392},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.442607581615448},{"id":"https://openalex.org/keywords/minimum-bounding-box","display_name":"Minimum bounding box","score":0.440399706363678},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.43198078870773315},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.43034303188323975},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.4120231866836548},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4106992781162262},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2757919430732727},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26031309366226196},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.13078385591506958},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.10159972310066223},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.06595927476882935},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05798199772834778}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6750658750534058},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5610426664352417},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.5547159314155579},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5101628303527832},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4663977026939392},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.442607581615448},{"id":"https://openalex.org/C147037132","wikidata":"https://www.wikidata.org/wiki/Q6865426","display_name":"Minimum bounding box","level":3,"score":0.440399706363678},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.43198078870773315},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.43034303188323975},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.4120231866836548},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4106992781162262},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2757919430732727},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26031309366226196},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.13078385591506958},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.10159972310066223},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.06595927476882935},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05798199772834778},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00454-002-2817-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-002-2817-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-002-2817-1.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/05e7bc25-46b4-4fb0-b374-5ae248dbf536","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/05e7bc25-46b4-4fb0-b374-5ae248dbf536","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":"Agarwal, P K, Berg, de, M, Gudmundsson, J, Hammar, M & Haverkort, H J 2002, 'Box-trees and R-trees with near-optimal query time', Discrete and Computational Geometry, vol. 28, no. 3, pp. 291-312. https://doi.org/10.1007/s00454-002-2817-1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:lup.lub.lu.se:ba31b3ae-6460-4526-a38c-6a3b02026f01","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/329254","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0179-5376","raw_type":"text"},{"id":"pmh:tue:oai:pure.tue.nl:publications/05e7bc25-46b4-4fb0-b374-5ae248dbf536","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/05e7bc25-46b4-4fb0-b374-5ae248dbf536","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":"Discrete and Computational Geometry, 28(3), 291 - 312. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s00454-002-2817-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00454-002-2817-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00454-002-2817-1.pdf","source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5330868205","display_name":"Shipboard Scientific Support Equipment","funder_award_id":"9732787","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5766243811","display_name":"Experimental Software Systems:  Georgraphic Information     Systems on High-Speed Clusters:  A Vertically Integrated    Approach","funder_award_id":"9870724","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320333591","display_name":"Multidisciplinary University Research Initiative","ror":null},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2134438395.pdf","grobid_xml":"https://content.openalex.org/works/W2134438395.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1509772091","https://openalex.org/W1521225740","https://openalex.org/W1585062418","https://openalex.org/W1601375558","https://openalex.org/W1782358079","https://openalex.org/W1983471184","https://openalex.org/W1995358377","https://openalex.org/W1999250663","https://openalex.org/W2002509771","https://openalex.org/W2010958602","https://openalex.org/W2032596397","https://openalex.org/W2038142281","https://openalex.org/W2053239355","https://openalex.org/W2063296107","https://openalex.org/W2085933841","https://openalex.org/W2106642566","https://openalex.org/W2118269922","https://openalex.org/W2126539456","https://openalex.org/W2135961964","https://openalex.org/W2149906774","https://openalex.org/W2179904348","https://openalex.org/W3020567875","https://openalex.org/W3021967174","https://openalex.org/W3109965180","https://openalex.org/W4206206918","https://openalex.org/W4210521336","https://openalex.org/W4212859321","https://openalex.org/W4385490503","https://openalex.org/W6630341466","https://openalex.org/W6635067929","https://openalex.org/W6666212576"],"related_works":["https://openalex.org/W2006459955","https://openalex.org/W2955368753","https://openalex.org/W3125756434","https://openalex.org/W2184296057","https://openalex.org/W2349153818","https://openalex.org/W2118790811","https://openalex.org/W2347809727","https://openalex.org/W2382756238","https://openalex.org/W2385851311","https://openalex.org/W2180896803"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2016-06-24T00:00:00"}