{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:34:37Z","timestamp":1725554077409},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343790"},{"type":"electronic","value":"9783540343806"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758501_82","type":"book-chapter","created":{"date-parts":[[2006,5,9]],"date-time":"2006-05-09T16:38:01Z","timestamp":1147192681000},"page":"611-617","source":"Crossref","is-referenced-by-count":8,"title":["An Index Data Structure for Searching in Metric Space Databases"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Uribe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo J.","family":"Barrientos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio","family":"Mar\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"82_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 fixedqueries trees. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol.\u00a0807, pp. 198\u2013212. Springer, Heidelberg (1994)"},{"key":"82_CR2","first-page":"574","volume-title":"The 21st VLDB Conference","author":"S. Brin","year":"1995","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: The 21st VLDB Conference, pp. 574\u2013584. Morgan Kaufmann Publishers, San Francisco (1995)"},{"issue":"4","key":"82_CR3","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. Communication of ACM\u00a016(4), 230\u2013236 (1973)","journal-title":"Communication of ACM"},{"issue":"3","key":"82_CR4","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 Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"82_CR5","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: The 23st International Conference on VLDB, pp. 426\u2013435 (1997)"},{"issue":"1","key":"82_CR6","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. The Very Large Databases Journal (VLDBJ)\u00a011(1), 28\u201346 (2002)","journal-title":"The Very Large Databases Journal (VLDBJ)"},{"key":"82_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-45735-6_23","volume-title":"String Processing and Information Retrieval","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Reyes, N.: Fully dynamic spatial approximation trees. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 254\u2013270. Springer, Heidelberg (2002)"},{"key":"82_CR8","doi-asserted-by":"crossref","unstructured":"Traina, C., Traina, A., Seeger, B., Faloutsos, C.: Slim-trees: High performance metric trees minimizing overlap between nodes. In: VII International Conference on Extending Database Technology, pp. 51\u201361 (2000)","DOI":"10.1007\/3-540-46439-5_4"},{"key":"82_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J. Uhlmann","year":"1991","unstructured":"Uhlmann, J.: Satisfying general proximity\/similarity queries with metric trees. Information Processing Letters\u00a040, 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"82_CR10","unstructured":"Uribe, R.: A space-metric data structure for secondary memory. Master\u2019s thesis, Computer Science Department, University of Chile, Santiago, Chile, Abril (2005)"},{"key":"82_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Comm. ACM\u00a033, 103\u2013111 (1990)","journal-title":"Comm. ACM"},{"key":"82_CR12","unstructured":"Yianilos, P.: Data structures and algoritms for nearest neighbor search in general metric spaces. In: 4th ACM-SIAM Symposium on Discrete Algorithms (SODA 1993), pp. 311\u2013321 (1993)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758501_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T23:37:57Z","timestamp":1552520277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758501_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343790","9783540343806"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11758501_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}