{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:15:45Z","timestamp":1742912145472,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319921976"},{"type":"electronic","value":"9783319921983"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92198-3_9","type":"book-chapter","created":{"date-parts":[[2018,5,24]],"date-time":"2018-05-24T04:29:32Z","timestamp":1527136172000},"page":"82-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving the List of Clustered Permutation on Metric Spaces for Similarity Searching on Secondary Memory"],"prefix":"10.1007","author":[{"given":"Karina","family":"Figueroa","sequence":"first","affiliation":[]},{"given":"Nora","family":"Reyes","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Camarena-Ibarrola","sequence":"additional","affiliation":[]},{"given":"L.","family":"Valero-Elizondo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,25]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Amato, G., Savino, P.: Approximate similarity search in metric spaces using inverted files. In: 3rd International ICST Conference on Scalable Information Systems, INFOSCALE 2008, Vico Equense, Italy, 4\u20136 June 2008, p. 28 (2008). \nhttps:\/\/doi.org\/10.4108\/ICST.INFOSCALE2008.3486","DOI":"10.4108\/ICST.INFOSCALE2008.3486"},{"issue":"1","key":"9_CR2","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. Inf. Process. Lett. 85(1), 39\u201346 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"9","key":"9_CR3","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 Recogn. Lett. 26(9), 1363\u20131376 (2005)","journal-title":"Pattern Recogn. Lett."},{"issue":"9","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1109\/TPAMI.2007.70815","volume":"30","author":"E Chavez","year":"2008","unstructured":"Chavez, E., Figueroa, K., Navarro, G.: Effective proximity retrieval by ordering permutations. IEEE Trans. Pattern Anal. Mach. Intell. 30(9), 1647\u20131658 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"9_CR5","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/j.ipm.2010.11.011","volume":"48","author":"A Esuli","year":"2012","unstructured":"Esuli, A.: Use of permutation prefixes for efficient and scalable approximate similarity search. Inf. Process. Manag. 48(5), 889\u2013902 (2012). \nhttps:\/\/doi.org\/10.1016\/j.ipm.2010.11.011","journal-title":"Inf. Process. Manag."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-41062-8_6","volume-title":"Similarity Search and Applications","author":"K Figueroa","year":"2013","unstructured":"Figueroa, K., Paredes, R.: List of clustered permutations for proximity searching. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) SISAP 2013. LNCS, vol. 8199, pp. 50\u201358. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-41062-8_6"},{"key":"9_CR7","unstructured":"Figueroa, K., Navarro, G., Ch\u00e1vez, E.: Metric spaces library (2007). \nhttp:\/\/www.sisap.org\/Metric_Space_Library.html"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/978-3-642-39640-3_42","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2013","author":"S Jin","year":"2013","unstructured":"Jin, S., Kim, O., Feng, W.: $${\\rm M}^{\\rm X}$$MX-tree: a double hierarchical metric index with overlap reduction. In: Murgante, B., Misra, S., Carlini, M., Torre, C.M., Nguyen, H.-Q., Taniar, D., Apduhan, B.O., Gervasi, O. (eds.) ICCSA 2013. LNCS, vol. 7975, pp. 574\u2013589. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39640-3_42"},{"key":"9_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139924801","volume-title":"Mining of Massive Datasets","author":"J Leskovec","year":"2014","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets, 2nd edn. Cambridge University Press, New York (2014)","edition":"2"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.is.2014.01.007","volume":"43","author":"Jakub Loko\u010d","year":"2014","unstructured":"Loko\u010d, J., Mo\u0161ko, J., \u010cech, P., Skopal, T.: On indexing metric spaces using cut-regions. Inf. Syst. 43, 1\u201319 (2014). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0306437914000258","journal-title":"Information Systems"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.is.2016.03.009","volume":"59","author":"G Navarro","year":"2016","unstructured":"Navarro, G., Reyes, N.: New dynamic metric indices for secondary memory. Inf. Syst. 59, 48\u201378 (2016)","journal-title":"Inf. Syst."},{"issue":"02","key":"9_CR12","first-page":"107","volume":"15","author":"P Roggero","year":"2015","unstructured":"Roggero, P., Reyes, N., Figueroa, K., Paredes, R.: List of clustered permutations in secondary memory for proximity searching. J. Comput. Sci. Technol. 15(02), 107\u2013113 (2015)","journal-title":"J. Comput. Sci. Technol."},{"key":"9_CR13","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures, 1st edn. The Morgan Kaufman Series in Computer Graphics and Geometic Modeling, Morgan Kaufmann Publishers, University of Maryland at College Park (2006)"},{"issue":"4","key":"9_CR14","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. Inf. Process. Lett. 40(4), 175\u2013179 (1991)","journal-title":"Inf. Process. Lett."},{"key":"9_CR15","series-title":"Advances in Database Systems","doi-asserted-by":"publisher","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. 32. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/0-387-29151-2"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92198-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T05:43:12Z","timestamp":1527572592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92198-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319921976","9783319921983"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92198-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}