{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:08:47Z","timestamp":1725487727229},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725831"},{"type":"electronic","value":"9783540725848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72584-8_30","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T17:58:59Z","timestamp":1184608739000},"page":"229-236","source":"Crossref","is-referenced-by-count":7,"title":["Searching and Updating Metric Space Databases Using the Parallel EGNAT"],"prefix":"10.1007","author":[{"given":"Mauricio","family":"Marin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Uribe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Barrientos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (1994)"},{"key":"30_CR2","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: The 21st VLDB Conference (1995)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Burkhard, W., Keller, R.: Some approaches to best-match file searching. Communication of ACM (1973)","DOI":"10.1145\/362003.362025"},{"key":"30_CR4","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 (1997)"},{"key":"30_CR5","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":"30_CR6","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 - EDBT 2000","author":"C. Traina Jr.","year":"2000","unstructured":"Traina Jr., C., Traina, A.J.M., Seeger, B., Faloutsos, C.: Slim-trees: High performance metric trees minimizing overlap between nodes. In: Zaniolo, C., Grust, T., Scholl, M.H., Lockemann, P.C. (eds.) EDBT 2000. LNCS, vol.\u00a01777, p. 51. Springer, Heidelberg (2000)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/11758501_82","volume-title":"Computational Science \u2013 ICCS 2006","author":"R. Uribe","year":"2006","unstructured":"Uribe, R., Navarro, G., Barrientos, R.J., Mar\u00edn, M.: An index data structure for searching in metric space databases. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol.\u00a03991, pp. 611\u2013617. Springer, Heidelberg (2006)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Uhlmann, J.: Satisfying general proximity\/similarity queries with Metric Trees. Information Processing Letters (1991)","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Comm. ACM (1990)","DOI":"10.1145\/79173.79181"},{"key":"30_CR10","unstructured":"Yianilos, P.: Data structures and algoritms for nearest neighbor search in general metric spaces. In: 4th ACM-SIAM Symposium on Discrete Algorithms (1993)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72584-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T04:09:09Z","timestamp":1556683749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72584-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725831","9783540725848"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72584-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}