{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:15:28Z","timestamp":1748751328827,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49192-8_50","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T15:47:27Z","timestamp":1452181647000},"page":"615-627","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Evaluation of Static\/Dynamic Cache for Similarity Search Engines"],"prefix":"10.1007","author":[{"given":"R.","family":"Solar","sequence":"first","affiliation":[]},{"given":"V.","family":"Gil-Costa","sequence":"additional","affiliation":[]},{"given":"M.","family":"Mar\u00edn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"issue":"3","key":"50_CR1","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1007\/s11042-012-1271-1","volume":"71","author":"G Amato","year":"2014","unstructured":"Amato, G., Gennaro, C., Savino, P.: MI-File: using inverted files for scalable approximate similarity search. Multimedia Tools Appl. 71(3), 1333\u20131362 (2014)","journal-title":"Multimedia Tools Appl."},{"key":"50_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). http:\/\/cophir.isti.cnr.it"},{"key":"50_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/978-3-662-46078-8_40","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science-Testing","author":"NR Brisaboa","year":"2015","unstructured":"Brisaboa, N.R., Cerdeira-Pena, A., Gil-Costa, V., Marin, M., Pedreira, O.: Efficient similarity search by combining indexing and caching strategies. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 486\u2013497. Springer, Heidelberg (2015)"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Chavez, E., Navarro, G.: An effective clustering algorithm to index high dimensional metric spaces. In: SPIRE, p. 75 (2000)","DOI":"10.1109\/SPIRE.2000.878182"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Kumar, R., Vassilvitskii, S.: similarity caching. In: PODS, pp. 127\u2013136 (2009)","DOI":"10.1145\/1559795.1559815"},{"key":"50_CR6","first-page":"889","volume":"48","author":"A Esuli","year":"2012","unstructured":"Esuli, A.: Use of permutation prefixes for efficient and scalable approximate similarity search. IPM J. 48, 889\u2013902 (2012)","journal-title":"IPM J."},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Falchi, F., Lucchese, C., Orlando, S., Perego, R., Rabitti, F.: A metric cache for similarity search. In: LSDS-IR, pp. 43\u201350 (2008)","DOI":"10.1145\/1458469.1458473"},{"key":"50_CR8","first-page":"803","volume":"48","author":"F Falchi","year":"2012","unstructured":"Falchi, F., Lucchese, C., Orlando, S., Perego, R., Rabitti, F.: Similarity caching in large-scale image retrieval. IPM J. 48, 803\u2013818 (2012)","journal-title":"IPM J."},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Gil-Costa, V., Marin, M.: Approximate distributed metric-space search. In: LSDS-IR, pp. 15\u201320 (2011)","DOI":"10.1145\/2064730.2064736"},{"key":"50_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-40285-2_6","volume-title":"Database and Expert Systems Applications","author":"H Mohamed","year":"2013","unstructured":"Mohamed, H., Marchand-Maillet, S.: Permutation-based pruning for approximate K-NN search. In: Decker, H., Lhotsk\u00e1, L., Link, S., Basl, J., Tjoa, A.M. (eds.) DEXA 2013, Part I. LNCS, vol. 8055, pp. 40\u201347. Springer, Heidelberg (2013)"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Pandey, S., Broder, A., Chierichetti, F., Josifovski, V., Kumar, R., Vassilvitskii, S.: Nearest-neighbor caching for content-match applications. In: WWW, pp. 441\u2013450 (2009)","DOI":"10.1145\/1526709.1526769"},{"key":"50_CR12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/978-3-319-11988-5_8","volume-title":"Similarity Search and Applications","author":"Eliezer Silva","year":"2014","unstructured":"Silva, E., Teixeira, T., Teodoro, G., Valle, E.: Large-scale distributed locality-sensitive hashing for general metric data. In: Traina, A.J.M., Traina, Jr., C., Cordeiro, R.L.F. (eds.) SISAP 2014. LNCS, vol. 8821, pp. 82\u201393. Springer, Heidelberg (2014)"},{"key":"50_CR13","first-page":"868","volume":"24","author":"T Skopal","year":"2012","unstructured":"Skopal, T., Lokoc, J., Bustos, B.: D-Cache: universal distance cache for metric access methods. TKDE 24, 868\u2013881 (2012)","journal-title":"TKDE"},{"key":"50_CR14","first-page":"79","volume-title":"Advanced Techniques in Computing Sciences and Software Engineering","author":"Janett Walters-Williams","year":"2009","unstructured":"Walters-Williams, J., Li, Y.: Comparative study of distance functions for nearest neighbors. In: Advanced Techniques in Computing Sciences and Software Engineering, pp. 79\u201384 (2010)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:19:18Z","timestamp":1748744358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}