Fetching the paper…
Reading the bibliography…
Approximate nearest neighbor search (ANNS) is a key retrieval technique for vector database and many data center applications, such as person re-identification and recommendation systems.
T. Cover and P. Hart, “Nearest neighbor pattern classification,” IEEE transactions on information theory , vol. 13, no. 1, pp. 21–27, 1967
1967
Earlier work this paper cites.
K. Fukunaga and P. M. Narendra, “A branch and bound algorithm for computing k-nearest neighbors,” IEEE transactions on computers , vol. 100, no. 7, pp. 750–753, 1975
1975
Earlier work this paper cites.
H. R. Lewis, “Michael r. π \pi garey and david s. johnson. computers and intractability. a guide to the theory of np-completeness. wh freeman and company, san francisco1979, x+ 338 pp.” The Journal of Symbolic Logic , vol. 48, no. 2, pp. 498–500, 1983
1983
Earlier work this paper cites.
A. George, M. T. Heath, J. Liu, and E. Ng, “Solution of sparse positive definite systems on a shared-memory multiprocessor,” International journal of parallel programming , vol. 15, no. 4, pp. 309–325, 1986
1986
Earlier work this paper cites.
R. P. Stanley, “Enumerative combinatorics, volume 1. wadsworth,” Inc. California , 1986
1986
Earlier work this paper cites.
S. Cost and S. Salzberg, “A weighted nearest neighbor algorithm for learning with symbolic features,” Machine learning , vol. 10, pp. 57–78, 1993
1993
Earlier work this paper cites.
M. Flickner, H. Sawhney, W. Niblack, J. Ashley, Q. Huang, B. Dom, M. Gorkani, J. Hafner, D. Lee, D. Petkovic et al. , “Query by image and video content: The qbic system,” computer , vol. 28, no. 9, pp. 23–32, 1995
1995
Earlier work this paper cites.
S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu, “An optimal algorithm for approximate nearest neighbor searching fixed dimensions,” Journal of the ACM (JACM) , vol. 45, no. 6, pp. 891–923, 1998
1998
Earlier work this paper cites.
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, “Item-based collaborative filtering recommendation algorithms,” in Proceedings of the 10th international conference on World Wide Web , 2001, pp. 285–295
2001
Earlier work this paper cites.
R. Koetter and A. Vardy, “Algebraic soft-decision decoding of reed-solomon codes,” IEEE Transactions on Information Theory , vol. 49, no. 11, pp. 2809–2825, 2003
2003
Earlier work this paper cites.
T. Liu, A. Moore, K. Yang, and A. Gray, “An investigation of practical approximate nearest neighbor algorithms,” Advances in neural information processing systems , vol. 17, 2004
2004
Earlier work this paper cites.
T. Tian, C. R. Jones, J. D. Villasenor, and R. D. Wesel, “Selective avoidance of cycles in irregular ldpc code construction,” IEEE Transactions on Communications , vol. 52, no. 8, pp. 1242–1247, 2004
2004
Earlier work this paper cites.
A. Caprara and J.-J. Salazar-González, “Laying out sparse graphs with provably minimum bandwidth,” INFORMS Journal on Computing , vol. 17, no. 3, pp. 356–373, 2005
2005
Earlier work this paper cites.
A. Andoni and P. Indyk, “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, 2006, pp. 459–468
2006
Earlier work this paper cites.
H. Semiconductor et al. , “Open nand flash interface specification,” Technical Report ONFI , 2006
2006
Earlier work this paper cites.
N. Agrawal, V. Prabhakaran, T. Wobber, J. D. Davis, M. Manasse, and R. Panigrahy, “Design tradeoffs for ssd performance,” in USENIX 2008 Annual Technical Conference , ser. ATC’08. USA: USENIX Association, 2008, p. 57–70
2008
Earlier work this paper cites.
T.-S. Chung, D.-J. Park, S. Park, D.-H. Lee, S.-W. Lee, and H.-J. Song, “A survey of flash translation layer,” Journal of Systems Architecture , vol. 55, no. 5-6, pp. 332–343, 2009
2009
Earlier work this paper cites.
K. Eshghi and R. Micheloni, “Ssd architecture and pci express interface,” in Inside solid state drives (SSDs) . Springer, 2013, pp. 19–45
2013
Earlier work this paper cites.
J. Wang, N. Wang, Y. Jia, J. Li, G. Zeng, H. Zha, and X.-S. Hua, “Trinary-projection trees for approximate nearest neighbor search,” IEEE transactions on pattern analysis and machine intelligence , vol. 36, no. 2, pp. 388–403, 2013
2013
Earlier work this paper cites.
K. Zhao, W. Zhao, H. Sun, X. Zhang, N. Zheng, and T. Zhang, “LDPC-in-SSD: Making advanced error correction codes work effectively in solid state drives,” in 11th USENIX Conference on File and Storage Technologies (FAST 13) , 2013, pp. 243–256
2013
Earlier work this paper cites.
J. Pennington, R. Socher, and C. D. Manning, “Glove: Global vectors for word representation,” in Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP) , 2014, pp. 1532–1543
2014
Earlier work this paper cites.
L. Auroux, M. Burelle, and R. Erra, “Reordering very large graphs for fun & profit,” in International Symposium on Web AlGorithms , 2015
2015
Earlier work this paper cites.
R. Chen, S. Siriyal, and V. Prasanna, “Energy and memory efficient mapping of bitonic sorting on fpga,” in Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays , 2015, pp. 240–249
2015
Earlier work this paper cites.
R. Jose and A. Pe, “Analysis of hard decision and soft decision decoding algorithms of ldpc codes in awgn,” in 2015 IEEE International Advance Computing Conference (IACC) . IEEE, 2015, pp. 430–435
2015
Cited alongside, same era.
N. Sundaram, N. Satish, M. M. A. Patwary, S. R. Dulloor, M. J. Anderson, S. G. Vadlamudi, D. Das, and P. Dubey, “Graphmat: high performance graph analytics made productive,” Proceedings of the VLDB Endowment , vol. 8, no. 11, pp. 1214–1225, 2015
2015
Cited alongside, same era.
M. Iwasaki, “Pruned bi-directed k-nearest neighbor graph for proximity search,” in Similarity Search and Applications: 9th International Conference, SISAP 2016, Tokyo, Japan, October 24-26, 2016, Proceedings 9 . Springer, 2016, pp. 20–33
2016
Cited alongside, same era.
H. Zhu, M. Long, J. Wang, and Y. Cao, “Deep hashing network for efficient similarity retrieval,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 30, no. 1, 2016
2016
Cited alongside, same era.
C. J. Zhu, T. Zhu, H. Li, J. Bi, and M. Song, “Accelerating large-scale molecular similarity search through exploiting high performance computing,” in 2019 IEEE International Conference on Bioinformatics and Biomedicine (BIBM) . IEEE, 2019, pp. 330–333
2019
Later among the works it cites.
J. H. Lee, H. Zhang, V. Lagrange, P. Krishnamoorthy, X. Zhao, and Y. S. Ki, “Smartssd: Fpga accelerated near-storage data analytics on ssd,” IEEE Computer architecture letters , vol. 19, no. 2, pp. 110–113, 2020
2020
Later among the works it cites.
J. Ma, Z. Zhao, X. Yi, J. Yang, M. Chen, J. Tang, L. Hong, and E. H. Chi, “Off-policy learning in two-stage recommender systems,” in Proceedings of The Web Conference 2020 , 2020, pp. 463–473
2020
Later among the works it cites.
Y. Matsui, T. Yamaguchi, and Z. Wang, “Cvpr2020 tutorial on image retrieval in the wild,” https://matsui528.github.io/cvpr2020_tutorial_retrieval/ , 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Faiss,” https://engineering.fb.com/2017/03/29/data-infrastructure/faiss-a-library-for-efficient-similarity-search/
2017
Cited alongside, same era.
Y. Cao, H. Qi, W. Zhou, J. Kato, K. Li, X. Liu, and J. Gui, “Binary hashing for approximate nearest neighbor search on big data: A survey,” IEEE Access , vol. 6, pp. 2039–2054, 2017
2017
Cited alongside, same era.
Q. Huang, J. Feng, Q. Fang, W. Ng, and W. Wang, “Query-aware locality-sensitive hashing scheme for lp norm,” The VLDB Journal , vol. 26, no. 5, pp. 683–708, 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
F. Chen, L. Song, and Y. Chen, “Regan: A pipelined reram-based accelerator for generative adversarial networks,” in 2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC) . IEEE, 2018, pp. 178–183
2018
Cited alongside, same era.
S.-W. Jun, A. Wright, S. Zhang, S. Xu, and Arvind, “Grafboost: Using accelerated flash storage for external graph analytics,” in Proceedings of the 45th Annual International Symposium on Computer Architecture , ser. ISCA ’18. IEEE Press, 2018, p. 411–424. [Online]. Available: https://doi.org/10.1109/ISCA.2018.00042
2018
Cited alongside, same era.
Y. A. Malkov and D. A. Yashunin, “Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs,” IEEE transactions on pattern analysis and machine intelligence , vol. 42, no. 4, pp. 824–836, 2018
2018
Cited alongside, same era.
S. An, Z. Huang, S. Bai, G. Che, X. Ma, J. Luo, and Y. Chen, “Quarter-point product quantization for approximate nearest neighbor search,” Pattern Recognition Letters , vol. 125, pp. 187–194, 2019
2019
Cited alongside, same era.
Y. Meng, X. Dai, X. Yan, J. Cheng, W. Liu, J. Guo, B. Liao, and G. Chen, “Pmd: An optimal transportation-based user distance for recommender systems,” in Advances in Information Retrieval: 42nd European Conference on IR Research, ECIR 2020, Lisbon, Portugal, April 14–17, 2020, Proceedings, Part II 42 . Springer, 2020, pp. 272–280
2020
Later among the works it cites.
Y. Wang, F. Chen, L. Song, C.-J. R. Shi, H. H. Li, and Y. Chen, “Reboc: Accelerating block-circulant neural networks in reram,” in 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE) . IEEE, 2020, pp. 1472–1477
2020
Later among the works it cites.
2021
Later among the works it cites.
B. Fang, D. Wang, S. Jin, Q. Koziol, Z. Zhang, Q. Guan, S. Byna, S. Krishnamoorthy, and D. Tao, “Characterizing impacts of storage faults on hpc applications: A methodology and insights,” in 2021 IEEE International Conference on Cluster Computing (CLUSTER) . IEEE, 2021, pp. 409–420
2021
Later among the works it cites.
C. Gao, X. Xin, Y. Lu, Y. Zhang, J. Yang, and J. Shu, “Parabit: Processing parallel bitwise operations in nand flash memory based ssds,” in MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture , 2021, pp. 59–70
2021
Later among the works it cites.
C. Li, Y. Wang, C. Liu, S. Liang, H. Li, and X. Li, “GLIST: Towards In-Storage graph learning,” in 2021 USENIX Annual Technical Conference (USENIX ATC 21) . USENIX Association, Jul. 2021, pp. 225–238. [Online]. Available: https://www.usenix.org/conference/atc21/presentation/li-cangyuan
2021
Later among the works it cites.
S. Salamat, A. Haj Aboutalebi, B. Khaleghi, J. H. Lee, Y. S. Ki, and T. Rosing, “Nascent: Near-storage acceleration of database sort on smartssd,” in The 2021 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays , 2021, pp. 262–272
2021
Later among the works it cites.
2021
Later among the works it cites.
Y. Wang, Z. Zhu, F. Chen, M. Ma, G. Dai, Y. Wang, H. Li, and Y. Chen, “Rerec: In-reram acceleration with access-aware mapping for personalized recommendation,” in 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD) . IEEE, 2021, pp. 1–9
2021
Later among the works it cites.
M. Wilkening, U. Gupta, S. Hsia, C. Trippel, C.-J. Wu, D. Brooks, and G.-Y. Wei, “Recssd: near data processing for solid state drive based recommendation inference,” in Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems , 2021, pp. 717–729
2021
Later among the works it cites.
X. Xu, M. Wang, Y. Wang, and D. Ma, “Two-stage routing with optimized guided search and greedy algorithm on proximity graph,” Knowledge-Based Systems , vol. 229, p. 107305, 2021
2021
Later among the works it cites.
H.-W. Hu, W.-C. Wang, Y.-H. Chang, Y.-C. Lee, B.-R. Lin, H.-M. Wang, Y.-P. Lin, Y.-M. Huang, C.-Y. Lee, T.-H. Su, C.-C. Hsieh, C.-M. Hu, Y.-T. Lai, C.-K. Chen, H.-S. Chen, H.-P. Li, T.-W. Kuo, M.-F. Chang, K.-C. Wang, C.-H. Hung, and C.-Y. Lu, “Ice: An intelligent cognition engine with 3d nand-based in-memory computing for vector similarity search acceleration,” in 2022 55th IEEE/ACM International Symposium on Microarchitecture (MICRO) , 2022, pp. 763–783
2022
Later among the works it cites.
J.-H. Kim, Y.-R. Park, J. Do, S.-Y. Ji, and J.-Y. Kim, “Accelerating large-scale graph-based nearest neighbor search on a computational storage platform,” IEEE Transactions on Computers , pp. 1–1, 2022
2022
Later among the works it cites.
J. Lin, L. Liang, Z. Qu, I. Ahmad, L. Liu, F. Tu, T. Gupta, Y. Ding, and Y. Xie, “Inspire: In-storage private information retrieval via protocol and architecture co-design,” in Proceedings of the 49th Annual International Symposium on Computer Architecture , ser. ISCA ’22. New York, NY, USA: Association for Computing Machinery, 2022, p. 102–115. [Online]. Available: https://doi.org/10.1145/3470496.3527433
2022
Later among the works it cites.
W. Niu, J. Guan, X. Shen, Y. Wang, G. Agrawal, and B. Ren, “Gcd2: A globally optimizing compiler for mapping dnns to mobile dsps,” in 2022 55th IEEE/ACM International Symposium on Microarchitecture (MICRO) , 2022, pp. 512–529
2022
Later among the works it cites.
E. Kasneci, K. Seßler, S. Küchemann, M. Bannert, D. Dementieva, F. Fischer, U. Gasser, G. Groh, S. Günnemann, E. Hüllermeier et al. , “Chatgpt for good? on opportunities and challenges of large language models for education,” Learning and individual differences , vol. 103, p. 102274, 2023
2023
Closest in time.
Y. Wang, S. Li, Q. Zheng, A. Chang, H. Li, and Y. Chen, “Ems-i: An efficient memory system design with specialized caching mechanism for recommendation inference,” ACM Transactions on Embedded Computing Systems , vol. 22, no. 5s, pp. 1–22, 2023
2023
Closest in time.
S. Li, Y. Wang, E. Hanson, A. Chang, Y. S. Ki, H. H. Li, and Y. Chen, “Ndrec: A near-data processing system for training large-scale recommendation models,” IEEE Transactions on Computers , no. 01, pp. 1–14, 2024
2024
Closest in time.
A. Babenko and V. Lempitsky, “Efficient indexing of billion-scale datasets of deep descriptors,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , 2016, pp. 2055–2063
2063
Closest in time.