{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:32:39Z","timestamp":1764783159813},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114854"},{"type":"electronic","value":"9783642114861"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11486-1_9","type":"book-chapter","created":{"date-parts":[[2010,1,27]],"date-time":"2010-01-27T08:39:51Z","timestamp":1264581591000},"page":"98-109","source":"Crossref","is-referenced-by-count":3,"title":["Indexing Dense Nested Metric Spaces for Efficient Similarity Search"],"prefix":"10.1007","author":[{"given":"Nieves R.","family":"Brisaboa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel R.","family":"Luaces","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Pedreira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1ngeles S.","family":"Places","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Seco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"9_CR1","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":"9_CR2","series-title":"Advances in Database Systems","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity search. The metric space approach","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.\u00a032. Springer, Heidelberg (2006)"},{"key":"9_CR3","series-title":"Springer Undergraduate Mathematics Series","volume-title":"Metric Spaces","author":"M.O. Searc\u00f3id","year":"2007","unstructured":"Searc\u00f3id, M.O.: Metric Spaces. Springer Undergraduate Mathematics Series. Springer, Heidelberg (2007)"},{"issue":"14","key":"9_CR4","doi-asserted-by":"publisher","first-page":"2357","DOI":"10.1016\/S0167-8655(03)00065-5","volume":"24","author":"B. Bustos","year":"2003","unstructured":"Bustos, B., Navarro, G., Ch\u00e1vez, E.: Pivot selection techniques for proximity searching in metric spaces. Pattern Recognition Letters\u00a024(14), 2357\u20132366 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"9_CR5","volume-title":"Proc. of 21st conference on Very Large Databases (VLDB 1995)","author":"S. Brin","year":"1995","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proc. of 21st conference on Very Large Databases (VLDB 1995). ACM Press, New York (1995)"},{"issue":"4","key":"9_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\u00a016(4), 230\u2013236 (1973)","journal-title":"Communications of the ACM"},{"key":"9_CR7","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 fixed-queries trees. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol.\u00a0807, pp. 198\u2013212. Springer, Heidelberg (1994)"},{"key":"9_CR8","first-page":"311","volume-title":"Proc. of the fourth annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1993)","author":"P. Yianilos","year":"1993","unstructured":"Yianilos, P.: Data structures and algorithms for nearest-neighbor search in general metric spaces. In: Proc. of the fourth annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1993), pp. 311\u2013321. ACM Press, New York (1993)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E. Vidal","year":"1986","unstructured":"Vidal, E.: An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recognition Letters\u00a04, 145\u2013157 (1986)","journal-title":"Pattern Recognition Letters"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"L. Mic\u00f3","year":"1994","unstructured":"Mic\u00f3, L., Oncina, J., Vidal, R.E.: A new version of the nearest-neighbor approximating and eliminating search (aesa) with linear pre-processing time and memory requirements. Pattern Recognition Letters\u00a015, 9\u201317 (1994)","journal-title":"Pattern Recognition Letters"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/TSE.1983.235263","volume":"9","author":"I. Kalantari","year":"1983","unstructured":"Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Transactions on Software Engineering\u00a09, 631\u2013634 (1983)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"9_CR12","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, 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"9_CR13","first-page":"426","volume-title":"Proc. of the 23rd International Conference on Very Large Data Bases (VLDB 1997)","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: Proc. of the 23rd International Conference on Very Large Data Bases (VLDB 1997), Athens, Greece, pp. 426\u2013435. ACM Press, New York (1997)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0031-3203(00)00120-5","volume":"35","author":"J. Vleugels","year":"2002","unstructured":"Vleugels, J., Veltkamp, R.C.: Efficient image retrieval through vantage objects. Pattern Recognition\u00a035(1), 69\u201380 (2002)","journal-title":"Pattern Recognition"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1109\/ICPR.2006.1038","volume-title":"Proc. of the 18th International Conference on Pattern Recognition (ICPR 2006)","author":"R.H. Leuken van","year":"2006","unstructured":"van Leuken, R.H., Veltkamp, R.C., Typke, R.: Selecting vantage objects for similarity indexing. In: Proc. of the 18th International Conference on Pattern Recognition (ICPR 2006), pp. 453\u2013456. IEEE Press, Los Alamitos (2006)"},{"issue":"5","key":"9_CR16","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1007\/s00778-007-0062-1","volume":"17","author":"J. Venkateswaran","year":"2008","unstructured":"Venkateswaran, J., Kahveci, T., Jermaine, C.M., Lachwani, D.: Reference-based indexing for metric spaces with costly distance measures. The VLDB Journal\u00a017(5), 1231\u20131251 (2008)","journal-title":"The VLDB Journal"},{"key":"9_CR17","first-page":"881","volume-title":"Proc. of the 8th IEEE International Symposium on Multimedia (ISM 2006), San Diego, California, USA","author":"N.R. Brisaboa","year":"2006","unstructured":"Brisaboa, N.R., Fari\u00f1a, A., Pedreira, O., Reyes, N.: Similarity search using sparse pivots for efficient multimedia information retrieval. In: Proc. of the 8th IEEE International Symposium on Multimedia (ISM 2006), San Diego, California, USA, pp. 881\u2013888. IEEE Press, Los Alamitos (2006)"},{"key":"9_CR18","unstructured":"SISAP: Metric spaces library, http:\/\/sisap.org\/metric_space_library.html"}],"container-title":["Lecture Notes in Computer Science","Perspectives of Systems Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11486-1_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:41:17Z","timestamp":1606185677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11486-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114854","9783642114861"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11486-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}