Fetching the paper…
Reading the bibliography…
As high-dimensional vector data increasingly surpasses the processing capabilities of traditional database management systems, Vector Databases (VDBs) have emerged and become tightly integrated with large language models, being widely applied in modern artificial intelligence systems.
J. L. Bentley, “Multidimensional binary search trees used for associative searching,” Communications of the ACM
1975
Earlier work this paper cites.
A. Guttman, “R-trees: a dynamic index structure for spatial searching,” in Proceedings of the 1984 ACM SIGMOD international conference on Management of data
1984
Earlier work this paper cites.
Berkeley: International Computer Science Institute, 1989
S. M. Omohundro, Five balltree construction algorithms · 1989
Earlier work this paper cites.
P. Ciaccia, M. Patella, and P. Zezula, “M-tree: An efficient access method for similarity search in metric spaces,” in Vldb
1997
Earlier work this paper cites.
B. J. S and L. D. G., “Shape indexing using approximate nearest-neighbour search in high-dimensional spaces,” in Proceedings of IEEE computer society conference on computer vision and pattern recognition
1997
Earlier work this paper cites.
M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, “Locality-sensitive hashing scheme based on p-stable distributions,” in Proceedings of the twentieth annual symposium on Computational geometry
2004
Earlier work this paper cites.
T. Liu, A. W. Moore, A. Gray, and K. Yang, “New algorithms for efficient high-dimensional nonparametric classification,” Journal of machine learning research
2006
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.
Y. Weiss, A. Torralba, and R. Fergus, “Spectral hashing,” Advances in neural information processing systems
2008
Earlier work this paper cites.
H. Jegou, M. Douze, and C. Schmid, “Product quantization for nearest neighbor search,” IEEE transactions on pattern analysis and machine intelligence
2010
Earlier work this paper cites.
H. Liu, M. Deng, and C. Xiao, “An improved best bin first algorithm for fast image registration,‘’ in Proceedings of 2011 International Conference on Electronic & Mechanical Engineering and Information Technology , vol. 1, 2011, pp. 355–358
2011
Earlier work this paper cites.
P. A, M. Y, L. A, and K. A., “Approximate nearest neighbor search small world approach,” in International Conference on Information and Communication Technologies & Applications
2011
Earlier work this paper cites.
M. Y, P. A, L. A, and K. A., “Scalable distributed algorithm for approximate nearest neighbor search problem in high dimensional general metric spaces,” in Similarity Search and Applications: 5th International Conference, SISAP 2012, Toronto, ON, Canada, August 9-10, 2012. Proceedings 5
2012
Earlier work this paper cites.
2013
Earlier work this paper cites.
T. Ge, K. He, Q. Ke, and J. Sun, “Optimized product quantization,” IEEE transactions on pattern analysis and machine intelligence
2013
Earlier work this paper cites.
M. Y, P. A, L. A, and K. A., “Approximate nearest neighbor algorithm based on navigable small world graphs,” Information Systems
2014
Earlier work this paper cites.
2015
Cited alongside, same era.
2015
Cited alongside, same era.
B. E and S. AB., “Annoy (approximate nearest neighbors oh yeah).” [DB/OL]. (2015) [2023-10-17]. 3, 2015
2015
Cited alongside, same era.
H. Liu, R. Wang, S. Shan, and X. Chen, “Deep supervised hashing for fast image retrieval,” in Proceedings of the IEEE conference on computer vision and pattern recognition
2016
Cited alongside, same era.
B. Ghojogh, S. Sharifian, and H. Mohammadzade, “Tree-based optimization: A meta-algorithm for metaheuristic optimization,” 2018
2022
Later among the works it cites.
Accessed: 2023-10-18
A. Andoni, P. Indyk, et al · 2023
Closest in time.
W. X. Zhao et al. , “A survey of large language models,‘’ arXiv preprint arXiv:2303.18223 , 2023
2023
Closest in time.
M. Shanahan, “Talking about large language models,” 2023
2023
Closest in time.
OpenAI, “GPT-4 technical report,‘’ arXiv preprint arXiv:2303.08774 , 2023
2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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
2018
Cited alongside, same era.
D. Xu, I. W. Tsang, Y. Zhang, and J. Yang, “Online product quantization,” IEEE Transactions on Knowledge and Data Engineering
2018
Cited alongside, same era.
2019
Cited alongside, same era.
Y. Wang, Z. Pan, and R. Li, “A new cell-level search based non-exhaustive approximate nearest neighbor (ann) search algorithm in the framework of product quantization,” IEEE Access
2019
Cited alongside, same era.
L. Li and Q. Hu, “Optimized high order product quantization for approximate nearest neighbors search,” Frontiers of Computer Science
2020
Cited alongside, same era.
O. Jafari, P. Maurya, P. Nagarkar, K. M. Islam, and C. Crushev, “A survey on locality sensitive hashing algorithms and their applications,” 2021
2021
Cited alongside, same era.
J.-H. Lee and J.-H. Kim, “Deep hashing using proxy loss on remote sensing image retrieval,‘’ Remote Sensing , vol. 13, no. 15, p. 2924, Jul. 2021
2021
Cited alongside, same era.
X. Yang, “The collision of databases and big language models - recent reflections,‘’ China Computer Federation, Tech. Rep., Jul. 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
X. Nie et al. , “FlexMoE: Scaling large-scale sparse pre-trained model training via dynamic device placement,‘’ Proceedings of the ACM on Management of Data , vol. 1, no. 1, pp. 1–19, May 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
A. Asai, S. Min, Z. Zhong, and D. Chen, “ACL 2023 tutorial: Retrieval-based language models and applications,‘’ ACL 2023 , 2023
2023
Closest in time.