{"id":"https://openalex.org/W7123811212","doi":"https://doi.org/10.48550/arxiv.2601.07183","title":"RAIRS: Optimizing Redundant Assignment and List Layout for IVF-Based ANN Search","display_name":"RAIRS: Optimizing Redundant Assignment and List Layout for IVF-Based ANN Search","publication_year":2026,"publication_date":"2026-01-12","ids":{"openalex":"https://openalex.org/W7123811212","doi":"https://doi.org/10.48550/arxiv.2601.07183"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.07183","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.07183","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.07183","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102725214","display_name":"Zehai Yang","orcid":"https://orcid.org/0009-0007-1031-8708"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yang, Zehai","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101499113","display_name":"Shimin Chen","orcid":"https://orcid.org/0009-0000-1043-6236"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Shimin","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102725214"],"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/T11106","display_name":"Data Management and Algorithms","score":0.4636000096797943,"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.4636000096797943,"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.4117000102996826,"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.01720000058412552,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.6699000000953674},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5486000180244446},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.520799994468689},{"id":"https://openalex.org/keywords/data-redundancy","display_name":"Data redundancy","score":0.46959999203681946},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.460999995470047},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.46059998869895935},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.43160000443458557},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.36739999055862427}],"concepts":[{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.6699000000953674},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6600000262260437},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5486000180244446},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.520799994468689},{"id":"https://openalex.org/C7545210","wikidata":"https://www.wikidata.org/wiki/Q838123","display_name":"Data redundancy","level":2,"score":0.46959999203681946},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.460999995470047},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.46059998869895935},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.43160000443458557},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.40400001406669617},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.388700008392334},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.36739999055862427},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.35120001435279846},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32499998807907104},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.31769999861717224},{"id":"https://openalex.org/C177292542","wikidata":"https://www.wikidata.org/wiki/Q440959","display_name":"Vector map","level":2,"score":0.31049999594688416},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.29589998722076416},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C32587265","wikidata":"https://www.wikidata.org/wiki/Q1182260","display_name":"Data deduplication","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.07183","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.07183","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.07183","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.07183","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"IVF":[0,32,43,53,94,199,226],"is":[1,22,80],"one":[2,31,104],"of":[3,19,38,130,178],"the":[4,36,46,51,57,64,74,87,93,98,123,128,131,141,163,170,176,224],"most":[5,88],"widely":[6],"used":[7],"ANNS":[8],"(Approximate":[9],"Nearest":[10],"Neighbors":[11],"Search)":[12],"methods":[13],"in":[14,42,101,107,154],"vector":[15,27,62,100,165],"databases.":[16],"The":[17],"idea":[18],"redundant":[20,108,179,214],"assignment":[21,215],"to":[23,28,121,156,162,193,220],"assign":[24],"a":[25,60],"data":[26,61,164,207],"more":[29,102],"than":[30,103],"lists":[33],"for":[34,86,140,198],"reducing":[35],"chance":[37],"missing":[39],"true":[40],"neighbors":[41],"search.":[44,200],"However,":[45],"naive":[47],"strategy,":[48],"which":[49],"selects":[50],"second":[52],"list":[54,65,83,132,187],"based":[55],"on":[56,73],"distance":[58,109,180,196],"between":[59],"and":[63,111,217],"centroids,":[66],"performs":[67],"poorly.":[68],"Previous":[69],"work":[70],"focuses":[71],"only":[72,147],"inner":[75],"product":[76],"distance,":[77],"while":[78],"there":[79],"no":[81],"optimized":[82,137,186],"selection":[84],"study":[85],"popular":[89],"Euclidean":[90,142],"space.":[91,143],"Moreover,":[92],"search":[95],"may":[96],"access":[97],"same":[99],"lists,":[105],"resulting":[106],"computation":[110],"decreasing":[112],"query":[113],"throughput.":[114],"In":[115],"this":[116],"paper,":[117],"we":[118,134,182],"present":[119],"RAIRS":[120,211],"address":[122],"above":[124],"two":[125],"challenges.":[126],"For":[127,175],"challenge":[129,177],"selection,":[133],"propose":[135,183],"an":[136,185],"AIR":[138,144],"metric":[139],"takes":[145],"not":[146],"distances":[148],"but":[149,166],"also":[150],"directions":[151],"into":[152],"consideration":[153],"order":[155],"support":[157],"queries":[158],"that":[159,189,210],"are":[160],"closer":[161],"father":[167],"away":[168],"from":[169],"first":[171],"chosen":[172],"list's":[173],"centroid.":[174],"computation,":[181],"SEIL,":[184],"layout":[188],"exploits":[190],"shared":[191],"cells":[192],"reduce":[194],"repeated":[195],"computations":[197],"Our":[201],"experimental":[202],"results":[203],"using":[204],"representative":[205],"real-world":[206],"sets":[208],"show":[209],"out-performs":[212],"existing":[213],"solutions":[216],"achieves":[218],"up":[219],"1.33x":[221],"improvement":[222],"over":[223],"best-performing":[225],"method,":[227],"IVF-PQ":[228],"Fast":[229],"Scan":[230],"with":[231],"refinement.":[232]},"counts_by_year":[],"updated_date":"2026-01-14T23:44:37.837170","created_date":"2026-01-14T00:00:00"}