{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:04:48Z","timestamp":1740096288353,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410611"},{"type":"electronic","value":"9783642410628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41062-8_6","type":"book-chapter","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T00:34:35Z","timestamp":1377822875000},"page":"50-58","source":"Crossref","is-referenced-by-count":4,"title":["List of Clustered Permutations for Proximity Searching"],"prefix":"10.1007","author":[{"given":"Karina","family":"Figueroa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys\u00a033(3), 322\u2013373 (2001)","journal-title":"ACM Computing Surveys"},{"key":"6_CR2","unstructured":"Bolettieri, P., Esuli, A., Falchi, F., Lucchese, C., Perego, R., Piccioli, T., Rabitti, F.: CoPhIR: A test collection for content-based image retrieval. CoRR abs\/0905.4627v2 (2009), \n                    \n                      http:\/\/cophir.isti.cnr.it"},{"key":"6_CR3","series-title":"LNCS(LNAI)","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/11579427_41","volume-title":"MICAI 2005: Advances in Artificial Intelligence","author":"E. Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Proximity searching in high dimensional spaces with a proximity preserving order. In: Gelbukh, A., de Albornoz, \u00c1., Terashima-Mar\u00edn, H. (eds.) MICAI 2005. LNCS(LNAI), vol.\u00a03789, pp. 405\u2013414. Springer, Heidelberg (2005)"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(02)00344-7","volume":"85","author":"E. Ch\u00e1vez","year":"2003","unstructured":"Ch\u00e1vez, E., Navarro, G.: Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. Information Processing Letters\u00a085(1), 39\u201346 (2003)","journal-title":"Information Processing Letters"},{"issue":"9","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1016\/j.patrec.2004.11.014","volume":"26","author":"E. Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recognition Letters\u00a026(9), 1363\u20131376 (2005)","journal-title":"Pattern Recognition Letters"},{"issue":"3","key":"6_CR6","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.: Proximity searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Esuli, A.: Mipai: using the pp-index to build an efficient and scalable similarity search system. In: Proc. 2nd Intl. Workshop on Similary Searching and Applications (SISAP 2009), pp. 146\u2013148. IEEE Computer Society (2009)","DOI":"10.1109\/SISAP.2009.14"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/S0895480102412856","volume":"17","author":"R. Fagin","year":"2003","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. SIAM J. Discrete Math.\u00a017(1), 134\u2013160 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR9","unstructured":"Figueroa, K., Ch\u00e1vez, E., Navarro, G., Paredes, R.: Speeding up spatial approximation search in metric spaces. ACM Journal of Experimental Algorithmics (JEA) 14, article 3.6, 21 pages (2009), doi: \n                    \n                      http:\/\/doi.acm.org\/10.1145\/1498698.1564506"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-21587-2_5","volume-title":"Pattern Recognition","author":"K. Figueroa Mora","year":"2011","unstructured":"Figueroa Mora, K., Paredes, R., Rangel, R.: Efficient group of permutants for proximity searching. In: Mart\u00ednez-Trinidad, J.F., Carrasco-Ochoa, J.A., Ben-Youssef Brants, C., Hancock, E.R. (eds.) MCPR 2011. LNCS, vol.\u00a06718, pp. 42\u201349. Springer, Heidelberg (2011)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/SISAP.2009.12","volume-title":"Proceedings of the 2009 Second International Workshop on Similarity Search and Applications, SISAP 2009","author":"K. Figueroa","year":"2009","unstructured":"Figueroa, K., Frediksson, K.: Speeding up permutation based indexing with indexing. In: Proceedings of the 2009 Second International Workshop on Similarity Search and Applications, SISAP 2009, pp. 107\u2013114. IEEE Computer Society, Washington, DC (2009), \n                    \n                      http:\/\/dx.doi.org\/10.1109\/SISAP.2009.12"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jda.2008.09.014","volume":"7","author":"M. Patella","year":"2009","unstructured":"Patella, M., Ciaccia, P.: Approximate similarity search: A multi-faceted problem. Journal of Discrete Algorithms\u00a07(1), 36\u201348 (2009)","journal-title":"Journal of Discrete Algorithms"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.jda.2008.09.011","volume":"7","author":"M. Skala","year":"2009","unstructured":"Skala, M.: Counting distance permutations. J. of Discrete Algorithms\u00a07(1), 49\u201361 (2009), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.jda.2008.09.011","journal-title":"J. of Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41062-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T20:41:40Z","timestamp":1558039300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41062-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410611","9783642410628"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41062-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}