{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T07:33:02Z","timestamp":1778657582653,"version":"3.51.4"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319684734","type":"print"},{"value":"9783319684741","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68474-1_3","type":"book-chapter","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T15:15:48Z","timestamp":1506525348000},"page":"34-49","source":"Crossref","is-referenced-by-count":93,"title":["ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms"],"prefix":"10.1007","author":[{"given":"Martin","family":"Aum\u00fcller","sequence":"first","affiliation":[]},{"given":"Erik","family":"Bernhardsson","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Faithfull","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Ahle, T.D., Aum\u00fcller, M., Pagh, R.: Parameter-free locality sensitive hashing for spherical range reporting. In: SODA 2017, pp. 239\u2013256","DOI":"10.1137\/1.9781611974782.16"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Alman, J., Williams, R.: Probabilistic polynomials and hamming nearest neighbors. In: FOCS 2015, pp. 136\u2013150","DOI":"10.1109\/FOCS.2015.18"},{"key":"3_CR3","unstructured":"Andoni, A., Indyk, P., Laarhoven, T., Razenshteyn, I.P., Schmidt, L.: Practical and optimal LSH for angular distance. In: NIPS 2015, pp. 1225\u20131233. https:\/\/falconn-lib.org\/"},{"issue":"9","key":"3_CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"3_CR5","unstructured":"Bernhardsson, E.: Annoy. https:\/\/github.com\/spotify\/annoy"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-41062-8_28","volume-title":"Similarity Search and Applications","author":"L Boytsov","year":"2013","unstructured":"Boytsov, L., Naidan, B.: Engineering efficient and effective non-metric space library. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) SISAP 2013. LNCS, vol. 8199, pp. 280\u2013293. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-41062-8_28"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Boytsov, L., Novak, D., Malkov, Y., Nyberg, E.: Off the beaten path: let\u2019s replace term-based retrieval with k-NN search. In: CIKM 2016, pp. 1099\u20131108","DOI":"10.1145\/2983323.2983815"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an efficient access method for similarity search in metric spaces. In: VLDB 1997, pp. 426\u2013435 (1997)","DOI":"10.1145\/275487.275495"},{"key":"3_CR9","first-page":"801","volume":"14","author":"RR Curtin","year":"2013","unstructured":"Curtin, R.R., Cline, J.R., Slagle, N.P., March, W.B., Ram, P., Mehta, N.A., Gray, A.G.: MLPACK: a scalable C++ machine learning library. J. Mach. Learn. Res. 14, 801\u2013805 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"3_CR10","unstructured":"Dong, W.: KGraph. https:\/\/github.com\/aaalgo\/kgraph"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Dong, W., Wang, Z., Josephson, W., Charikar, M., Li, K.: Modeling LSH for performance tuning. In: CIKM 2008, pp. 669\u2013678. ACM. http:\/\/lshkit.sourceforge.net\/","DOI":"10.1145\/1458082.1458172"},{"key":"3_CR12","unstructured":"Edel, M., Soni, A., Curtin, R.R.: An automatic benchmarking system. In: NIPS 2014 Workshop on Software Engineering for Machine Learning (2014)"},{"issue":"11","key":"3_CR13","doi-asserted-by":"crossref","first-page":"2304","DOI":"10.1109\/TPAMI.2015.2408363","volume":"37","author":"JP Heo","year":"2015","unstructured":"Heo, J.P., Lee, Y., He, J., Chang, S.F., Yoon, S.E.: Spherical hashing: binary code embedding with hyperspheres. IEEE TPAMI 37(11), 2304\u20132316 (2015)","journal-title":"IEEE TPAMI"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC 1998, pp. 604\u2013613","DOI":"10.1145\/276698.276876"},{"issue":"2","key":"3_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02764938","volume":"54","author":"WB Johnson","year":"1986","unstructured":"Johnson, W.B., Lindenstrauss, J., Schechtman, G.: Extensions of Lipschitz maps into Banach spaces. Isr. J. Math. 54(2), 129\u2013138 (1986)","journal-title":"Isr. J. Math."},{"issue":"2","key":"3_CR16","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10115-016-1004-2","volume":"52","author":"H Kriegel","year":"2017","unstructured":"Kriegel, H., Schubert, E., Zimek, A.: The (black) art of runtime evaluation: are we comparing algorithms or implementations? Knowl. Inf. Syst. 52(2), 341\u2013378 (2017)","journal-title":"Knowl. Inf. Syst."},{"issue":"11","key":"3_CR17","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"3_CR18","unstructured":"Li, W., Zhang, Y., Sun, Y., Wang, W., Zhang, W., Lin, X.: Approximate nearest neighbor search on high dimensional data - experiments, analyses, and improvement (v1.0). CoRR abs\/1610.02455 (2016). http:\/\/arxiv.org\/abs\/1610.02455"},{"key":"3_CR19","unstructured":"Lyst Engineering: Rpforest. https:\/\/github.com\/lyst\/rpforest"},{"key":"3_CR20","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. ArXiv e-prints, March 2016"},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","volume":"45","author":"Y Malkov","year":"2014","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inf. Syst. 45, 61\u201368 (2014)","journal-title":"Inf. Syst."},{"key":"3_CR22","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: NIPS 2013, pp. 3111\u20133119"},{"key":"3_CR23","unstructured":"Muja, M., Lowe, D.G.: Fast approximate nearest neighbors with automatic algorithm configuration. In: VISSAPP 2009, pp. 331\u2013340. INSTICC Press"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Norouzi, M., Punjani, A., Fleet, D.J.: Fast search in hamming space with multi-index hashing. In: CVPR 2012, pp. 3108\u20133115. IEEE","DOI":"10.1109\/CVPR.2012.6248043"},{"key":"3_CR25","unstructured":"Pham, N.: Hybrid LSH: faster near neighbors reporting in high-dimensional space. In: EDBT 2017, pp. 454\u2013457"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/978-3-642-40994-3_46","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"JN Rijn van","year":"2013","unstructured":"van Rijn, J.N., Bischl, B., Torgo, L., Gao, B., Umaashankar, V., Fischer, S., Winter, P., Wiswedel, B., Berthold, M.R., Vanschoren, J.: OpenML: a collaborative science platform. In: Blockeel, H., Kersting, K., Nijssen, S., \u017delezn\u00fd, F. (eds.) ECML PKDD 2013. LNCS, vol. 8190, pp. 645\u2013649. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40994-3_46"},{"key":"3_CR27","unstructured":"Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: a survey. CoRR abs\/1408.2927 (2014). http:\/\/arxiv.org\/abs\/1408.2927"},{"issue":"2\u20133","key":"3_CR28","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.tcs.2005.09.023","volume":"348","author":"R Williams","year":"2005","unstructured":"Williams, R.: A new algorithm for optimal 2-constraint satisfaction and its implications. Theor. Comput. Sci. 348(2\u20133), 357\u2013365 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"3_CR29","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s007780050069","volume":"7","author":"P Zezula","year":"1998","unstructured":"Zezula, P., Savino, P., Amato, G., Rabitti, F.: Approximate similarity retrieval with M-Trees. VLDB J. 7(4), 275\u2013293 (1998)","journal-title":"VLDB J."}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68474-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T09:14:46Z","timestamp":1719479686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68474-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319684734","9783319684741"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68474-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}