{"id":"https://openalex.org/W7131072903","doi":"https://doi.org/10.48550/arxiv.2602.17858","title":"Multi-Attribute Group Fairness in $k$-NN Queries on Vector Databases","display_name":"Multi-Attribute Group Fairness in $k$-NN Queries on Vector Databases","publication_year":2026,"publication_date":"2026-02-19","ids":{"openalex":"https://openalex.org/W7131072903","doi":"https://doi.org/10.48550/arxiv.2602.17858"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.17858","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069404421","display_name":"Thinh On","orcid":"https://orcid.org/0000-0001-5493-0869"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"On, Thinh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009377962","display_name":"Senjuti Basu Roy","orcid":"https://orcid.org/0000-0003-3475-8138"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roy, Senjuti Basu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schieber, Baruch","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20826909,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.921500027179718,"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.921500027179718,"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/T10689","display_name":"Remote-Sensing Image Classification","score":0.013000000268220901,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.007600000128149986,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/generality","display_name":"Generality","score":0.7563999891281128},{"id":"https://openalex.org/keywords/cartesian-product","display_name":"Cartesian product","score":0.6521999835968018},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.6291000247001648},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.5163000226020813},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5013999938964844},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.46299999952316284},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.39100000262260437},{"id":"https://openalex.org/keywords/k-independent-hashing","display_name":"K-independent hashing","score":0.33799999952316284},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.3337000012397766}],"concepts":[{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.7563999891281128},{"id":"https://openalex.org/C65236422","wikidata":"https://www.wikidata.org/wiki/Q173740","display_name":"Cartesian product","level":2,"score":0.6521999835968018},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6431000232696533},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6291000247001648},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5163000226020813},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5013999938964844},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.46299999952316284},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4359999895095825},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.39100000262260437},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3582000136375427},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.33799999952316284},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.3337000012397766},{"id":"https://openalex.org/C18555067","wikidata":"https://www.wikidata.org/wiki/Q8375051","display_name":"Joint (building)","level":2,"score":0.32749998569488525},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.3172999918460846},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3125999867916107},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.31220000982284546},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.29789999127388},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.29510000348091125},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27000001072883606},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.2662999927997589},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2605000138282776},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.25699999928474426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2506999969482422}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.17858","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.17858","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.17858","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.17858","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","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":{"We":[0,79,146],"initiate":[1],"the":[2,51,94,170,173],"study":[3],"of":[4,97,172],"multi-attribute":[5],"group":[6],"fairness":[7,25,40],"in":[8],"$k$-nearest":[9],"neighbor":[10],"($k$-NN)":[11],"search":[12,73,159],"over":[13,93],"vector":[14,158],"databases.":[15],"Unlike":[16],"prior":[17],"work":[18],"that":[19,63,156],"optimizes":[20],"efficiency":[21],"or":[22,135],"query":[23],"filtering,":[24],"imposes":[26],"count":[27,107],"constraints":[28,45,108],"to":[29,84,115],"ensure":[30],"proportional":[31],"representation":[32],"across":[33,120],"groups":[34],"defined":[35],"by":[36],"protected":[37,98],"attributes.":[38,122],"When":[39],"spans":[41],"multiple":[42],"attributes,":[43,125],"these":[44],"must":[46],"be":[47,162],"satisfied":[48],"simultaneously,":[49],"making":[50],"problem":[52],"computationally":[53],"hard.":[54],"To":[55],"address":[56],"this,":[57],"we":[58,126,137],"propose":[59],"a":[60,90,112],"computational":[61,144],"framework":[62,102,175],"produces":[64],"high-quality":[65],"approximate":[66],"nearest":[67],"neighbors":[68],"with":[69,142],"good":[70],"trade-offs":[71],"between":[72],"time,":[74],"memory/indexing":[75],"cost,":[76],"and":[77,88,109,153,176],"recall.":[78],"adapt":[80],"locality-sensitive":[81],"hashing":[82],"(LSH)":[83],"accelerate":[85],"candidate":[86],"generation":[87],"build":[89],"lightweight":[91],"index":[92],"Cartesian":[95],"product":[96],"attribute":[99],"values.":[100],"Our":[101],"retrieves":[103],"candidates":[104],"satisfying":[105],"joint":[106],"then":[110],"applies":[111],"post-processing":[113],"stage":[114],"construct":[116],"fair":[117],"$k$-NN":[118],"results":[119],"all":[121],"For":[123],"2":[124],"present":[127],"an":[128],"exact":[129,140],"polynomial-time":[130],"flow-based":[131],"algorithm;":[132],"for":[133,165],"3":[134],"more,":[136],"formulate":[138],"ILP-based":[139],"solutions":[141],"higher":[143],"cost.":[145],"provide":[147],"theoretical":[148],"guarantees,":[149],"identify":[150],"efficiency--fairness":[151],"trade-offs,":[152],"empirically":[154],"show":[155],"existing":[157],"methods":[160],"cannot":[161],"directly":[163],"adapted":[164],"fairness.":[166],"Experimental":[167],"evaluations":[168],"demonstrate":[169],"generality":[171],"proposed":[174],"scalability.":[177]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-02-24T00:00:00"}