{"id":"https://openalex.org/W2274470399","doi":"https://doi.org/10.1145/2935764.2935776","title":"Randomized Approximate Nearest Neighbor Search with Limited Adaptivity","display_name":"Randomized Approximate Nearest Neighbor Search with Limited Adaptivity","publication_year":2016,"publication_date":"2016-07-08","ids":{"openalex":"https://openalex.org/W2274470399","doi":"https://doi.org/10.1145/2935764.2935776","mag":"2274470399"},"language":"en","primary_location":{"id":"doi:10.1145/2935764.2935776","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2935764.2935776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","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/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, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University, Nanjing, 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, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University, Nanjing, 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, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"Nanjing University, Nanjing, 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.501,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70500277,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"23","last_page":"33"},"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.9995999932289124,"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.9995999932289124,"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.9980000257492065,"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.9979000091552734,"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/randomized-algorithm","display_name":"Randomized algorithm","score":0.6574743986129761},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6426083445549011},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6305238604545593},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.5598703622817993},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5548702478408813},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5427359342575073},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5354426503181458},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5154998898506165},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4687657058238983},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4657730758190155},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4365772306919098},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4264613389968872},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4243786931037903},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40279626846313477},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36500632762908936},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3645440340042114}],"concepts":[{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6574743986129761},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6426083445549011},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6305238604545593},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.5598703622817993},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5548702478408813},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5427359342575073},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5354426503181458},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5154998898506165},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4687657058238983},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4657730758190155},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4365772306919098},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4264613389968872},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4243786931037903},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40279626846313477},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36500632762908936},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3645440340042114},{"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/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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2935764.2935776","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2935764.2935776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W73389528","https://openalex.org/W1500866162","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/W2340787257","https://openalex.org/W4236234410","https://openalex.org/W4290864872"],"related_works":["https://openalex.org/W2007715402","https://openalex.org/W2004524662","https://openalex.org/W2899261484","https://openalex.org/W2274470399","https://openalex.org/W2962985337","https://openalex.org/W2036758175","https://openalex.org/W1552026372","https://openalex.org/W3184929353","https://openalex.org/W1972433940","https://openalex.org/W2953227530"],"abstract_inverted_index":{"We":[0,14,32,89,127],"study":[1,15],"the":[2,16,19,22,36,43,52,71,120,125,135,147,195,208,222,228,244],"problem":[3,20],"of":[4,18,48,79,115,122,138,163,171,211],"approximate":[5,72,148,258],"nearest":[6,73,149,259],"neighbor":[7,74,150,260],"search":[8,75,151,261],"in":[9,21,35,87,103,118,124,204],"$d$-dimensional":[10],"Hamming":[11],"space":[12],"{0,1}d.":[13],"complexity":[17],"famous":[23],"cell-probe":[24,37],"model,":[25],"a":[26,56,66,92,205],"classic":[27],"model":[28,38],"for":[29,55,106,134,185,214,230,253,257],"data":[30,53,113,169],"structures.":[31],"consider":[33],"algorithms":[34,111,256],"with":[39,83],"limited":[40],"adaptivity,":[41],"where":[42],"algorithm":[44,69,96,145,181,193,223,242],"makes":[45],"k":[46,61,77,104,153],"rounds":[47,78,105,162,200,217],"parallel":[49,80,164],"accesses":[50,86,102,140,166,213],"to":[51,263],"structure":[54],"given":[57],"k.":[58,109,189],"For":[59],"any":[60,143,168,186,215],"\u2265":[62],"1,":[63],"we":[64],"give":[65,91],"simple":[67],"randomized":[68,95,144],"solving":[70,146],"using":[76,97],"memory":[81,101,139,165,202,212],"accesses,":[82,203],"O(k(log":[84],"d)1/k)":[85,131],"total.":[88],"also":[90],"more":[93],"sophisticated":[94],"O(k+(1/k":[98],"log":[99,156,158,159,160,235,237,238,246,248,249],"d)O(1/k))":[100],"large":[107,232],"enough":[108,233],"Both":[110],"use":[112],"structures":[114,170],"size":[116],"polynomial":[117,172],"n,":[119],"number":[121,137],"points":[123],"database.":[126],"prove":[128],"an":[129],"\u03a9(1/k(log":[130],"lower":[132,175,209],"bound":[133,176,210,252],"total":[136],"required":[141],"by":[142,221],"within":[152,224],"\u2264":[154],"(log":[155],"d)/(2":[157],"d)":[161],"on":[167],"size.":[173],"This":[174],"shows":[177],"that":[178,207],"our":[179,191,240],"first":[180],"is":[182],"asymptotically":[183,196],"optimal":[184,197],"constant":[187],"round":[188],"And":[190],"second":[192,241],"approaches":[194],"tradeoff":[198],"between":[199],"and":[201,265],"sense":[206],"k1":[216],"can":[218],"be":[219],"matched":[220],"k2=O(k1)":[225],"rounds.":[226],"In":[227],"extreme,":[229],"some":[231],"k=\u0398((log":[234],"d)/(log":[236,247],"d)),":[239],"matches":[243],"\u0398((log":[245],"d))":[250],"tight":[251],"fully":[254],"adaptive":[255],"due":[262],"Chakrabarti":[264],"Regev.":[266]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}