Fetching the paper…
Reading the bibliography…
Nearest Neighbor Search (NNS) has recently drawn a rapid increase of interest due to its core role in managing high-dimensional vector data in data science and AI applications.
Monotonic Search Networks for Computer Vision Databases. In Twenty-Second Asilomar Conference on Signals, Systems and Computers , Vol. 2. IEEE, 548–553
DW Dearholt, N Gonzales, and G Kurup. 1988 · 1988
Earlier work this paper cites.
The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In Proceedings of the 1990 ACM SIGMOD international conference on Management of data . 322–331
Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger. 1990 · 1990
Earlier work this paper cites.
A Bridging Model for Parallel Computation
Leslie G. Valiant. 1990 · 1990
Earlier work this paper cites.
Approximate Nearest Neighbor Queries in Fixed Dimensions.. In SODA , Vol. 93. 271–280
Sunil Arya and David M Mount. 1993 · 1993
Earlier work this paper cites.
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing (Dallas, Texas, USA) (STOC ’98) . Association for Computing Machinery, New York, NY, USA, 604–613
Piotr Indyk and Rajeev Motwani. 1998 · 1998
Earlier work this paper cites.
Similarity Search in High Dimensions via Hashing
Aristides Gionis, Piotr Indyk, Rajeev Motwani, et al · 1999
Earlier work this paper cites.
Locality-Sensitive Hashing Scheme Based on p-Stable Distributions. In Proceedings of the Twentieth Annual Symposium on Computational Geometry (Brooklyn, New York, USA) (SCG ’04) . Association for Computing Machinery, New York, NY, USA, 253–262
Mayur Datar, Nicole Immorlica, Piotr Indyk, and Vahab S. Mirrokni. 2004 · 2004
Earlier work this paper cites.
Image Similarity Search With Compact Data Structures. In Proceedings of the Thirteenth ACM International Conference on Information and Knowledge Management (CIKM) . 208–217
Qin Lv, Moses Charikar, and Kai Li. 2004 · 2004
Earlier work this paper cites.
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. In 2006 47th annual IEEE symposium on foundations of computer science (FOCS’06) . IEEE, 459–468
Alexandr Andoni and Piotr Indyk. 2006 · 2006
Earlier work this paper cites.
Google News Personalization: Scalable Online Collaborative Filtering. In Proceedings of the 16th International Conference on World Wide Web (WWW) . 271–280
Abhinandan S Das, Mayur Datar, Ashutosh Garg, and Shyam Rajaram. 2007 · 2007
Earlier work this paper cites.
Object Retrieval With Large Vocabularies and Fast Spatial Matching. In 2007 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) . IEEE, 1–8
James Philbin, Ondrej Chum, Michael Isard, Josef Sivic, and Andrew Zisserman. 2007 · 2007
Earlier work this paper cites.
Hamming Embedding and Weak Geometric Consistency for Large Scale Image Search. In European conference on computer vision . Springer, 304–317
Hervé Jégou, Matthijs Douze, and Cordelia Schmid. 2008 · 2008
Earlier work this paper cites.
Optimised KD-Trees for Fast Image Descriptor Matching. In 2008 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) . IEEE, 1–8
Chanop Silpa-Anan and Richard Hartley. 2008 · 2008
Earlier work this paper cites.
Kernelized Locality-Sensitive Hashing for Scalable Image Search. In 2009 IEEE 12th International Conference on Computer Vision (ICCV) . IEEE, 2130–2137
Brian Kulis and Kristen Grauman. 2009 · 2009
Earlier work this paper cites.
Fast Approximate Nearest Neighbors With Automatic Algorithm Configuration
Marius Muja and David G Lowe. 2009 · 2009
Earlier work this paper cites.
Product Quantization for Nearest Neighbor Search
Hervé Jégou, Matthijs Douze, and Cordelia Schmid. 2011 · 2010
Earlier work this paper cites.
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers). In SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010 , Friedhelm Meyer auf der Heide and Cynthia A. Phillips (Eds.). ACM, 303–314
Charles E. Leiserson and Tao B. Schardl. 2010 · 2010
Earlier work this paper cites.
Pregel: A System for Large-Scale Graph Processing. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data (Indianapolis, Indiana, USA) (SIGMOD ’10) . Association for Computing Machinery, New York, NY, USA, 135–146
Grzegorz Malewicz, Matthew H. Austern, Aart J.C Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010 · 2010
Earlier work this paper cites.
Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence - Volume Volume Two (Barcelona, Catalonia, Spain) (IJCAI’11) . AAAI Press, 1312––1317
Kiana Hajebi, Yasin Abbasi-Yadkori, Hossein Shahbazi, and Hong Zhang. 2011 · 2011
Earlier work this paper cites.
Searching in One Billion Vectors: Re-Rank With Source Coding. In 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 861–864
Hervé Jégou, Romain Tavenard, Matthijs Douze, and Laurent Amsaleg. 2011 · 2011
Earlier work this paper cites.
PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12) . USENIX Association, Hollywood, CA, 17–30
Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012 · 2012
Earlier work this paper cites.
KORE: Keyphrase Overlap Relatedness for Entity Disambiguation. In Proceedings of the 21st ACM International Conference on Information and Knowledge Management (CIKM) . 545–554
Johannes Hoffart, Stephan Seufert, Dat Ba Nguyen, Martin Theobald, and Gerhard Weikum. 2012 · 2012
Earlier work this paper cites.
GraphChi: Large-Scale Graph Computation on Just a PC. In 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12) . USENIX Association, Hollywood, CA, 31–46
Aapo Kyrola, Guy Blelloch, and Carlos Guestrin. 2012 · 2012
Earlier work this paper cites.
Optimized Product Quantization for Approximate Nearest Neighbor Search. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR) . 2946–2953
Tiezheng Ge, Kaiming He, Qifa Ke, and Jian Sun. 2013 · 2013
Earlier work this paper cites.
More Effective Distributed Ml via a Stale Synchronous Parallel Parameter Server. In Advances in Neural Information Processing Systems (NIPS) . 1223–1231
Qirong Ho, James Cipar, Henggang Cui, Seunghak Lee, Jin Kyu Kim, Phillip B Gibbons, Garth A Gibson, Greg Ganger, and Eric P Xing. 2013 · 2013
Earlier work this paper cites.
Approximate Nearest Neighbor Algorithm Based on Navigable Small World Graphs
Yury Malkov, Alexander Ponomarenko, Andrey Logvinov, and Vladimir Krylov. 2014 · 2013
Earlier work this paper cites.
Efficient Estimation of Word Representations in Vector Space. In 1st International Conference on Learning Representations, ICLR 2013, Scottsdale, Arizona, USA, May 2-4, 2013, Workshop Track Proceedings , Yoshua Bengio and Yann LeCun (Eds.)
Tomás Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013 · 2013
Earlier work this paper cites.
A Lightweight Infrastructure for Graph Analytics. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (Farminton, Pennsylvania) (SOSP ’13) . Association for Computing Machinery, New York, NY, USA, 456–471
Donald Nguyen, Andrew Lenharth, and Keshav Pingali. 2013 · 2013
Cited alongside, same era.
X-Stream: Edge-Centric Graph Processing Using Streaming Partitions. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (Farminton, Pennsylvania) (SOSP ’13) . Association for Computing Machinery, New York, NY, USA, 472–488
Amitabha Roy, Ivo Mihailovic, and Willy Zwaenepoel. 2013 · 2013
Cited alongside, same era.
Ligra: A Lightweight Graph Processing Framework for Shared Memory. In Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (Shenzhen, China) (PPoPP ’13) . Association for Computing Machinery, New York, NY, USA, 135–146
Julian Shun and Guy E. Blelloch. 2013 · 2013
Cited alongside, same era.
The Inverted Multi-Index
Artem Babenko and Victor Lempitsky. 2014 · 2014
GraphGrind: Addressing Load Imbalance of Graph Partitioning. In Proceedings of the International Conference on Supercomputing (Chicago, Illinois) (ICS ’17) . Association for Computing Machinery, New York, NY, USA, Article 16, 10 pages
Jiawen Sun, Hans Vandierendonck, and Dimitrios S. Nikolopoulos. 2017 · 2017
Later among the works it cites.
Multiscale Quantization for Fast Similarity Search. In Advances in Neural Information Processing Systems (NIPS) . 5745–5755
Xiang Wu, Ruiqi Guo, Ananda Theertha Suresh, Sanjiv Kumar, Daniel N Holtmann-Rice, David Simcha, and Felix Yu. 2017 · 2017
Later among the works it cites.
HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces
Akhil Arora, Sakshi Sinha, Piyush Kumar, and Arnab Bhattacharya. 2018 · 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 · 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…
Cited alongside, same era.
Fast and Accurate Hashing Via Iterative Nearest Neighbors Expansion
Zhongming Jin, Debing Zhang, Yao Hu, Shiding Lin, Deng Cai, and Xiaofei He. 2014 · 2014
Cited alongside, same era.
CuSha: Vertex-Centric Graph Processing on GPUs. In Proceedings of the 23rd International Symposium on High-Performance Parallel and Distributed Computing (Vancouver, BC, Canada) (HPDC ’14) . Association for Computing Machinery, New York, NY, USA, 239–252
Farzad Khorasani, Keval Vora, Rajiv Gupta, and Laxmi N. Bhuyan. 2014 · 2014
Cited alongside, same era.
Distributed Representations of Sentences and Documents. In Proceedings of the 31th International Conference on Machine Learning, ICML 2014, Beijing, China, 21-26 June 2014 (JMLR Workshop and Conference Proceedings, Vol. 32) . JMLR.org, 1188–1196
Quoc V. Le and Tomás Mikolov. 2014 · 2014
Cited alongside, same era.
Graphlab: A new framework for parallel machine learning
Yucheng Low, Joseph E Gonzalez, Aapo Kyrola, Danny Bickson, Carlos E Guestrin, and Joseph Hellerstein. 2014 · 2014
Cited alongside, same era.
Very deep convolutional networks for large-scale image recognition
Karen Simonyan and Andrew Zisserman. 2014 · 2014
Cited alongside, same era.
Fast and Unified Local Search for Random Walk Based K-Nearest-Neighbor Query in Large Graphs. In Proceedings of the 2014 ACM SIGMOD international conference on Management of Data . ACM, 1139–1150
Yubao Wu, Ruoming Jin, and Xiang Zhang. 2014 · 2014
Cited alongside, same era.
Practical and Optimal LSH for Angular Distance. In Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1 (NIPS) (Montreal, Canada) (NIPS’15, Vol. 28) , C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett (Eds.). MIT Press, Cambridge, MA, USA, 1225–1233
Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya Razenshteyn, and Ludwig Schmidt. 2015 · 2015
Cited alongside, same era.
Cache Locality Is Not Enough: High-Performance Nearest Neighbor Search With Product Quantization Fast Scan
Fabien André, Anne-Marie Kermarrec, and Nicolas Le Scouarnec. 2015 · 2015
Cited alongside, same era.
Yury A Malkov and Dmitry A Yashunin. 2020 · 2018
Later among the works it cites.
FAQ: All about the Google RankBrain algorithm
Danny Sullivan. 2018 · 2018
Later among the works it cites.
Efficient Large-Scale Approximate Nearest Neighbor Search on OpenCL FPGA. In 2018 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2018, Salt Lake City, UT, USA, June 18-22, 2018 . IEEE Computer Society, 4924–4932
Jialiang Zhang, Soroosh Khoram, and Jing Li. 2018 · 2018
Later among the works it cites.
Learning to Route in Similarity Graphs. In Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 97) , Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.). PMLR, Long Beach, California, USA, 475–484
Dmitry Baranchuk, Dmitry Persiyanov, Anton Sinitsin, and Artem Babenko. 2019 · 2019
Later among the works it cites.
Pyramid: A General Framework for Distributed Similarity Search on Large-scale Datasets. In 2019 IEEE International Conference on Big Data (Big Data) . IEEE, 1066–1071
Shiyuan Deng, Xiao Yan, KW Ng Kelvin, Chenyu Jiang, and James Cheng. 2019 · 2019
Later among the works it cites.
Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search
Karima Echihabi, Kostas Zoumpatianos, Themis Palpanas, and Houda Benbrahim. 2019 · 2019
Later among the works it cites.
Fast Approximate Nearest Neighbor Search with the Navigating Spreading-out Graph
Cong Fu, Chao Xiang, Changxu Wang, and Deng Cai. 2019 · 2019
Later among the works it cites.
DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node. In Advances in Neural Information Processing Systems , H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox, and R. Garnett (Eds.), Vol. 32. Curran Associates, Inc., 13771–13781
Suhas Jayaram Subramanya, Fnu Devvrit, Harsha Vardhan Simhadri, Ravishankar Krishnawamy, and Rohan Kadekodi. 2019 · 2019
Later among the works it cites.
Approximate Nearest Neighbor Search on High Dimensional Data – Experiments, Analyses, and Improvement
Wen Li, Ying Zhang, Yifang Sun, Wei Wang, Mingjie Li, Wenjie Zhang, and Xuemin Lin. 2020b · 2019
Later among the works it cites.
Graph based Nearest Neighbor Search: Promises and Failures
Peng-Cheng Lin and Wan-Lei Zhao. 2019 · 2019
Later among the works it cites.
Semantic Product Search. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD 2019, Anchorage, AK, USA, August 4-8, 2019 , Ankur Teredesai, Vipin Kumar, Ying Li, Rómer Rosales, Evimaria Terzi, and George Karypis (Eds.). ACM, 2876–2885
Priyanka Nigam, Yiwei Song, Vijai Mohan, Vihan Lakshman, Weitian Allen Ding, Ankit Shingavi, Choon Hui Teo, Hao Gu, and Bing Yin. 2019 · 2019
Later among the works it cites.
GRIP: Multi-Store Capacity-Optimized High-Performance Nearest Neighbor Search for Vector Search Engine. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management (Beijing, China) (CIKM ’19) . Association for Computing Machinery, New York, NY, USA, 1673–1682
Minjia Zhang and Yuxiong He. 2019 · 2019
Later among the works it cites.
Fast Scalable Approximate Nearest Neighbor Search for High-dimensional Data. In 2020 IEEE International Conference on Cluster Computing (CLUSTER) . IEEE, 294–302
KG Renga Bashyam and Sathish Vadhiyar. 2020 · 2020
Later among the works it cites.
Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data (Portland, OR, USA) (SIGMOD ’20) . Association for Computing Machinery, New York, NY, USA, 2539–2554
Conglong Li, Minjia Zhang, David G. Andersen, and Yuxiong He. 2020a · 2020
Later among the works it cites.
Best-First Beam Search
Clara Meister, Tim Vieira, and Ryan Cotterell. 2020 · 2020
Later among the works it cites.
Graph-based Nearest Neighbor Search: From Practice to Theory. In Proceedings of the 37th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 119) , Hal Daumé III and Aarti Singh (Eds.). PMLR, Virtual, 7803–7813
Liudmila Prokhorenkova and Aleksandr Shekhovtsov. 2020 · 2020
Later among the works it cites.
Graptor: Efficient Pull and Push Style Vectorized Graph Processing. In Proceedings of the 34th ACM International Conference on Supercomputing (Barcelona, Spain) (ICS ’20) . Association for Computing Machinery, New York, NY, USA, Article 13, 13 pages
Hans Vandierendonck. 2020 · 2020
Later among the works it cites.
DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search
Runhui Wang and Dong Deng. 2020 · 2020
Later among the works it cites.
AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data
Chuangxian Wei, Bin Wu, Sheng Wang, Renjie Lou, Chaoqun Zhan, Feifei Li, and Yuanzhe Cai. 2020 · 2020
Later among the works it cites.
Optimizing Ordered Graph Algorithms with GraphIt. In Proceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization (San Diego, CA, USA) (CGO 2020) . Association for Computing Machinery, New York, NY, USA, 158–170
Yunming Zhang, Ajay Brahmakshatriya, Xinyi Chen, Laxman Dhulipala, Shoaib Kamil, Saman Amarasinghe, and Julian Shun. 2020 · 2020
Later among the works it cites.
Faiss Library
2021 · 2021
Later among the works it cites.
Yanhao Zhang, Pan Pan, Yun Zheng, Kang Zhao, Yingya Zhang, Xiaofeng Ren, and Rong Jin. 2021 · 2021
Later among the works it cites.