{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:00:38Z","timestamp":1759683638591,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751847"},{"type":"electronic","value":"9783540751854"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75185-4_13","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T15:47:58Z","timestamp":1189007278000},"page":"157-171","source":"Crossref","is-referenced-by-count":11,"title":["The MM-Tree: A Memory-Based Metric Tree Without Overlap Between Nodes"],"prefix":"10.1007","author":[{"given":"Ives Rene Venturini","family":"Pola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Caetano","family":"Traina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agma Juci Machado","family":"Traina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","first-page":"28","volume-title":"VLDB","author":"S. Berchtold","year":"1996","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.P.: The x-tree: An index structure for high-dimensional data. In: VLDB, Bombay, India, pp. 28\u201339. Morgan Kaufmann, San Francisco (1996)"},{"key":"13_CR2","first-page":"440","volume-title":"IEEE (ICDE)","author":"K. Chakrabarti","year":"1999","unstructured":"Chakrabarti, K., Mehrotra, S.: The hybrid tree: An index structure for high dimensional feature spaces. In: IEEE (ICDE), Sydney, Australia, pp. 440\u2013447. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1145\/253260.253347","volume-title":"ACM SIGMOD","author":"N. Katayama","year":"1997","unstructured":"Katayama, N., Satoh, S.: The sr-tree: An index structure for high-dimensional nearest neighbor queries. In: Peckham, J. (ed.) ACM SIGMOD, Tucson, Arizona, USA, pp. 369\u2013380. ACM Press, New York (1997)"},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K.I.D. Lin","year":"1994","unstructured":"Lin, K.I.D., Jagadish, H.V., Christos, F.: The tv-tree: An index structure for high-dimensional data. VLDB Journal\u00a03(4), 517\u2013542 (1994)","journal-title":"VLDB Journal"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., Gunther, O.: Multidimensional access methods. ACM Computing Surveys\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"13_CR6","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 (CACM)\u00a016(4), 230\u2013236 (1973)","journal-title":"Communications of the ACM (CACM)"},{"issue":"3","key":"13_CR7","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 Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"13_CR8","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. Information Processing Letters\u00a040(4), 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"13_CR9","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: ACM\/SIGACT-SIAM (SODA), Austin, TX, pp. 311\u2013321 (1993)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1145\/253260.253345","volume-title":"ACM SIGMOD","author":"T. Bozkaya","year":"1997","unstructured":"Bozkaya, T., \u00d6zsoyoglu, Z.M.: Distance-based indexing for high-dimensional metric spaces. In: ACM SIGMOD, Tucson, AZ, pp. 357\u2013368. ACM Press, New York (1997)"},{"key":"13_CR11","first-page":"574","volume-title":"VLDB","author":"S. Brin","year":"1995","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Dayal, U., Gray, P.M.D., Nishio, S. (eds.) VLDB, Zurich, Switzerland, pp. 574\u2013584. Morgan Kaufmann, San Francisco (1995)"},{"issue":"2","key":"13_CR12","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/69.991715","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 datasets using slim-trees. IEEE (TKDE)\u00a014(2), 244\u2013260 (2002)","journal-title":"IEEE (TKDE)"},{"key":"13_CR13","unstructured":"Ciaccia, P., Patella, M., Rabitti, F., Zezula, P.: Indexing metric spaces with m-tree. In: Atti del Quinto Convegno Nazionale SEBD, Verona, Italy, pp. 67\u201386 (1997)"},{"key":"13_CR14","first-page":"623","volume-title":"IEEE (ICDE)","author":"R.F. Santos Filho","year":"2001","unstructured":"Santos Filho, R.F., Traina, A.J.M., Traina Jr., C., Faloutsos, C.: Similarity search without tears: The omni family of all-purpose access methods. In: IEEE (ICDE), Heidelberg, Germany, pp. 623\u2013630. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1145\/584792.584831","volume-title":"CIKM","author":"C. Traina Jr.","year":"2002","unstructured":"Traina Jr., C., Traina, A.J.M., Santos Filho, R.F., Faloutsos, C.: How to improve the pruning ability of dynamic metric access methods. In: CIKM, McLean, VA, USA, pp. 219\u2013226. ACM Press, New York (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75185-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T01:38:08Z","timestamp":1684028288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75185-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540751847","9783540751854"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75185-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}