{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:49:32Z","timestamp":1759682972339},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642039720"},{"type":"electronic","value":"9783642039737"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03973-7_18","type":"book-chapter","created":{"date-parts":[[2009,8,21]],"date-time":"2009-08-21T11:25:19Z","timestamp":1250853919000},"page":"235-252","source":"Crossref","is-referenced-by-count":3,"title":["The Onion-Tree: Quick Indexing of Complex Data in the Main Memory"],"prefix":"10.1007","author":[{"given":"Caio C\u00e9sar Mori","family":"Car\u00e9lo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ives Ren\u00ea Venturini","family":"Pola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo Rodrigues","family":"Ciferri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agma Juci Machado","family":"Traina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caetano","family":"Traina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristina Dutra","family":"de Aguiar Ciferri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"G.R. Hjaltason","year":"2003","unstructured":"Hjaltason, G.R., Samet, H.: Index-driven similarity search in metric spaces. ACM Trans. Database Syst.\u00a028(4), 517\u2013580 (2003)","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"18_CR2","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.A., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Comput. Surv.\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.346","volume":"6","author":"D.R. Wilson","year":"1997","unstructured":"Wilson, D.R., Martinez, T.R.: Improved heterogeneous distance functions. J. of Artificial Intelligence Research\u00a06, 1\u201334 (1997)","journal-title":"J. of Artificial Intelligence Research"},{"key":"18_CR4","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":"2","key":"18_CR5","first-page":"244","volume":"14","author":"C. Traina Jr.","year":"2002","unstructured":"Traina Jr., C., Traina, A.J.M., Faloutsos, C., Seeger, B.: Fast indexing and visualization of metric data sets using slim-trees. IEEE TKDE\u00a014(2), 244\u2013260 (2002)","journal-title":"IEEE TKDE"},{"key":"18_CR6","unstructured":"Vieira, M.R., Traina Jr., C., Chino, F.J.T., Traina, A.J.M.: DBM-tree: A dynamic metric access method sensitive to local density data. In: SBBD, pp. 163\u2013177 (2004)"},{"key":"18_CR7","unstructured":"Skopal, T., Pokorn\u00fd, J., Sn\u00e1sel, V.: PM-tree: Pivoting metric tree for similarity search in multimedia databases. In: ADBIS (Local Proceedings) (2004)"},{"issue":"4","key":"18_CR8","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00778-005-0178-0","volume":"16","author":"C. Traina Jr.","year":"2007","unstructured":"Traina Jr., C., Santos Filho, R.F., Traina, A.J.M., Vieira, M.R., Faloutsos, C.: The omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient. VLDB J.\u00a016(4), 483\u2013505 (2007)","journal-title":"VLDB J."},{"issue":"4","key":"18_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Inf. Process. Lett.\u00a040(4), 175\u2013179 (1991)","journal-title":"Inf. Process. Lett."},{"key":"18_CR10","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: VLDB, pp. 574\u2013584 (1995)"},{"key":"18_CR11","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: SODA, pp. 311\u2013321 (1993)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-75185-4_13","volume-title":"Advances in Databases and Information Systems","author":"I.R.V. Pola","year":"2007","unstructured":"Pola, I.R.V., Traina Jr., C., Traina, A.J.M.: The MM-tree: A memory-based metric tree without overlap between nodes. In: Ioannidis, Y., Novikov, B., Rachev, B. (eds.) ADBIS 2007. LNCS, vol.\u00a04690, pp. 157\u2013171. Springer, Heidelberg (2007)"},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/362003.362025","volume":"16","author":"W.A. Burkhard","year":"1973","unstructured":"Burkhard, W.A., Keller, R.M.: Some approaches to best-match file searching. Communications of the ACM\u00a016(4), 230\u2013236 (1973)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03973-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T12:04:47Z","timestamp":1685102687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03973-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642039720","9783642039737"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03973-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}