{"id":"https://openalex.org/W7134198017","doi":"https://doi.org/10.1109/bigdata66926.2025.11402093","title":"IVF++: A Flexible and Efficient Algorithm for Approximate Nearest Neighbor Search under Attribute Constraint","display_name":"IVF++: A Flexible and Efficient Algorithm for Approximate Nearest Neighbor Search under Attribute Constraint","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W7134198017","doi":"https://doi.org/10.1109/bigdata66926.2025.11402093"},"language":null,"primary_location":{"id":"doi:10.1109/bigdata66926.2025.11402093","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata66926.2025.11402093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Big Data (BigData)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114390110","display_name":"Reon Uemura","orcid":null},"institutions":[{"id":"https://openalex.org/I14314212","display_name":"Osaka University of Economics","ror":"https://ror.org/04g11bp59","country_code":"JP","type":"education","lineage":["https://openalex.org/I14314212"]},{"id":"https://openalex.org/I4210111835","display_name":"Osaka Health Science University","ror":"https://ror.org/01tvqd679","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210111835"]},{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Reon Uemura","raw_affiliation_strings":["Graduate School of Information Science and Technology, The University of Osaka,Osaka,Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, The University of Osaka,Osaka,Japan","institution_ids":["https://openalex.org/I98285908","https://openalex.org/I14314212","https://openalex.org/I4210111835"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009228302","display_name":"Daichi Amagata","orcid":"https://orcid.org/0000-0001-8571-4931"},"institutions":[{"id":"https://openalex.org/I14314212","display_name":"Osaka University of Economics","ror":"https://ror.org/04g11bp59","country_code":"JP","type":"education","lineage":["https://openalex.org/I14314212"]},{"id":"https://openalex.org/I4210111835","display_name":"Osaka Health Science University","ror":"https://ror.org/01tvqd679","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210111835"]},{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Daichi Amagata","raw_affiliation_strings":["Graduate School of Information Science and Technology, The University of Osaka,Osaka,Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, The University of Osaka,Osaka,Japan","institution_ids":["https://openalex.org/I98285908","https://openalex.org/I14314212","https://openalex.org/I4210111835"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5114390110"],"corresponding_institution_ids":["https://openalex.org/I14314212","https://openalex.org/I4210111835","https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.80269988,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"7444","last_page":"7451"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.38609999418258667,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.38609999418258667,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.20149999856948853,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.04729999974370003,"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/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.4794999957084656},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4603999853134155},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4153999984264374},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.3806000053882599},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.3686999976634979},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.35010001063346863},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.34200000762939453}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5285000205039978},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.4794999957084656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47850000858306885},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4603999853134155},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4153999984264374},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.3806000053882599},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3747999966144562},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3686999976634979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36629998683929443},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.35010001063346863},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.34200000762939453},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.3384999930858612},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.314300000667572},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31189998984336853},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.30070000886917114},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.25780001282691956},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2522999942302704}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata66926.2025.11402093","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata66926.2025.11402093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Big Data (BigData)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W2077815765","https://openalex.org/W2110026675","https://openalex.org/W2250539671","https://openalex.org/W2963265099","https://openalex.org/W2963469388","https://openalex.org/W3029865833","https://openalex.org/W3094858795","https://openalex.org/W3136183693","https://openalex.org/W3174637788","https://openalex.org/W3174809957","https://openalex.org/W3175358558","https://openalex.org/W3196481040","https://openalex.org/W3196483145","https://openalex.org/W4205340696","https://openalex.org/W4210466590","https://openalex.org/W4289533999","https://openalex.org/W4306317701","https://openalex.org/W4309651817","https://openalex.org/W4318185088","https://openalex.org/W4367046898","https://openalex.org/W4380433185","https://openalex.org/W4381329135","https://openalex.org/W4384518989","https://openalex.org/W4393183654","https://openalex.org/W4399174383","https://openalex.org/W4399175194","https://openalex.org/W4399344197","https://openalex.org/W4399794670","https://openalex.org/W4400524927","https://openalex.org/W4403716461","https://openalex.org/W4405623356","https://openalex.org/W4410544010","https://openalex.org/W4411446067","https://openalex.org/W4412408444","https://openalex.org/W4415124086"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-09T07:06:17.341095","created_date":"2026-03-09T00:00:00"}