{"id":"https://openalex.org/W2808320493","doi":"https://doi.org/10.1145/3209884","title":"Randomized Approximate Nearest Neighbor Search with Limited Adaptivity","display_name":"Randomized Approximate Nearest Neighbor Search with Limited Adaptivity","publication_year":2018,"publication_date":"2018-03-31","ids":{"openalex":"https://openalex.org/W2808320493","doi":"https://doi.org/10.1145/3209884","mag":"2808320493"},"language":"en","primary_location":{"id":"doi:10.1145/3209884","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3209884","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-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/A5011067605","display_name":"Mingmou Liu","orcid":"https://orcid.org/0000-0003-1246-6804"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Mingmou Liu","raw_affiliation_strings":["Nanjing University, China, Xianlin Ave., Nanjing, Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University, China, Xianlin Ave., Nanjing, Jiangsu, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054780204","display_name":"Xiaoyin Pan","orcid":null},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoyin Pan","raw_affiliation_strings":["Nanjing University, China, Xianlin Ave., Nanjing, Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University, China, Xianlin Ave., Nanjing, Jiangsu, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101513638","display_name":"Yitong Yin","orcid":"https://orcid.org/0000-0001-9204-7794"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yitong Yin","raw_affiliation_strings":["Nanjing University, China, Xianlin Ave., Nanjing, Jiangsu, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University, China, Xianlin Ave., Nanjing, Jiangsu, China","institution_ids":["https://openalex.org/I881766915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011067605"],"corresponding_institution_ids":["https://openalex.org/I881766915"],"apc_list":null,"apc_paid":null,"fwci":0.3134,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.60974541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"5","issue":"1","first_page":"1","last_page":"26"},"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.9997000098228455,"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.9997000098228455,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6954994201660156},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6880567073822021},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5762770175933838},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5554144978523254},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.524990439414978},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4950768053531647},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4832106828689575},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4522472321987152},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4483609199523926},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.446725457906723},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4433525800704956},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4329882264137268},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.41067248582839966},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37165898084640503},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33414924144744873},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3181261420249939}],"concepts":[{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6954994201660156},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6880567073822021},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5762770175933838},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5554144978523254},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.524990439414978},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4950768053531647},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4832106828689575},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4522472321987152},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4483609199523926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.446725457906723},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4433525800704956},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4329882264137268},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.41067248582839966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37165898084640503},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33414924144744873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3181261420249939},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3209884","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3209884","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2407901551","display_name":null,"funder_award_id":"61722207&61672275","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W73389528","https://openalex.org/W1500866162","https://openalex.org/W1621285350","https://openalex.org/W1647207848","https://openalex.org/W1975663164","https://openalex.org/W1985177045","https://openalex.org/W1989664320","https://openalex.org/W1992402998","https://openalex.org/W1993022201","https://openalex.org/W2001964584","https://openalex.org/W2002501531","https://openalex.org/W2014096895","https://openalex.org/W2016185430","https://openalex.org/W2017851434","https://openalex.org/W2043356449","https://openalex.org/W2056216559","https://openalex.org/W2062539466","https://openalex.org/W2088101210","https://openalex.org/W2088263428","https://openalex.org/W2137428006","https://openalex.org/W2145065594","https://openalex.org/W2147717514","https://openalex.org/W2152272389","https://openalex.org/W2155074354","https://openalex.org/W2274470399","https://openalex.org/W2280470776","https://openalex.org/W2340787257","https://openalex.org/W2953227530","https://openalex.org/W4252017042","https://openalex.org/W4376544092"],"related_works":["https://openalex.org/W2007715402","https://openalex.org/W2004524662","https://openalex.org/W2899261484","https://openalex.org/W2489999748","https://openalex.org/W2962985337","https://openalex.org/W2036758175","https://openalex.org/W2274470399","https://openalex.org/W1552026372","https://openalex.org/W3184929353","https://openalex.org/W1972433940"],"abstract_inverted_index":{"We":[0,33,65,141],"study":[1],"the":[2,29,62,72,155,166,213,228,250],"complexity":[3],"of":[4,57,80,99,124,138,158,181,189,219,224],"parallel":[5,58,81,182],"data":[6,26,63,136,187],"structures":[7,27,137,188],"for":[8,24,102,127,154,161,261,265],"approximate":[9,73,167,266],"nearest":[10,74,168,267],"neighbor":[11,75,169,268],"search":[12,76,170,269],"in":[13,270],"d":[14,19,92,115,147,175,179,237,241,253,257],"-dimensional":[15],"Hamming":[16],"space":[17],"{0,1}":[18],".":[20,132],"A":[21],"classic":[22],"model":[23,31,37],"static":[25],"is":[28,49,200,243],"cell-probe":[30,36],"[27].":[32],"consider":[34],"a":[35,44,47],"with":[38,87,108],"limited":[39],"adaptivity":[40],",":[41],"where":[42],"given":[43],"k":[45,55,78,90,95,104,111,113,119,131,145,150,172,204,232],"\u22651,":[46],"query":[48],"resolved":[50],"by":[51],"making":[52],"at":[53],"most":[54],"rounds":[56,79,180,220],"memory":[59,82,100,125,159,183,225],"accesses":[60,101,126,160,184],"to":[61],"structure.":[64],"give":[66],"two":[67],"randomized":[68,163],"algorithms":[69,134,264],"that":[70,196],"solve":[71],"using":[77],"accesses:":[83],"\u2014a":[84],"simple":[85],"algorithm":[86,107,164,199,211,248],"O":[88,109,117,206,234],"(":[89,110],"(log":[91,146,235],")":[93,96,116,120,121,148,151,242,258],"1/":[94,149],"total":[97,122,156,222],"number":[98,123,157,218,223],"all":[103,128],"\u22651;":[105],"\u2014an":[106],"+(1/":[112],"log":[114,174,177,178,236,239,240,252,255,256],"(1/":[118],"sufficiently":[129],"large":[130],"Both":[133],"use":[135],"polynomial":[139,190],"size.":[140,191],"prove":[142],"an":[143],"\u03a9(1/":[144],"lower":[152,193],"bound":[153,194,260],"any":[162,186],"solving":[165],"within":[171],"\u2264log":[173],"/2log":[176],"on":[185],"This":[192],"shows":[195],"our":[197,209,246],"first":[198],"asymptotically":[201,214],"optimal":[202,215],"when":[203,231],"=":[205,233],"(1).":[207],"And":[208],"second":[210,247],"achieves":[212],"tradeoff":[216],"between":[217],"and":[221],"accesses.":[226],"In":[227],"extremal":[229],"case,":[230],"/log":[238,254],"big":[244],"enough,":[245],"matches":[249],"\u0398(log":[251],"tight":[259],"fully":[262],"adaptive":[263],"[11].":[271]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}