{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:06:29Z","timestamp":1743030389911,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030609351"},{"type":"electronic","value":"9783030609368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60936-8_10","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T10:05:52Z","timestamp":1602669952000},"page":"126-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Metrics and Ambits and Sprawls, Oh My"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4204-2017","authenticated-orcid":false,"given":"Magnus Lie","family":"Hetland","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58094-8_18","volume-title":"Combinatorial Pattern Matching","author":"R Baeza-Yates","year":"1994","unstructured":"Baeza-Yates, R., Cunto, W., Manber, U., Wu, S.: Proximity matching using fixed-queries trees. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol. 807. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58094-8_18"},{"key":"10_CR2","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of the 21th International Conference on Very Large Data Bases, pp. 574\u2013584 (1995)"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/362003.362025","volume":"16","author":"WA Burkhard","year":"1973","unstructured":"Burkhard, W.A., Keller, R.M.: Some approaches to best-match file searching. Commun. ACM 16(4), 230\u2013236 (1973). https:\/\/doi.org\/10.1145\/362003.362025","journal-title":"Commun. ACM"},{"key":"10_CR4","unstructured":"Carlsen, S.M.\u00d8., Moe, H.H.: Similarity Search in Metric Spaces with Weighted Multi-focal Regions: Using the Ambit Region Type to Improve the Performance of the SSS-Tree. Master\u2019s thesis, Norwegian University of Science and Technology (2020)"},{"issue":"9","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1016\/j.patrec.2004.11.014","volume":"26","author":"E Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recogn. Lett. 26(9), 1363\u20131376 (2005). https:\/\/doi.org\/10.1016\/j.patrec.2004.11.014","journal-title":"Pattern Recogn. Lett."},{"key":"10_CR6","unstructured":"Chen, L., Gao, Y., Song, X., Li, Z., Miao, X., Jensen, C.S.: Indexing metric spaces for exact similarity search. arXiv preprint arXiv:2005.03468 (2020)"},{"key":"10_CR7","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: an effcient access method for similarity search in metric spaces. In: Proceedings of the 23rd VLDB Conference, Athens, Greece, pp. 426\u2013435 (1997)"},{"key":"10_CR8","unstructured":"Dohnal, V., Gennaro, C., Savino, P., Zezula, P.: Separable splits of metric data sets. In: Proceedings of the Nono Convegno Nazionale Sistemi Evoluti per Basi di Dati (2001)"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1025026030880","volume":"21","author":"V Dohnal","year":"2003","unstructured":"Dohnal, V., Gennaro, C., Savino, P., Zezula, P.: D-index: distance searching index for metric data sets. Multimed. Tools Appl. 21(1), 9\u201333 (2003). https:\/\/doi.org\/10.1023\/A:1025026030880","journal-title":"Multimed. Tools Appl."},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Edsberg, O., Hetland, M.L.: Indexing inexact proximity search with distance regression in pivot space. In: Proceedings of the 3rd International Conference on SImilarity Search and APplications, pp. 51\u201358 (2010). https:\/\/doi.org\/10.1145\/1862344.1862353","DOI":"10.1145\/1862344.1862353"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1498698.1564506","volume":"14","author":"K Figueroa","year":"2010","unstructured":"Figueroa, K., Ch\u00e1vez, E., Navarro, G., Paredes, R.: Speeding up spatial approximation search in metric spaces. J. Exp. Algorithmics (JEA) 14, 3\u20136 (2010). https:\/\/doi.org\/10.1145\/1498698.1564506","journal-title":"J. Exp. Algorithmics (JEA)"},{"key":"10_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03625-5_9","volume-title":"The basic principles of metric indexing","author":"ML Hetland","year":"2009","unstructured":"Hetland, M.L.: Swarm Intelligence for Multi-objective Problems in Data Mining. In: Coello, C.A.C., Dehuri, S., Ghosh, S. (eds.) The basic principles of metric indexing, vol. 242. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03625-5_9"},{"key":"10_CR13","unstructured":"Hetland, M.L.: Comparison-based indexing from first principles. arXiv preprint arXiv:1908.06318 (2019)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/TSE.1983.235263","volume":"5","author":"I Kalantari","year":"1983","unstructured":"Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Trans. Softw. Eng. 5, 631\u2013634 (1983). https:\/\/doi.org\/10.1109\/TSE.1983.235263","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.is.2014.01.007","volume":"43","author":"J Loko\u010d","year":"2014","unstructured":"Loko\u010d, J., Mo\u0161ko, J., \u010cech, P., Skopal, T.: On indexing metric spaces using cut-regions. Inf. Syst. 43, 1\u201319 (2014). https:\/\/doi.org\/10.1016\/j.is.2014.01.007","journal-title":"Inf. Syst."},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Loko\u010d, J., Skopal, T.: On applications of parameterized hyperplane partitioning. In: Proceedings of the 3rd International Conference on Similarity Search and Applications, pp. 131\u2013132. ACM (2010). https:\/\/doi.org\/10.1145\/1862344.1862370","DOI":"10.1145\/1862344.1862370"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"ML Mic\u00f3","year":"1994","unstructured":"Mic\u00f3, M.L., Oncina, J.: A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. Pattern Recogn. Lett. 15(1), 9\u201317 (1994). https:\/\/doi.org\/10.1016\/0167-8655(94)90095-7","journal-title":"Pattern Recogn. Lett."},{"issue":"7","key":"10_CR18","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.is.2012.05.012","volume":"38","author":"T Murakami","year":"2013","unstructured":"Murakami, T., Takahashi, K., Serita, S., Fujii, Y.: Probabilistic enhancement of approximate indexing in metric spaces. Inf. Syst. 38(7), 1007\u20131018 (2013). https:\/\/doi.org\/10.1016\/j.is.2012.05.012","journal-title":"Inf. Syst."},{"issue":"1","key":"10_CR19","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). https:\/\/doi.org\/10.1007\/s007780200060","journal-title":"VLDB J."},{"key":"10_CR20","unstructured":"Skopal, T., Pokorn\u1ef3, J., Snasel, V.: PM-tree: pivoting metric tree for similarity search in multimedia databases. In: ADBIS (Local Proceedings) (2004)"},{"issue":"11","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1016\/j.patrec.2011.04.016","volume":"32","author":"R Socorro","year":"2011","unstructured":"Socorro, R., Mic\u00f3, L., Oncina, J.: A fast pivot-based indexing algorithm for metric spaces. Pattern Recogn. Lett. 32(11), 1511\u20131516 (2011). https:\/\/doi.org\/10.1016\/j.patrec.2011.04.016","journal-title":"Pattern Recogn. Lett."},{"issue":"5","key":"10_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0893-9659(91)90146-M","volume":"4","author":"JK Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Metric trees. Appl. Math. Lett. 4(5), 61\u201362 (1991). https:\/\/doi.org\/10.1016\/0893-9659(91)90146-M","journal-title":"Appl. Math. Lett."},{"issue":"3","key":"10_CR23","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E Vidal Ruiz","year":"1986","unstructured":"Vidal Ruiz, E.: An algorithm for finding nearest neighbours in (approximately) constant average time. Pattern Recogn. Lett. 4(3), 145\u2013157 (1986). https:\/\/doi.org\/10.1016\/0167-8655(86)90013-9","journal-title":"Pattern Recogn. Lett."},{"key":"10_CR24","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete algorithms, pp. 311\u2013321. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1993)"},{"key":"10_CR25","unstructured":"Yianilos, P.N.: Excluded middle vantage point forests for nearest neighbor search. In: In DIMACS Implementation Challenge, ALENEX\u201999 (1999)"}],"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-60936-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:42:35Z","timestamp":1710250955000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60936-8_10"}},"subtitle":["Another Tutorial on Metric Indexing"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030609351","9783030609368"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60936-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 October 2020","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":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 short papers accepted for the SISAP 2020 Doctoral Symposium are also included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}