{"id":"https://openalex.org/W2132082507","doi":"https://doi.org/10.1007/3-540-44503-x_28","title":"On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces","display_name":"On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2132082507","doi":"https://doi.org/10.1007/3-540-44503-x_28","mag":"2132082507"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44503-x_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44503-x_28","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-70108","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036678816","display_name":"Stefan Berchtold","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Stefan Berchtold","raw_affiliation_strings":["stb gmbh, Ulrichsplatz 6, 86150, Augsburg, Germany"],"affiliations":[{"raw_affiliation_string":"stb gmbh, Ulrichsplatz 6, 86150, Augsburg, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062860517","display_name":"Christian B\u00f6hm","orcid":"https://orcid.org/0000-0002-2237-9969"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian B\u00f6hm","raw_affiliation_strings":["University of Munich, Oettingenstr. 67, 80538, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"University of Munich, Oettingenstr. 67, 80538, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5096530578","display_name":"Daniel Keim","orcid":null},"institutions":[{"id":"https://openalex.org/I68956291","display_name":"Martin Luther University Halle-Wittenberg","ror":"https://ror.org/05gqaka33","country_code":"DE","type":"education","lineage":["https://openalex.org/I68956291"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Keim","raw_affiliation_strings":["University of Halle-Wittenberg, Kurt-Mothes Str. 1, 06099, Halle (Saale), Germany"],"affiliations":[{"raw_affiliation_string":"University of Halle-Wittenberg, Kurt-Mothes Str. 1, 06099, Halle (Saale), Germany","institution_ids":["https://openalex.org/I68956291"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078274992","display_name":"Florian Krebs","orcid":"https://orcid.org/0000-0001-6033-801X"},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Florian Krebs","raw_affiliation_strings":["University of Munich, Oettingenstr. 67, 80538, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"University of Munich, Oettingenstr. 67, 80538, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109848174","display_name":"Hans\u2010Peter Kriegel","orcid":null},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hans-Peter Kriegel","raw_affiliation_strings":["University of Munich, Oettingenstr. 67, 80538, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"University of Munich, Oettingenstr. 67, 80538, Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5036678816"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.7957,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.95786062,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"435","last_page":"449"},"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9980000257492065,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9962999820709229,"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/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.7657095193862915},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7593082189559937},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.713412880897522},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.7031347751617432},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7024778127670288},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6952014565467834},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6750463843345642},{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.5961390733718872},{"id":"https://openalex.org/keywords/block-size","display_name":"Block size","score":0.5544306635856628},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.551737904548645},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5176963806152344},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.46891388297080994},{"id":"https://openalex.org/keywords/high-dimensional","display_name":"High dimensional","score":0.4539291262626648},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.45093780755996704},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.442515105009079},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32223060727119446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1654762327671051},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.1649966835975647},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.15356427431106567},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.15307900309562683},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14132559299468994},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.0924624502658844},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.07610669732093811}],"concepts":[{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.7657095193862915},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7593082189559937},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.713412880897522},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7031347751617432},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7024778127670288},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6952014565467834},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6750463843345642},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.5961390733718872},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.5544306635856628},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.551737904548645},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5176963806152344},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.46891388297080994},{"id":"https://openalex.org/C3019722297","wikidata":"https://www.wikidata.org/wiki/Q4440864","display_name":"High dimensional","level":2,"score":0.4539291262626648},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.45093780755996704},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.442515105009079},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32223060727119446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1654762327671051},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.1649966835975647},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.15356427431106567},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.15307900309562683},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14132559299468994},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0924624502658844},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.07610669732093811},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-44503-x_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44503-x_28","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.123.2089","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.2089","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://infovis.uni-konstanz.de/papers/2001/icdt01query.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.5991","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.5991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dbs.informatik.uni-muenchen.de/Publikationen/Papers/icdt01-final.pdf","raw_type":"text"},{"id":"pmh:oai:kops.uni-konstanz.de:123456789/5710","is_oa":true,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-70108","pdf_url":null,"source":{"id":"https://openalex.org/S4306401487","display_name":"KOPS (University of Konstanz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189712700","host_organization_name":"University of Konstanz","host_organization_lineage":["https://openalex.org/I189712700"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Database Theory \u2014 ICDT 2001 / Van den Bussche, Jan; Vianu, Victor (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2001. - (Lecture Notes in Computer Science ; 1973). - S. 435-449. - ISBN 978-3-540-41456-8","raw_type":"doc-type:conferenceObject"}],"best_oa_location":{"id":"pmh:oai:kops.uni-konstanz.de:123456789/5710","is_oa":true,"landing_page_url":"http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-70108","pdf_url":null,"source":{"id":"https://openalex.org/S4306401487","display_name":"KOPS (University of Konstanz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189712700","host_organization_name":"University of Konstanz","host_organization_lineage":["https://openalex.org/I189712700"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Database Theory \u2014 ICDT 2001 / Van den Bussche, Jan; Vianu, Victor (Hrsg.). - Berlin, Heidelberg : Springer Berlin Heidelberg, 2001. - (Lecture Notes in Computer Science ; 1973). - S. 435-449. - ISBN 978-3-540-41456-8","raw_type":"doc-type:conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W2628525","https://openalex.org/W1497131759","https://openalex.org/W1541459201","https://openalex.org/W1723433588","https://openalex.org/W1975830550","https://openalex.org/W1978414048","https://openalex.org/W2000830496","https://openalex.org/W2010595692","https://openalex.org/W2021283827","https://openalex.org/W2024668293","https://openalex.org/W2037365151","https://openalex.org/W2046144220","https://openalex.org/W2055043387","https://openalex.org/W2063908367","https://openalex.org/W2084360845","https://openalex.org/W2090398718","https://openalex.org/W2104128006","https://openalex.org/W2129938590","https://openalex.org/W2136006972","https://openalex.org/W2136196605","https://openalex.org/W2145725688","https://openalex.org/W2150661231","https://openalex.org/W2151135734","https://openalex.org/W2155776210","https://openalex.org/W2238624099","https://openalex.org/W3143316023","https://openalex.org/W4285719527","https://openalex.org/W7062905887"],"related_works":["https://openalex.org/W1558159560","https://openalex.org/W4246757943","https://openalex.org/W1595303882","https://openalex.org/W2902799860","https://openalex.org/W4289129280","https://openalex.org/W3096071782","https://openalex.org/W2375128115","https://openalex.org/W2182477562","https://openalex.org/W2146980399","https://openalex.org/W2102975174"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}