{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T16:54:06Z","timestamp":1732035246511},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,13]],"date-time":"2014-09-13T00:00:00Z","timestamp":1410566400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Braz Comput Soc"],"published-print":{"date-parts":[[2014,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:sec>\n            <jats:title>Background<\/jats:title>\n            <jats:p>There are several application scenarios that can take advantage from the efficient processing of similarity operations in complex data types, such as multimedia data. Among them, it is possible to mention the execution of more complex query types (e.g., similarity queries) and several well-known data mining algorithms (e.g., data clustering) that are directly based on similarity computations. In order to speed up the similarity-based comparisons performed by these approaches, it is possible to store the dataset in specialized data structures known as metric access methods (MAM).<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Methods<\/jats:title>\n            <jats:p>In this article we present four node split policies that can be employed in the construction of M-tree, the pioneer dynamic MAM, and of Slim-tree, the M-tree successor.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Results<\/jats:title>\n            <jats:p>These policies allow faster tree construction, as they result in better distribution of elements on the tree nodes and require less distance calculations when compared with the previously proposed ones. Furthermore, trees built with these policies have shown to be more efficient for techniques that require similarity computations, such as nearest neighbors queries and data clustering algorithms.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Conclusion<\/jats:title>\n            <jats:p>The experimental results show that trees built with the proposed policies outperform those built with the original ones with regard to the number of disk accesses, the amount of distance calculations, and the time required to run the queries.<\/jats:p>\n          <\/jats:sec>","DOI":"10.1186\/s13173-014-0017-5","type":"journal-article","created":{"date-parts":[[2014,9,12]],"date-time":"2014-09-12T14:04:50Z","timestamp":1410530690000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimizing metric access methods for querying and mining complex data types"],"prefix":"10.1186","volume":"20","author":[{"given":"Jessica Andressa","family":"de Souza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Humberto Luiz","family":"Razente","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Camila","family":"N Barioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,13]]},"reference":[{"key":"17_CR1","volume-title":"Data mining and analysis - fundamental concepts and algorithms","author":"MJ Zaki","year":"2014","unstructured":"Zaki MJ, Meira W Jr: Data mining and analysis - fundamental concepts and algorithms. Cambridge University Press, New York; 2014."},{"key":"17_CR2","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2011","unstructured":"Han J, Kamber M, Pei J: Data mining: concepts and techniques. Morgan Kaufmann, San Diego; 2011."},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00778-012-0296-4","volume":"22","author":"YN Silva","year":"2013","unstructured":"Silva YN, Aref WG, Larson P-\u00c5, Pearson S, Ali MH: Similarity queries: their conceptual evaluation, transformations, and processing. VLDB J 2013, 22(3):395\u2013420. doi:10.1007\/s00778\u2013012\u20130296\u20134","journal-title":"VLDB J"},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/1862413.1862423","volume":"2","author":"H-P Kriegel","year":"2010","unstructured":"Kriegel H-P, Kr\u00f6ger P, Renz M, Schubert M: Metric spaces in data mining: applications to clustering. SIGSPATIAL Special 2010, 2(2):36\u201339. doi:10.1145\/1862413.1862423","journal-title":"SIGSPATIAL Special"},{"key":"17_CR5","first-page":"323","volume-title":"Advanced database query systems: techniques, applications and technologies","author":"MCN Barioni","year":"2010","unstructured":"Barioni MCN, Kaster DS, Razente HL, Traina AJM, Traina C Jr: Querying multimedia data by similarity in relational DBMS. In Advanced database query systems: techniques, applications and technologies. Edited by: Yan L, Ma Z. IGI Global, Hershey; 2010:323\u2013359. doi:10.4018\/978\u20131-60960\u2013475\u20132.ch014"},{"key":"17_CR6","volume-title":"Nearest neighbor search: a database perspective. Series in computer science","author":"AN Papadopoulos","year":"2005","unstructured":"Papadopoulos AN, Manolopoulos Y: Nearest neighbor search: a database perspective. Series in computer science. Springer, Heidelberg; 2005."},{"key":"17_CR7","first-page":"892","volume-title":"International conference on data engineering (ICDE)","author":"YN Silva","year":"2010","unstructured":"Silva YN, Aref WG, Ali MH: The similarity join database operator. In International conference on data engineering (ICDE). IEEE, Long Beach; 2010:892\u2013903. doi:10.1109\/ICDE.2010.5447873"},{"key":"17_CR8","first-page":"1163","volume-title":"International conference on data engineering (ICDE)","author":"MR Vieira","year":"2011","unstructured":"Vieira MR, Razente HL, Barioni MCN, Hadjieleftheriou M, Srivastava D, Traina C, Tsotras VJ: On query result diversification. In International conference on data engineering (ICDE). IEEE, Hanover; 2011:1163\u20131174. doi:10.1109\/ICDE.2011.5767846"},{"key":"17_CR9","volume-title":"Foundations of multidimensional and metric data structures","author":"H Samet","year":"2006","unstructured":"Samet H: Foundations of multidimensional and metric data structures. Morgan Kaufmann, San Francisco; 2006."},{"key":"17_CR10","first-page":"426","volume-title":"International conference on very large data bases (VLDB)","author":"P Ciaccia","year":"1997","unstructured":"Ciaccia P, Patella M, Zezula P: M-tree: an efficient access method for similarity search in metric spaces. In International conference on very large data bases (VLDB). Morgan Kaufmann, Athens; 1997:426\u2013435."},{"key":"17_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity search: the metric space approach. Advances in database systems, vol. 32","author":"P Zezula","year":"2006","unstructured":"Zezula P, Amato G, Dohnal V, Batko M: Similarity search: the metric space approach. Advances in database systems, vol. 32. Springer, Heidelberg; 2006."},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/69.991715","volume":"14","author":"C Traina Jr","year":"2002","unstructured":"Traina C Jr, Traina AJM, Faloutsos C, Seeger B: Fast indexing and visualization of metric datasets using Slim-trees. IEEE Trans Knowl Data Eng 2002, 14(2):244\u2013260. doi:10.1109\/69.991715","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"17_CR13","first-page":"8","volume-title":"Symposium on applied computing (SAC)","author":"JA de Souza","year":"2013","unstructured":"de Souza JA, Razente HL, Barioni MCN: Faster construction of ball-partitioning-based metric access methods. In Symposium on applied computing (SAC). ACM, Coimbra; 2013:8\u201312. doi:10.1145\/2480362.2480365"},{"key":"17_CR14","first-page":"15","volume-title":"International conference on data engineering workshops (ICDEW)","author":"S-H Lim","year":"2006","unstructured":"Lim S-H, Ku K-I, Kim K, Kim Y-S: A node split algorithm reducing overlapped index spaces in m-tree index. In International conference on data engineering workshops (ICDEW). IEEE, Atlanta; 2006:15\u201323. doi:10.1109\/ICDEW.2006.14"},{"issue":"3","key":"17_CR15","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 2007, 63(3):919\u2013946. doi:10.1016\/j.datak.2007.06.001","journal-title":"Data Knowl Eng"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jda.2008.09.013","volume":"7","author":"T Skopal","year":"2009","unstructured":"Skopal T, Lokoc J: New dynamic construction techniques for M-tree. J Discrete Algorithm 2009, 7(1):62\u201377. doi:10.1016\/j.jda.2008.09.013","journal-title":"J Discrete Algorithm"},{"issue":"5","key":"17_CR17","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.is.2009.07.002","volume":"35","author":"TG Vespa","year":"2010","unstructured":"Vespa TG, Traina C Jr, Traina AJ: Efficient bulk-loading on dynamic metric access methods. Inf Syst 2010, 35(5):557\u2013569. doi:10.1016\/j.is.2009.07.002","journal-title":"Inf Syst"},{"issue":"4","key":"17_CR18","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, Uribe-Paredes R: Fully dynamic metric access methods based on hyperplane partitioning. Information Systems 2011, 36(4):734\u2013747. doi:10.1016\/j.is.2011.01.002","journal-title":"Information Systems"},{"key":"17_CR19","first-page":"144","volume-title":"20th International conference on very large data bases (VLDB)","author":"RT Ng","year":"1994","unstructured":"Ng RT, Han J: Efficient and effective clustering methods for spatial data mining. In 20th International conference on very large data bases (VLDB). Morgan Kaufmann, Santiago; 1994:144\u2013155."},{"key":"17_CR20","first-page":"67","volume-title":"International symposium on advances in spatial databases. Lecture notes in computer science, vol. 951","author":"M Ester","year":"1995","unstructured":"Ester M, Kriegel H-P, Xu X: Knowledge discovery in large spatial databases: focusing techniques for efficient class identification. In International symposium on advances in spatial databases. Lecture notes in computer science, vol. 951. Springer, Portland; 1995:67\u201382. doi:10.1007\/3\u2013540\u201360159\u20137_5"},{"issue":"3","key":"17_CR21","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.jss.2007.06.019","volume":"81","author":"MCN Barioni","year":"2008","unstructured":"Barioni MCN, Razente H, Traina AJM, Traina C Jr: Accelerating k-medoid-based algorithms through metric access methods. J Syst Software 2008, 81(3):343\u2013355. doi:10.1016\/j.jss.2007.06.019","journal-title":"J Syst Software"},{"key":"17_CR22","first-page":"322","volume-title":"ACM SIGMOD international conference on management of data","author":"N Beckmann","year":"1990","unstructured":"Beckmann N, Kriegel H-P, Schneider R, Seeger B: The r*-tree: an efficient and robust access method for points and rectangles. In ACM SIGMOD international conference on management of data. ACM, Atlantic City; 1990:322\u2013331. doi:10.1145\/93597.98741"},{"key":"17_CR23","first-page":"163","volume-title":"ACM international conference on management of data (SIGMOD)","author":"C Faloutsos","year":"1995","unstructured":"Faloutsos C, Lin K-I: Fastmap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In ACM international conference on management of data (SIGMOD). ACM, San Jose; 1995:163\u2013174. doi:10.1145\/568271.223812"},{"key":"17_CR24","unstructured":"GBDI-ICMC-USP (2014) GBDI arboretum library. Available on. Accessed 01 September 2014., [http:\/\/www.gbdi.icmc.usp.br\/downloads\/arboretum\/]"},{"key":"17_CR25","volume-title":"CoPhIR: a test collection for content-based image retrieval","author":"P Bolettieri","year":"2009","unstructured":"Bolettieri P, Esuli A, Falchi F, Lucchese C, Perego R, Piccioli T, Rabitti F (2009) CoPhIR: a test collection for content-based image retrieval. CoRR. abs\/0905.4627v2."},{"key":"17_CR26","first-page":"71","volume-title":"ACM SIGMOD international conference on management of data","author":"N Roussopoulos","year":"1995","unstructured":"Roussopoulos N, Kelley S, Vincent F: Nearest neighbor queries. In ACM SIGMOD international conference on management of data. ACM, San Jose; 1995:71\u201379. doi:10.1145\/223784.223794"}],"container-title":["Journal of the Brazilian Computer Society"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-014-0017-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13173-014-0017-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-014-0017-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13173-014-0017-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T10:45:50Z","timestamp":1723545950000},"score":1,"resource":{"primary":{"URL":"https:\/\/journal-bcs.springeropen.com\/articles\/10.1186\/s13173-014-0017-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,13]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["17"],"URL":"https:\/\/doi.org\/10.1186\/s13173-014-0017-5","relation":{},"ISSN":["0104-6500","1678-4804"],"issn-type":[{"type":"print","value":"0104-6500"},{"type":"electronic","value":"1678-4804"}],"subject":[],"published":{"date-parts":[[2014,9,13]]},"assertion":[{"value":"27 January 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2014","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"17"}}