{"id":"https://openalex.org/W4318148014","doi":"https://doi.org/10.1109/bigdata55660.2022.10020464","title":"Hybrid Approximate Nearest Neighbor Indexing and Search (HANNIS) for Large Descriptor Databases","display_name":"Hybrid Approximate Nearest Neighbor Indexing and Search (HANNIS) for Large Descriptor Databases","publication_year":2022,"publication_date":"2022-12-17","ids":{"openalex":"https://openalex.org/W4318148014","doi":"https://doi.org/10.1109/bigdata55660.2022.10020464"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata55660.2022.10020464","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata55660.2022.10020464","pdf_url":null,"source":{"id":"https://openalex.org/S4363607709","display_name":"2022 IEEE International Conference on Big Data (Big Data)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Big Data (Big Data)","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/A5101472406","display_name":"Muhammad Mahbubur Rahman","orcid":"https://orcid.org/0009-0008-4846-0248"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M M Mahabubur Rahman","raw_affiliation_strings":["Texas State University,Computer Science,San Marcos,TX,USA","Computer Science, Texas State University, San Marcos, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas State University,Computer Science,San Marcos,TX,USA","institution_ids":["https://openalex.org/I13511017"]},{"raw_affiliation_string":"Computer Science, Texas State University, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068828260","display_name":"Jelena Te\u0161i\u0107","orcid":"https://orcid.org/0000-0002-9972-9760"},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jelena Tesic","raw_affiliation_strings":["Texas State University,Computer Science,San Marcos,TX,USA","Computer Science, Texas State University, San Marcos, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas State University,Computer Science,San Marcos,TX,USA","institution_ids":["https://openalex.org/I13511017"]},{"raw_affiliation_string":"Computer Science, Texas State University, San Marcos, TX, USA","institution_ids":["https://openalex.org/I13511017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101472406"],"corresponding_institution_ids":["https://openalex.org/I13511017"],"apc_list":null,"apc_paid":null,"fwci":0.9806,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.78388626,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"3895","last_page":"3902"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9993000030517578,"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.9861999750137329,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.8635261654853821},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.758953332901001},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6631501913070679},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6366066336631775},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5332004427909851},{"id":"https://openalex.org/keywords/database-index","display_name":"Database index","score":0.5058150291442871},{"id":"https://openalex.org/keywords/precision-and-recall","display_name":"Precision and recall","score":0.498626708984375},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4838963449001312},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.45824098587036133},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.4237770438194275},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.4176342189311981},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.4108462929725647},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.386050283908844},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.38089749217033386},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.3451805114746094},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27918052673339844},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.2396816611289978}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.8635261654853821},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.758953332901001},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6631501913070679},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6366066336631775},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5332004427909851},{"id":"https://openalex.org/C59276292","wikidata":"https://www.wikidata.org/wiki/Q580427","display_name":"Database index","level":3,"score":0.5058150291442871},{"id":"https://openalex.org/C81669768","wikidata":"https://www.wikidata.org/wiki/Q2359161","display_name":"Precision and recall","level":2,"score":0.498626708984375},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4838963449001312},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.45824098587036133},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.4237770438194275},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.4176342189311981},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.4108462929725647},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.386050283908844},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.38089749217033386},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.3451805114746094},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27918052673339844},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.2396816611289978},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata55660.2022.10020464","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata55660.2022.10020464","pdf_url":null,"source":{"id":"https://openalex.org/S4363607709","display_name":"2022 IEEE International Conference on Big Data (Big Data)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320316108","display_name":"NAV","ror":"https://ror.org/00qghd717"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W145388748","https://openalex.org/W639708223","https://openalex.org/W642889137","https://openalex.org/W2086504823","https://openalex.org/W2088171019","https://openalex.org/W2099253838","https://openalex.org/W2110026675","https://openalex.org/W2118269922","https://openalex.org/W2118323718","https://openalex.org/W2124509324","https://openalex.org/W2134255711","https://openalex.org/W2194775991","https://openalex.org/W2278991086","https://openalex.org/W2294518132","https://openalex.org/W2523268797","https://openalex.org/W2895805257","https://openalex.org/W2949985202","https://openalex.org/W2962749812","https://openalex.org/W2963213349","https://openalex.org/W2963265099","https://openalex.org/W2963284996","https://openalex.org/W2963469388","https://openalex.org/W2998702515","https://openalex.org/W3136183693","https://openalex.org/W6620707391","https://openalex.org/W6668990524","https://openalex.org/W6677953180","https://openalex.org/W6695283887","https://openalex.org/W6755381438"],"related_works":["https://openalex.org/W4246757943","https://openalex.org/W2155354516","https://openalex.org/W1559170227","https://openalex.org/W2890061582","https://openalex.org/W2038472035","https://openalex.org/W2358559774","https://openalex.org/W3113728200","https://openalex.org/W2039016037","https://openalex.org/W4318148014","https://openalex.org/W1255550"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5],"novel":[6],"method":[7,20],"for":[8,21,25],"efficient":[9],"and":[10,23,58,71,114,119],"effective":[11],"retrieval":[12,45,97,120],"of":[13,106,110],"similar":[14,37],"deep":[15],"descriptors.":[16],"Our":[17],"new":[18],"hybrid":[19,53],"indexing":[22,57],"searching":[24],"the":[26,40,44,63,68,93],"approximate":[27,54],"nearest":[28,55],"neighbors":[29],"in":[30,39,104],"high-dimensional":[31],"large":[32],"deep-descriptor":[33],"databases":[34],"retrieves":[35],"truly":[36,90],"items":[38,87],"database,":[41],"even":[42],"if":[43],"set":[46],"is":[47],"large.":[48],"The":[49],"proposed":[50],"solution":[51],"\u2014-":[52,61],"neighbor":[56],"search":[59],"(HANNIS)":[60],"partitions":[62],"whole":[64],"data":[65],"space":[66],"using":[67,76],"kmeans++":[69],"algorithm":[70],"then":[72],"indexes":[73],"each":[74],"cluster":[75],"adapted":[77],"hierarchical":[78],"navigable":[79],"graphs.":[80],"This":[81],"approach":[82],"enables":[83],"us":[84],"to":[85,92,112],"load":[86],"that":[88],"are":[89],"close":[91],"incoming":[94],"query":[95],"at":[96,108],"time.":[98],"HANNIS":[99],"outperforms":[100],"all":[101],"state-of-the-art":[102],"methods":[103],"terms":[105],"recall":[107],"depths":[109],"up":[111],"100":[113],"offers":[115],"consistent":[116],"index":[117],"loading":[118],"performance.":[121]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}