{"id":"https://openalex.org/W7170717051","doi":"https://doi.org/10.48550/arxiv.2607.20957","title":"Fast and Efficient Approximate Nearest Neighbor Search for High-Dimensional LLM Embeddings","display_name":"Fast and Efficient Approximate Nearest Neighbor Search for High-Dimensional LLM Embeddings","publication_year":2026,"publication_date":"2026-07-23","ids":{"openalex":"https://openalex.org/W7170717051","doi":"https://doi.org/10.48550/arxiv.2607.20957"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.20957","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.20957","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2607.20957","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073245734","display_name":"Nico Hezel","orcid":"https://orcid.org/0000-0002-3957-4672"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hezel, Nico","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048382625","display_name":"Kai Uwe Barthel","orcid":"https://orcid.org/0000-0001-6309-572X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Barthel, Kai Uwe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078957329","display_name":"Bruno Schilling","orcid":"https://orcid.org/0009-0006-7021-7311"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schilling, Bruno","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002095484","display_name":"Konstantin Schall","orcid":"https://orcid.org/0000-0003-3548-0537"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schall, Konstantin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032763915","display_name":"Andre Moelle","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moelle, Andre","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5061510459","display_name":"Klaus Jung","orcid":"https://orcid.org/0000-0001-9797-5362"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jung, Klaus","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.35760000348091125,"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.35760000348091125,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.28679999709129333,"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/T11106","display_name":"Data Management and Algorithms","score":0.21889999508857727,"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/search-engine-indexing","display_name":"Search engine indexing","score":0.6953999996185303},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.550599992275238},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5475999712944031},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5406000018119812},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5102999806404114},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.4602000117301941},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.42579999566078186},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.42320001125335693},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.37790000438690186},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.37630000710487366}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6953999996185303},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6484000086784363},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.550599992275238},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5475999712944031},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5406000018119812},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5102999806404114},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.4602000117301941},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45350000262260437},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.42579999566078186},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.42320001125335693},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4221999943256378},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.37790000438690186},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.37630000710487366},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.37610000371932983},{"id":"https://openalex.org/C13670688","wikidata":"https://www.wikidata.org/wiki/Q3500548","display_name":"Space partitioning","level":2,"score":0.3756999969482422},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.3720000088214874},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.3716999888420105},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.34130001068115234},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.3319000005722046},{"id":"https://openalex.org/C145580432","wikidata":"https://www.wikidata.org/wiki/Q6497118","display_name":"Lattice graph","level":5,"score":0.3116999864578247},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.28540000319480896},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2533000111579895},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.25279998779296875}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.20957","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.20957","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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.2607.20957","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.20957","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":[{"score":0.40229499340057373,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"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],"annual":[1],"SISAP":[2],"Indexing":[3],"Challenge":[4],"benchmarks":[5],"Approximate":[6],"Nearest":[7],"Neighbor":[8,27],"Search":[9,41],"(ANNS)":[10],"algorithms":[11],"under":[12],"rigorous":[13],"constraints.":[14],"This":[15,111],"paper":[16],"presents":[17],"our":[18],"submissions":[19],"for":[20,58],"the":[21,74],"2026":[22],"edition,":[23],"addressing":[24],"both":[25],"$k$-Nearest":[26],"Graph":[28],"(kNNG)":[29],"construction":[30,51],"on":[31,43],"1024-dimensional":[32],"BGE-M3":[33],"embeddings":[34],"(Task":[35,47],"1)":[36],"and":[37,91,116],"Maximum":[38],"Inner":[39],"Product":[40],"(MIPS)":[42],"unnormalized":[44],"Llama-3.2-8B":[45],"features":[46],"2).":[48],"To":[49,87],"optimize":[50,92],"speed,":[52],"we":[53,72,95],"utilize":[54],"Equi-Voronoi":[55],"Polytopes":[56],"(EVP)":[57],"efficient":[59],"quantization,":[60],"supplemented":[61],"by":[62],"targeted":[63],"reranking":[64],"strategies":[65],"to":[66,108],"maintain":[67],"high":[68],"recall.":[69],"For":[70],"MIPS,":[71],"transform":[73],"asymmetric":[75],"inner":[76],"product":[77],"problem":[78],"into":[79],"a":[80,97],"Euclidean":[81],"search":[82],"space":[83],"via":[84,101],"dimensionality":[85],"augmentation.":[86],"reduce":[88],"query":[89],"latency":[90],"memory":[93],"access,":[94],"introduce":[96],"1D":[98],"presorting":[99],"mechanism":[100],"Fast":[102],"Linear":[103],"Assignment":[104],"Sorting":[105],"(FLAS)":[106],"prior":[107],"graph":[109,122],"construction.":[110],"significantly":[112],"improves":[113],"spatial":[114],"locality":[115],"cache":[117],"hit":[118],"rates":[119],"during":[120],"subsequent":[121],"traversal.":[123],"Source":[124],"Code:":[125],"https://github.com/Visual-Computing/sisap26-deglib":[126]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-25T00:00:00"}