{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:32:44Z","timestamp":1743031964071,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319192635"},{"type":"electronic","value":"9783319192642"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","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":[[2015]]},"DOI":"10.1007\/978-3-319-19264-2_11","type":"book-chapter","created":{"date-parts":[[2015,6,4]],"date-time":"2015-06-04T02:01:53Z","timestamp":1433383313000},"page":"103-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Boosting the Permutation Based Index 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","published-online":{"date-parts":[[2015,6,4]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-41062-8_10","volume-title":"Similarity Search and Applications","author":"G Amato","year":"2013","unstructured":"Amato, G., Esuli, A., Falchi, F.: Pivot selection strategies for permutation-based similarity search. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) SISAP 2013. LNCS, vol. 8199, pp. 91\u2013102. Springer, Heidelberg (2013)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Amato, G., Savino, P.: Approximate similarity search in metric spaces using inverted files. In: Proceedings of the 3rd International Conference on Scalable Information Systems, pp. 28:1\u201328:10. ICST (2008)","DOI":"10.4108\/ICST.INFOSCALE2008.3486"},{"issue":"9","key":"11_CR3","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1109\/TPAMI.2007.70815","volume":"30","author":"E Ch\u00e1vez","year":"2009","unstructured":"Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Effective proximity retrieval by ordering permutations. IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI) 30(9), 1647\u20131658 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI)"},{"issue":"3","key":"11_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.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"11_CR5","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. 17(1), 134\u2013160 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-72845-0_18","volume-title":"Experimental Algorithms","author":"K Figueroa","year":"2007","unstructured":"Figueroa, K., Fredriksson, K.: Simple space-time trade-offs for AESA. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 229\u2013241. Springer, Heidelberg (2007)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-07491-7_11","volume-title":"Pattern Recognition","author":"K Figueroa","year":"2014","unstructured":"Figueroa, K., Paredes, R.: An effective permutant selection heuristic for proximity searching in metric spaces. In: Mart\u00ednez-Trinidad, J.F., Carrasco-Ochoa, J.A., Olvera-Lopez, J.A., Salas-Rodr\u00edguez, J., Suen, C.Y. (eds.) MCPR 2014. LNCS, vol. 8495, pp. 102\u2013111. Springer, Heidelberg (2014)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-31149-9_21","volume-title":"Pattern Recognition","author":"K Figueroa Mora","year":"2012","unstructured":"Figueroa Mora, K., Paredes, R.: Compact and efficient permutations for proximity searching. In: Carrasco-Ochoa, J.A., Mart\u00ednez-Trinidad, J.F., Olvera L\u00f3pez, J.A., Boyer, K.L. (eds.) MCPR 2012. LNCS, vol. 7329, pp. 207\u2013215. Springer, Heidelberg (2012)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-41062-8_11","volume-title":"Similarity Search and Applications","author":"H Mohamed","year":"2013","unstructured":"Mohamed, H., Marchand-Maillet, S.: Quantized ranking for permutation-based indexing. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) SISAP 2013. LNCS, vol. 8199, pp. 103\u2013114. Springer, Heidelberg (2013)"},{"key":"11_CR10","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 Recogn. Lett. 4, 145\u2013157 (1986)","journal-title":"Pattern Recogn. Lett."}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19264-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T00:50:42Z","timestamp":1599094242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19264-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319192635","9783319192642"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19264-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}