{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T22:08:12Z","timestamp":1761170892493,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030022235"},{"type":"electronic","value":"9783030022242"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02224-2_2","type":"book-chapter","created":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T06:34:07Z","timestamp":1538548447000},"page":"18-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Performance Analysis of Graph-Based Methods for Exact and Approximate Similarity Search in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Larissa Capobianco","family":"Shimomura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcos R.","family":"Vieira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel S.","family":"Kaster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,4]]},"reference":[{"key":"2_CR1","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-01206-8_16","volume-title":"Complex Networks","author":"K Aoyama","year":"2009","unstructured":"Aoyama, K., Saito, K., Yamada, T., Ueda, N.: Fast similarity search in small-world networks. In: Fortunato, S., Mangioni, G., Menezes, R., Nicosia, V. (eds.) Complex Networks. Studies in Computational Intelligence, vol. 207, pp. 185\u2013196. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-642-01206-8_16"},{"key":"2_CR2","unstructured":"Arya, S., Mount, D.M.: Approximate nearest neighbor queries in fixed dimensions. In: SODA, pp. 271\u2013280 (1993)"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Comput. Surv. 23(3), 345\u2013405 (1991)","journal-title":"ACM Comput. Surv."},{"key":"2_CR4","volume-title":"Advanced Database Query Systems","author":"MCN Barioni","year":"2011","unstructured":"Barioni, M.C.N., dos Santos Kaster, D., Razente, H.L., Traina, A.J., J\u00fanior, C.T.: Advanced Database Query Systems. IGI Global, Hershey (2011)"},{"key":"2_CR5","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). https:\/\/doi.org\/10.1007\/978-3-642-41062-8_28"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-642-15992-3_29","volume-title":"Advances in Pattern Recognition","author":"E Ch\u00e1vez","year":"2010","unstructured":"Ch\u00e1vez, E., Sadit Tellez, E.: Navigating k-nearest neighbor graphs to solve nearest neighbor searches. In: Mart\u00ednez-Trinidad, J.F., Carrasco-Ochoa, J.A., Kittler, J. (eds.) MCPR 2010. LNCS, vol. 6256, pp. 270\u2013280. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15992-3_29"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., Li, K.: Efficient K-nearest neighbor graph construction for generic similarity measures. In: Proceedings of WWW, pp. 577\u2013586 (2011)","DOI":"10.1145\/1963405.1963487"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Florez, O.U., Qi, X., Ocsa, A.: MOBHRG: fast k-nearest-neighbor search by overlap reduction of hyperspherical regions. In: ICASSP, pp. 1133\u20131136 (2009)","DOI":"10.1109\/ICASSP.2009.4959788"},{"key":"2_CR10","unstructured":"Hajebi, K., Abbasi-Yadkori, Y., Shahbazi, H., Zhang, H.: Fast approximate nearest-neighbor search with k-nearest neighbor graph. In: IJCAI, pp. 1312\u20131317 (2011)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Harwood, B., Drummond, T.: FANNG: fast approximate nearest neighbour graphs. In: CVPR, pp. 5713\u20135722 (2016)","DOI":"10.1109\/CVPR.2016.616"},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"GR Hjaltason","year":"2003","unstructured":"Hjaltason, G.R., Samet, H.: Index-driven similarity search in metric spaces. ACM Trans. Database Syst. 28(4), 517\u2013580 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-46759-7_2","volume-title":"Similarity Search and Applications","author":"M Iwasaki","year":"2016","unstructured":"Iwasaki, M.: Pruned bi-directed k-nearest neighbor graph for proximity search. In: Amsaleg, L., Houle, M.E., Schubert, E. (eds.) SISAP 2016. LNCS, vol. 9939, pp. 20\u201333. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46759-7_2"},{"issue":"9","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"JW Jaromczyk","year":"1992","unstructured":"Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proc. IEEE 80(9), 1502\u20131517 (1992)","journal-title":"Proc. IEEE"},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2011","unstructured":"Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. PAMI 33(1), 117\u2013128 (2011)","journal-title":"PAMI"},{"issue":"11","key":"2_CR16","doi-asserted-by":"publisher","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":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-32153-5_10","volume-title":"Similarity Search and Applications","author":"Y Malkov","year":"2012","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Scalable distributed algorithm for approximate nearest neighbor search problem in high dimensional general metric spaces. In: Navarro, G., Pestov, V. (eds.) SISAP 2012. LNCS, vol. 7404, pp. 132\u2013147. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32153-5_10"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","volume":"45","author":"Y Malkov","year":"2014","unstructured":"Malkov, Y., et al.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inf. Syst. 45, 61\u201368 (2014)","journal-title":"Inf. Syst."},{"issue":"12","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1618","DOI":"10.14778\/2824032.2824059","volume":"8","author":"B Naidan","year":"2015","unstructured":"Naidan, B., Boytsov, L., Nyberg, E.: Permutation search methods are efficient, yet faster search is possible. Proc. VLDB Endow. 8(12), 1618\u20131629 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G Navarro","year":"2002","unstructured":"Navarro, G.: Searching in metric spaces by spatial approximation. VLDB J. 11(1), 28\u201346 (2002)","journal-title":"VLDB J."},{"key":"2_CR21","unstructured":"Ocsa, A., Bedregal, C., Cuadros-Vargas, E.: A new approach for similarity queries using neighborhood graphs. In: Brazilian Symposium on Databases, pp. 131\u2013142 (2007)"},{"issue":"6","key":"2_CR22","first-page":"905","volume":"10","author":"M Ortega","year":"1998","unstructured":"Ortega, M., Rui, Y., Chakrabarti, K., Porkaew, K., Mehrotra, S., Huang, T.S.: Supporting ranked Boolean similarity queries in MARS. TKDE 10(6), 905\u2013925 (1998)","journal-title":"TKDE"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11575832_14","volume-title":"String Processing and Information Retrieval","author":"R Paredes","year":"2005","unstructured":"Paredes, R., Ch\u00e1vez, E.: Using the k-nearest neighbor graph for proximity searching in metric spaces. In: Consens, M., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 127\u2013138. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11575832_14"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/11764298_8","volume-title":"Experimental Algorithms","author":"R Paredes","year":"2006","unstructured":"Paredes, R., Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Practical construction of k-nearest neighbor graphs in metric spaces. In: \u00c0lvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 85\u201397. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11764298_8"},{"issue":"4","key":"2_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1978802.1978813","volume":"43","author":"T Skopal","year":"2011","unstructured":"Skopal, T., Bustos, B.: On nonmetric similarity search problems in complex domains. ACM Comput. Surv. 43(4), 1\u201350 (2011)","journal-title":"ACM Comput. Surv."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, S.: Query-driven iterated neighborhood graph search for large scale indexing. In: ACM MM, pp. 179\u2013188 (2012)","DOI":"10.1145\/2393347.2393378"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Wang, J., Wang, J., Zeng, G., Tu, Z., Gan, R., Li, S.: Scalable k-NN graph construction for visual descriptors. In: CVPR, pp. 1106\u20131113 (2012)","DOI":"10.1109\/CVPR.2012.6247790"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02224-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T03:25:02Z","timestamp":1761103502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-02224-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030022235","9783030022242"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02224-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"4 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}