{"id":"https://openalex.org/W7161073599","doi":"https://doi.org/10.48550/arxiv.2605.11313","title":"Performance bounds for nearest neighbor search with k-d trees","display_name":"Performance bounds for nearest neighbor search with k-d trees","publication_year":2026,"publication_date":"2026-05-11","ids":{"openalex":"https://openalex.org/W7161073599","doi":"https://doi.org/10.48550/arxiv.2605.11313"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.11313","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.11313","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.11313","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136062720","display_name":"Marco Bazzani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bazzani, Marco","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101707744","display_name":"Sanjoy Dasgupta","orcid":"https://orcid.org/0000-0002-5960-5157"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dasgupta, Sanjoy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.38839998841285706,"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"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.38839998841285706,"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.20960000157356262,"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/T11106","display_name":"Data Management and Algorithms","score":0.06750000268220901,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.7480000257492065},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.6782000064849854},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6474000215530396},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.5895000100135803},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5687000155448914},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5367000102996826},{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.5304999947547913},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.5026000142097473}],"concepts":[{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.7480000257492065},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.6782000064849854},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6474000215530396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6322000026702881},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.5895000100135803},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5687000155448914},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5367000102996826},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.5304999947547913},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.5026000142097473},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.42399999499320984},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4133000075817108},{"id":"https://openalex.org/C94475309","wikidata":"https://www.wikidata.org/wiki/Q6489154","display_name":"Large margin nearest neighbor","level":3,"score":0.39890000224113464},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.38929998874664307},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.36070001125335693},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.36000001430511475},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32690000534057617},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32100000977516174},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.3192000091075897},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3188000023365021},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.31040000915527344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3000999987125397},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.26660001277923584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.11313","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.11313","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.11313","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.11313","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"$k$-d":[1,41],"tree":[2],"is":[3,114,126],"one":[4],"of":[5,97,103,121],"the":[6,33,46,51,67,95,101,111,119,132,178,202,206,209],"oldest":[7],"and":[8,100,138,174,208],"most":[9,161],"widely":[10],"used":[11],"data":[12,48,122,172,191],"structures":[13],"for":[14,194],"nearest":[15,34,68,133,179],"neighbor":[16,35,134,180],"search.":[17,105,214],"It":[18],"partitions":[19],"Euclidean":[20],"space":[21],"into":[22],"axis-aligned":[23],"rectangular":[24],"cells.":[25],"There":[26],"are":[27,72],"two":[28],"standard":[29],"ways":[30],"to":[31,36,63,75,130],"find":[32],"a":[37,40],"query":[38,207],"in":[39,50,78,118],"tree.":[42],"Defeatist":[43],"search":[44,56,99,125,140,158,176],"returns":[45,177],"closest":[47],"point":[49,210],"query's":[52],"cell,":[53],"while":[54],"comprehensive":[55,98,139,157],"also":[57,148],"searches":[58],"other":[59],"cells":[60,163],"as":[61],"needed":[62],"guarantee":[64],"it":[65],"finds":[66],"neighbor.":[69],"Both":[70],"strategies":[71],"commonly":[73],"believed":[74],"perform":[76],"poorly":[77],"high":[79,145,155],"dimensions,":[80],"but":[81],"there":[82],"have":[83],"been":[84],"few":[85],"theoretical":[86],"results":[87],"explaining":[88],"this.":[89],"We":[90,147],"prove":[91],"non-asymptotic":[92],"bounds":[93],"on":[94,151],"runtime":[96],"accuracy":[102],"defeatist":[104,124,175,213],"Under":[106],"mild":[107],"distributional":[108],"assumptions,":[109],"when":[110,164,181],"dimension":[112],"$d$":[113],"at":[115,160,168,186],"least":[116,169,187],"polylogarithmic":[117],"number":[120],"points,":[123,173],"no":[127],"more":[128],"likely":[129],"return":[131],"than":[135],"random":[136],"guessing,":[137],"visits":[141,159],"every":[142],"cell":[143,166,183],"with":[144,154],"probability.":[146],"show":[149],"that":[150],"uniform":[152],"data,":[153],"probability,":[156],"$2^{\\mathcal{O}(d)}$":[162],"each":[165,182],"contains":[167,185],"logarithmically":[170],"many":[171],"additionally":[184],"$2^{\\mathcal{O}(d":[188],"\\log":[189],"d)}$":[190],"points.":[192],"Finally,":[193],"arbitrary":[195],"absolutely":[196],"continuous":[197],"distributions,":[198],"we":[199],"upper":[200],"bound":[201],"expected":[203],"distance":[204],"between":[205],"returned":[211],"by":[212]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-14T00:00:00"}