{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:02:17Z","timestamp":1742922137277,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030483241"},{"type":"electronic","value":"9783030483258"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-48325-8_17","type":"book-chapter","created":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T08:02:45Z","timestamp":1589356965000},"page":"250-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MeTree: A Metric Spatial Index"],"prefix":"10.1007","author":[{"given":"Adri\u00e1n","family":"Planas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3765-1590","authenticated-orcid":false,"given":"Andr\u00e9s","family":"Pascal","sequence":"additional","affiliation":[]},{"given":"Norma","family":"Herrera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,14]]},"reference":[{"issue":"3","key":"17_CR1","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":"17_CR2","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TKDE.2010.149","volume":"23","author":"Z Li","year":"2011","unstructured":"Li, Z., Lee, K.C.K., Zheng, B., Lee, W.-C., Lee, D.L., Wang, X.: IR-tree: an efficient index for geographic document search. IEEE Trans. Knowl. Data Eng. 23, 585\u2013599 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR3","unstructured":"Planas, A., Pascal, A., Herrera, N.: Consultas M\u00e9trico Espaciales. XXV Congreso Argentino de Ciencias de la Computaci\u00f3n. Universidad Nacional de R\u00edo Cuarto (2019)"},{"issue":"9","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1016\/j.patrec.2004.11.014","volume":"26","author":"E Chavez","year":"2005","unstructured":"Chavez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recogn. Lett. 26(9), 1363\u20131376 (2005)","journal-title":"Pattern Recogn. Lett."},{"key":"17_CR5","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, pp. 426\u2013435 (1997)","DOI":"10.1145\/275487.275495"},{"issue":"1","key":"17_CR6","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. Multimedia Tools Appl. 21(1), 9\u201333 (2003). https:\/\/doi.org\/10.1023\/A:1025026030880","journal-title":"Multimedia Tools Appl."},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-46439-5_4","volume-title":"Advances in Database Technology \u2014 EDBT 2000","author":"C Traina","year":"2000","unstructured":"Traina, C., Traina, A., Seeger, B., Faloutsos, C.: Slim-trees: high performance metric trees minimizing overlap between nodes. In: Zaniolo, C., Lockemann, P.C., Scholl, M.H., Grust, T. (eds.) EDBT 2000. LNCS, vol. 1777, pp. 51\u201365. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46439-5_4"},{"issue":"4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/362003.362025","volume":"16","author":"W Burkhard","year":"1973","unstructured":"Burkhard, W., Keller, R.: Some approaches to best-match file searching. Commun. ACM 16(4), 230\u2013236 (1973)","journal-title":"Commun. ACM"},{"issue":"4","key":"17_CR9","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00778-005-0178-0","volume":"16","author":"C Traina","year":"2007","unstructured":"Traina, C., Filho, R.F.S., Traina, A.J.M., et al.: The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient. VLDB J. 16(4), 483\u2013505 (2007). https:\/\/doi.org\/10.1007\/s00778-005-0178-0","journal-title":"VLDB J."},{"issue":"7","key":"17_CR10","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/0167-8655(96)00032-3","volume":"17","author":"L Mico","year":"1996","unstructured":"Mico, L., Oncina, J., Carrasco, R.C.: A fast branch & bound nearest neighbour classifier in metric spaces. Pattern Recogn. Lett. 17(7), 731\u2013739 (1996)","journal-title":"Pattern Recogn. Lett."},{"key":"17_CR11","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA, pp. 311\u2013321 (1993)"},{"issue":"5","key":"17_CR12","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/TSE.1983.235263","volume":"9","author":"I Kalantari","year":"1983","unstructured":"Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Trans. Software Eng. 9(5), 631\u2013634 (1983)","journal-title":"IEEE Trans. Software Eng."},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-55488-2_27","volume-title":"Data structures and efficient algorithms","author":"H Noltemeier","year":"1992","unstructured":"Noltemeier, H., Verbarg, K., Zirkelbach, C.: Monotonous Bisector* Trees\u2014a tool for efficient partitioning of complex scenes of geometric objects. In: Monien, B., Ottmann, T. (eds.) Data structures and efficient algorithms. LNCS, vol. 594, pp. 186\u2013203. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55488-2_27"},{"issue":"4","key":"17_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"JK Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Inf. Process. Lett. 40(4), 175\u2013179 (1991)","journal-title":"Inf. Process. Lett."},{"key":"17_CR15","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: VLDB, pp. 574\u2013584 (1995)"},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1016\/j.is.2011.01.002","volume":"36","author":"G Navarro","year":"2011","unstructured":"Navarro, G., Paredes, R.U.: Fully dynamic metric access methods based on hyperplane partitioning. Inf. Syst. 36(4), 734\u2013747 (2011)","journal-title":"Inf. Syst."},{"issue":"1","key":"17_CR17","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":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-32153-5_9","volume-title":"Similarity Search and Applications","author":"L Britos","year":"2012","unstructured":"Britos, L., Printista, A.M., Reyes, N.: DSACL+-tree: a dynamic data structure for similarity search in secondary memory. In: Navarro, G., Pestov, V. (eds.) SISAP 2012. LNCS, vol. 7404, pp. 116\u2013131. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32153-5_9"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Navarro, G., Reyes, N.: Dynamic spatial approximation trees for massive data. In: SISAP, pp. 81\u201388 (2009)","DOI":"10.1109\/SISAP.2009.28"},{"key":"17_CR20","unstructured":"Vieira, M.R., Traina, C., Jr., Chino, F.J.T., Traina, A.J.M.: DBM-tree: a dynamic metric access method sensitive to local density data. J. Inf. Data Manage. 1(1), 111\u2013128 (2010)"},{"issue":"3","key":"17_CR21","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1016\/j.datak.2007.06.001","volume":"63","author":"L Aronovich","year":"2007","unstructured":"Aronovich, L., Spiegler, I.: CM-tree: a dynamic clustered index for similarity search in metric databases. Data Knowl. Eng. 63(3), 919\u2013946 (2007)","journal-title":"Data Knowl. Eng."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Almeida, J., Torres, R.D.S., Leite, N.J.: BP-tree: an efficient index for similarity search in high-dimensional metric spaces. In: CIKM, pp. 1365\u20131368 (2010)","DOI":"10.1145\/1871437.1871622"},{"issue":"3","key":"17_CR23","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E Vidal","year":"1986","unstructured":"Vidal, E.: An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recogn. Lett. 4(3), 145\u2013157 (1986)","journal-title":"Pattern Recogn. Lett."},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-41062-8_12","volume-title":"Similarity Search and Applications","author":"G Ruiz","year":"2013","unstructured":"Ruiz, G., Santoyo, F., Ch\u00e1vez, E., Figueroa, K., Tellez, E.S.: Extreme pivots for faster metric indexes. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) SISAP 2013. LNCS, vol. 8199, pp. 115\u2013126. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41062-8_12"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Mosko, J., Lokoc, J., Skopal, T.: Clustered pivot tables for I\/O optimized similarity search. In: SISAP, pp. 17\u201324 (2011)","DOI":"10.1145\/1995412.1995418"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","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, pp. 198\u2013212. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58094-8_18"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Distance-based indexing for high dimensional metric spaces. In: SIGMOD, pp. 357\u2013368 (1997)","DOI":"10.1145\/253262.253345"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Skopal, T., Pokorny, J., Snasel, V.: PM-tree: pivoting metric tree for similarity search in multimedia databases. In: ADBIS, pp. 803\u2013815 (2004)","DOI":"10.1007\/11408079_73"},{"issue":"4","key":"17_CR29","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.is.2010.10.002","volume":"36","author":"D Novak","year":"2011","unstructured":"Novak, D., Batko, M., Zezula, P.: Metric Index: an efficient and scalable solution for precise and approximate similarity search. Inf. Syst. 36(4), 721\u2013733 (2011)","journal-title":"Inf. Syst."},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Rigaux, P., Scholl, M., Voisard, A.: 6 - Spatial Access Methods. In: Spatial Databases, pp 201\u2013266. Morgan Kaufmann, San Francisco (2002)","DOI":"10.1016\/B978-155860588-6\/50008-7"},{"issue":"1","key":"17_CR31","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: an adaptable, symmetric multikey file structure. ACM Trans. Database Syst. 9(1), 38\u201371 (1984)","journal-title":"ACM Trans. Database Syst."},{"key":"17_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees a data structure for retrieval on composite keys. Acta Informatica 4, 1\u20139 (1974). https:\/\/doi.org\/10.1007\/BF00288933","journal-title":"Acta Informatica"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, J., You, S., Gruenwald, L.: Parallel quadtree coding of large-scale raster geospatial data on GPGPUs. In: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 457\u2013460. ACM, New York (2011)","DOI":"10.1145\/2093973.2094047"},{"issue":"9","key":"17_CR34","doi-asserted-by":"publisher","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":"17_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-71027-1_9","volume-title":"Pixelization Paradigm","author":"J Castro","year":"2007","unstructured":"Castro, J., Burns, S.: Online data visualization of multidimensional databases using the Hilbert space\u2013filling curve. In: L\u00e9vy, P.P., Le Grand, B., Poulet, F., Soto, M., Darago, L., Toubiana, L., Vibert, J.-F. (eds.) VIEW 2006. LNCS, vol. 4370, pp. 92\u2013109. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71027-1_9"},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. SIGMOD Rec. 14(2), 47\u201357 (1984)","DOI":"10.1145\/971697.602266"}],"container-title":["Communications in Computer and Information Science","Computer Science \u2013 CACIC 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48325-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T16:29:14Z","timestamp":1666542554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48325-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030483241","9783030483258"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48325-8_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CACIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentine Congress of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"R\u00edo Cuarto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cacic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cacic2019.exa.unrc.edu.ar\/","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":"RedUNCI","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","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":"27","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":"0","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":"15% - 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.1","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":"2.05","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)"}}]}}