Fetching the paper…
Reading the bibliography…
The in-memory algorithms for approximate nearest neighbor search (ANNS) have achieved great success for fast high-recall search, but are extremely expensive when handling very large scale database.
Multidimensional binary search trees used for associative searching
Jon Louis Bentley · 1975
Earlier work this paper cites.
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Jerome H. Freidman, Jon Louis Bentley, and Raphael Ari Finkel · 1977
Earlier work this paper cites.
The relative neighbourhood graph of a finite planar set
Godfried T Toussaint · 1980
Earlier work this paper cites.
Refinements to nearest-neighbor searching in k-dimensional trees
Robert F. Sproull · 1991
Earlier work this paper cites.
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
Peter N Yianilos · 1993
Earlier work this paper cites.
Shape indexing using approximate nearest-neighbour search in high-dimensional spaces
Jeffrey S Beis and David G Lowe · 1997
Earlier work this paper cites.
Locality-sensitive hashing scheme based on p-stable distributions
Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S. Mirrokni · 2004
Earlier work this paper cites.
An investigation of practical approximate nearest neighbor algorithms
Ting Liu, Andrew W Moore, Alexander Gray, and Ke Yang · 2004
Earlier work this paper cites.
Scalable recognition with a vocabulary tree
David Nister and Henrik Stewenius · 2006
Earlier work this paper cites.
Random projection trees and low dimensional manifolds
Sanjoy Dasgupta and Yoav Freund · 2008
Earlier work this paper cites.
Fast image search for learned metrics
P. Jain, B. Kulis, and K. Grauman · 2008
Earlier work this paper cites.
Learning to hash with binary reconstructive embeddings
Brian Kulis and Trevor Darrell · 2009
Earlier work this paper cites.
Spectral hashing
Yair Weiss, Antonio Torralba, and Rob Fergus · 2009
Earlier work this paper cites.
Product quantization for nearest neighbor search
Herve Jegou, Matthijs Douze, and Cordelia Schmid · 2010
Earlier work this paper cites.
Efficient k-nearest neighbor graph construction for generic similarity measures
Wei Dong, Moses Charikar, and Kai Li · 2011
Earlier work this paper cites.
Fast approximate nearest-neighbor search with k-nearest neighbor graph
Kiana Hajebi, Yasin Abbasi-Yadkori, Hossein Shahbazi, and Hong Zhang · 2011
Cited alongside, same era.
Searching in one billion vectors: re-rank with source coding
Hervé Jégou, Romain Tavenard, Matthijs Douze, and Laurent Amsaleg · 2011
Cited alongside, same era.
Complementary hashing for approximate nearest neighbor search
Hao Xu, Jingdong Wang, Zhu Li, Gang Zeng, Shipeng Li, and Nenghai Yu · 2011
Cited alongside, same era.
Scalable k-nn graph construction for visual descriptors
Jing Wang, Jingdong Wang, Gang Zeng, Zhuowen Tu, Rui Gan, and Shipeng Li · 2012
Cited alongside, same era.
Query-driven iterated neighborhood graph search for large scale indexing
Jingdong Wang and Shipeng Li · 2012
Cited alongside, same era.
The inverted multi-index
Artem Babenko and Victor Lempitsky · 2014
Cited alongside, same era.
Revisiting the inverted indices for billion-scale approximate nearest neighbors
Dmitry Baranchuk, Artem Babenko, and Yury Malkov · 2018
Later among the works it cites.
SPTAG: A library for fast approximate nearest neighbor search
Qi Chen, Haidong Wang, Mingqin Li, Gang Ren, Scarlett Li, Jeffery Zhu, Jason Li, Chuanjie Liu, Lintao Zhang, and Jingdong Wang · 2018
Later among the works it cites.
Masajiro Iwasaki and Daisuke Miyazaki · 2018
Later among the works it cites.
Fast clustering with flexible balance constraints
Hongfu Liu, Ziming Huang, Qi Chen, Mingqin Li, Yun Fu, and Lintao Zhang · 2018
Later among the works it cites.
Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs
Yu A Malkov and Dmitry A Yashunin · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Optimal analysis of best fit bin packing
György Dósa and Jiří Sgall · 2014
Cited alongside, same era.
Locally optimized product quantization for approximate nearest neighbor search
Yannis Kalantidis and Yannis Avrithis · 2014
Cited alongside, same era.
Scalable Nearest Neighbour Algorithms for High Dimensional Data
Marius Muja and David G. Lowe · 2014
Cited alongside, same era.
Asymmetric lsh (alsh) for sublinear time maximum inner product search (mips)
Anshumali Shrivastava and Ping Li · 2014
Cited alongside, same era.
Trinary-projection trees for approximate nearest neighbor search
Jingdong Wang, Naiyan Wang, You Jia, Jian Li, Gang Zeng, Hongbin Zha, and Xian Sheng Hua · 2014
Cited alongside, same era.
Composite quantization for approximate nearest neighbor search
Ting Zhang, Chao Du, and Jingdong Wang · 2014
Cited alongside, same era.
A survey on learning to hash
Jingdong Wang, Ting Zhang, Jingkuan Song, Nicu Sebe, and Heng Tao Shen · 2018
Later among the works it cites.
Pyramid: A general framework for distributed similarity search on large-scale datasets
Shiyuan Deng, Xiao Yan, KW Ng Kelvin, Chenyu Jiang, and James Cheng · 2019
Later among the works it cites.
Fast approximate nearest neighbor search with the navigating spreading-out graphs
Cong Fu, Chao Xiang, Changxu Wang, and Deng Cai · 2019
Later among the works it cites.
Billion-scale similarity search with gpus
Jeff Johnson, Matthijs Douze, and Hervé Jégou · 2019
Later among the works it cites.
Diskann: Fast accurate billion-point nearest neighbor search on a single node
Suhas Jayaram Subramanya, Rohan Kadekodi, Ravishankar Krishaswamy, and Harsha Vardhan Simhadri · 2019
Later among the works it cites.
Composite quantization
Jingdong Wang and Ting Zhang · 2019
Later among the works it cites.
Grip: Multi-store capacity-optimized high-performance nearest neighbor search for vector search engine
Minjia Zhang and Yuxiong He · 2019
Later among the works it cites.
Accelerating large-scale inference with anisotropic vector quantization
Ruiqi Guo, Philip Sun, Erik Lindgren, Quan Geng, David Simcha, Felix Chern, and Sanjiv Kumar · 2020
Later among the works it cites.
Graph-based nearest neighbor search: From practice to theory
Liudmila Prokhorenkova and Aleksandr Shekhovtsov · 2020
Later among the works it cites.
Hm-ann: Efficient billion-point nearest neighbor search on heterogeneous memory
Jie Ren, Minjia Zhang, and Dong Li · 2020
Later among the works it cites.