The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Advances in Neural Information Processing Systems 18
Murray, I., Mackay, D., Zoubin Ghahramani, A., & Skilling, J. (2006) · Cited by 1,927
Approximate nearest neighbor algorithm based on navigable small world graphs
Malkov, Y., Ponomarenko, A., Logvinov, A., & Krylov, V. (2014) · Information Systems · doi:10.1016/j.is.2013.10.006 · Cited by 419
A new algorithm for optimal 2-constraint satisfaction and its implications
Williams, R. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.09.023 · Cited by 386
The (black) art of runtime evaluation: Are we comparing algorithms or implementations?
Kriegel, H.-P., Schubert, E., & Zimek, A. (2017) · Knowledge and Information Systems · doi:10.1007/s10115-016-1004-2 · Cited by 229
Nearest Neighbors in High-Dimensional Spaces
Indyk, P. (2004) · Discrete Mathematics and Its Applications · doi:10.1201/9781420035315.ch39 · Cited by 207
Handbook of Discrete and Computational Geometry, Third Edition
Rousseeuw, P. J., & Struyf, A. (2017) · Chapman & Hall/CRC eBooks · doi:10.1201/9781315119601 · Cited by 162
Big Data (Big Data), 2014 IEEE International Conference on
Lansdall-Welfare, T., Sudhahar, S., Veltri, G., & Cristianini, N. (2014) · Cited by 123
Engineering Efficient and Effective Non-metric Space Library
Boytsov, L., & Naidan, B. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-41062-8_28 · Cited by 111
Spherical Hashing: Binary Code Embedding with Hyperspheres
Heo, J., Lee, Y., He, J., Chang, S., & Yoon, S. (2015) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2015.2408363 · Cited by 111
37th International Symposium on Computational Geometry (SoCG 2021)
Buchin, K., & de Verdière, É. C. (2021) · HAL · Cited by 87
OpenML: A Collaborative Science Platform
van Rijn, J. N., Bischl, B., Torgo, L., Gao, B., Umaashankar, V., Fischer, S., Winter, P., Wiswedel, B., Berthold, M. R., & Vanschoren, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40994-3_46 · Cited by 77
Fast nearest neighbor search through sparse random projections and voting
Hyvönen, V., Pitkanen, T., Tasoulis, S. K., Jääsaari, E., Tuomainen, R. O. O., Wang, L., Corander, J., & Roos, T. (2016) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2016.7840682 · Cited by 54
Cited by
Douze, M., Guzhva, A., Deng, C., Johnson, J., Szilvasy, G., Mazaré, P.-E., Lomeli, M., Hosseini, L., & Jégou, H. (2026) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2025.3618474 · Cited by 478
Survey of Vector Database Management Systems
Pan, J. J., Wang, J., & Li, G. (2023) · arXiv · doi:10.48550/arxiv.2310.14021 · Cited by 184
cellHarmony: cell-level matching and holistic comparison of single-cell transcriptomes
DePasquale, E. A. K., Schnell, D., Dexheimer, P., Ferchen, K., Hay, S., Chetal, K., Valiente-Alandí, Í., Blaxall, B. C., Grimes, H. L., & Salomonis, N. (2019) · Nucleic Acids Research · doi:10.1093/nar/gkz789 · Cited by 67
Semantic-Enhanced Differentiable Search Index Inspired by Learning Strategies
Tang, Y., Zhang, R., Guo, J., Chen, J., Zhu, Z., Wang, S., Yin, D., & Cheng, X. (2023) · Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining · doi:10.1145/3580305.3599903 · Cited by 29
Kang, G., Ge, Z., Hu, J., Zhang, X., Wang, L., & Zhan, J. (2025) · Proceedings of the VLDB Endowment · doi:10.14778/3718057.3718078 · Cited by 1
Metadata
- Authors
- Aumüller, M., Bernhardsson, E., & Faithfull, A.
- Venue
- Information Systems
- Publisher
- Elsevier BV
- Published
- 2020-01
- Volume
- 87
- Pages
- 101374
- ISSN
- 0306-4379 (ISSN-L)
- OpenAlex
- W2949985202
- Cited by
- 300
- References
- 16
- FWCI
- 9.05
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.