{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:53:47Z","timestamp":1648702427668},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,12,7]],"date-time":"2017-12-07T00:00:00Z","timestamp":1512604800000},"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":["J Supercomput"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s11227-017-2207-3","type":"journal-article","created":{"date-parts":[[2017,12,7]],"date-time":"2017-12-07T07:17:37Z","timestamp":1512631057000},"page":"2006-2034","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A graph-based cache for large-scale similarity search engines"],"prefix":"10.1007","volume":"74","author":[{"given":"Veronica","family":"Gil-Costa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio","family":"Marin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carolina","family":"Bonacic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Solar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,7]]},"reference":[{"issue":"4","key":"2207_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1402946.1402967","volume":"38","author":"M Al-Fares","year":"2008","unstructured":"Al-Fares M, Loukissas A, Vahdat A (2008) A scalable, commodity data center network architecture. SIGCOMM Comput Commun Rev 38(4):63\u201374","journal-title":"SIGCOMM Comput Commun Rev"},{"key":"2207_CR2","doi-asserted-by":"crossref","unstructured":"Amato G, Esuli A, Falchi F (2013) Pivot selection strategies for permutation-based similarity search. In: SISAP, pp 91\u2013102","DOI":"10.1007\/978-3-642-41062-8_10"},{"issue":"C","key":"2207_CR3","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.is.2015.01.010","volume":"52","author":"G Amato","year":"2015","unstructured":"Amato G, Esuli A, Falchi E (2015) A comparison of pivot selection techniques for permutation-based indexing. J Inf Syst 52(C):176\u2013188","journal-title":"J Inf Syst"},{"key":"2207_CR4","doi-asserted-by":"crossref","unstructured":"Amato G, Savino P (2008) Approximate similarity search in metric spaces using inverted files. In: InfoScale, pp 28:1\u201328:10","DOI":"10.4108\/ICST.INFOSCALE2008.3486"},{"issue":"1","key":"2207_CR5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni A, Indyk P (2008) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. J Commun ACM 51(1):117\u2013122","journal-title":"J Commun ACM"},{"issue":"6","key":"2207_CR6","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1998) An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J ACM 45(6):891\u2013923","journal-title":"J ACM"},{"key":"2207_CR7","volume-title":"Modern information retrieval","author":"R Baeza-Yates","year":"2011","unstructured":"Baeza-Yates R, Ribeiro-Neto B (2011) Modern information retrieval, 2nd edn. Addison-Wesley Publishing Company, Reading","edition":"2"},{"key":"2207_CR8","doi-asserted-by":"crossref","unstructured":"Brisaboa NR, Cerdeira-Pena A, Gil-Costa V, Mar\u00edn M, Pedreira O (2015) Efficient similarity search by combining indexing and caching strategies. In: SOFSEM, pp 486\u2013497","DOI":"10.1007\/978-3-662-46078-8_40"},{"issue":"16","key":"2207_CR9","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/362003.362025","volume":"4","author":"WA Burkhard","year":"1973","unstructured":"Burkhard WA, Keller RM (1973) Some approaches to best-match file searching. J Commun ACM 4(16):230\u2013236","journal-title":"J Commun ACM"},{"issue":"14","key":"2207_CR10","doi-asserted-by":"crossref","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 (2003) Pivot selection techniques for proximity searching in metric spaces. J Pattern Recognit Lett 24(14):2357\u20132366","journal-title":"J Pattern Recognit Lett"},{"key":"2207_CR11","unstructured":"Bustos B, Pedreira O, Brisaboa N (2008) A dynamic pivot selection technique for similarity search. In: SISAP, pp 394\u2013401"},{"key":"2207_CR12","doi-asserted-by":"crossref","unstructured":"Cao W, Sahin S, Liu L, Bao X (2016) Evaluation and analysis of in-memory key-value systems. In: BigData, pp 26\u201333","DOI":"10.1109\/BigDataCongress.2016.13"},{"key":"2207_CR13","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1109\/TPAMI.2007.70815","volume":"30","author":"E Ch\u00e1vez","year":"2008","unstructured":"Ch\u00e1vez E, Figueroa K, Navarro G (2008) Effective proximity retrieval by ordering permutations. J Pattern Anal Manag Intell 30:1647\u20131658","journal-title":"J Pattern Anal Manag Intell"},{"key":"2207_CR14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.is.2015.10.014","volume":"59","author":"E Ch\u00e1vez","year":"2016","unstructured":"Ch\u00e1vez E, Ludue\u00f1a V, Reyes N, Roggero P (2016) Faster proximity searching with the distal SAT. J Inf Syst 59:15\u201347","journal-title":"J Inf Syst"},{"issue":"2","key":"2207_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1011343115154","volume":"14","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez E, Marroquin J, Navarro G (2001) Fixed queries array: a fast and economical data structure for proximity searching. J Multimed Tools Appl 14(2):113\u2013135","journal-title":"J Multimed Tools Appl"},{"issue":"9","key":"2207_CR16","doi-asserted-by":"crossref","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 (2005) A compact space decomposition for effective metric indexing. J Pattern Recogn Lett 26(9):1363\u20131376","journal-title":"J Pattern Recogn Lett"},{"key":"2207_CR17","doi-asserted-by":"crossref","unstructured":"Chierichetti F, Kumar R, Vassilvitskii S (2009) Similarity caching. In: SIGMOD-SIGACT-SIGART, pp 127\u2013136","DOI":"10.1145\/1559795.1559815"},{"key":"2207_CR18","doi-asserted-by":"crossref","unstructured":"Ciaccia P, Patella M (2000) PAC nearest neighbor queries: approximate and controlled search in high-dimensional and metric spaces. In: ICDE, pp 244\u2013255","DOI":"10.1109\/ICDE.2000.839417"},{"key":"2207_CR19","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: VLDB, pp 426\u2013435"},{"key":"2207_CR20","doi-asserted-by":"crossref","unstructured":"Dehne F, Noltemeier H (1988) Voronoi trees and clustering problems. In: Syntactic and structural, pattern recognition, pp 185\u2013194","DOI":"10.1007\/978-3-642-83462-2_12"},{"issue":"6","key":"2207_CR21","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/TKDE.2004.9","volume":"16","author":"\u00d6 Egecioglu","year":"2004","unstructured":"Egecioglu \u00d6, Ferhatosmanoglu H, Ogras \u00dcY (2004) Dimensionality reduction and similarity computation by inner-product approximations. IEEE Trans Knowl Data Eng 16(6):714\u2013726","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2207_CR22","doi-asserted-by":"crossref","unstructured":"Esuli A (2009) Mipai: using the pp-index to build an efficient and scalable similarity search system. In: SISAP, pp 146\u2013148","DOI":"10.1109\/SISAP.2009.14"},{"key":"2207_CR23","unstructured":"Esuli A (2010) Pp-index: using permutation prefixes for efficient and scalable similarity search. In: SEBD, pp 318\u2013325"},{"key":"2207_CR24","doi-asserted-by":"crossref","unstructured":"Falchi F, Lucchese C, Orlando S, Perego R, Rabitti F (2008) A metric cache for similarity search. In: LSDS-IR, pp 43\u201350","DOI":"10.1145\/1458469.1458473"},{"key":"2207_CR25","doi-asserted-by":"crossref","unstructured":"Falchi F, Lucchese C, Orlando S, Perego R, Rabitti F (2009) Caching content-based queries for robust and efficient image retrieval. In: EDBT, pp 780\u2013790","DOI":"10.1145\/1516360.1516450"},{"key":"2207_CR26","doi-asserted-by":"crossref","unstructured":"Falchi F, Lucchese C, Orlando S, Perego R, Rabitti F (2011) Similarity caching in large-scale image retrieval. J Inf Process Manag 48(5):803\u2013818","DOI":"10.1016\/j.ipm.2010.12.006"},{"key":"2207_CR27","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Lin K-I (1995) Fastmap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: SIGMOD, pp 163\u2013174","DOI":"10.1145\/223784.223812"},{"key":"2207_CR28","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu H, Tuncel E, Agrawal D, El Abbadi A (2001) Approximate nearest neighbor searching in multimedia databases. In: ICDE, pp 503\u2013511","DOI":"10.1109\/ICDE.2001.914864"},{"key":"2207_CR29","doi-asserted-by":"crossref","unstructured":"Figueroa K, Paredes R (2015) Boosting the permutation based index for proximity searching. In: MCPR, pp 103\u2013112","DOI":"10.1007\/978-3-319-19264-2_11"},{"key":"2207_CR30","doi-asserted-by":"crossref","unstructured":"Gennaro C, Amato G, Bolettieri P, Savino P (2010) An approach to content-based image retrieval based on the lucene search engine library. In: ECDL, pp 55\u201366","DOI":"10.1007\/978-3-642-15464-5_8"},{"key":"2207_CR31","doi-asserted-by":"crossref","unstructured":"Gessert F, Wingerath W, Friedrich S, Ritter N (2017) Nosql database systems: a survey and decision guidance. J Comput Sci R&D 32(3\u20134):353\u2013365","DOI":"10.1007\/s00450-016-0334-3"},{"key":"2207_CR32","doi-asserted-by":"crossref","unstructured":"Gil-Costa V, Marin M (2011) Approximate distributed metric-space search. In: LSDS-IR, pp 15\u201320","DOI":"10.1145\/2064730.2064736"},{"issue":"1","key":"2207_CR33","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jda.2008.09.010","volume":"7","author":"V Gil-Costa","year":"2009","unstructured":"Gil-Costa V, Marin M, Reyes N (2009) Parallel query processing on distributed clustering indexes. J Discrete Algorithms 7(1):3\u201317","journal-title":"J Discrete Algorithms"},{"key":"2207_CR34","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.jda.2012.07.004","volume":"18","author":"V Gil-Costa","year":"2013","unstructured":"Gil-Costa V, Santos RLT, Macdonald C, Ounis I (2013) Modelling efficient novelty-based search result diversification in metric spaces. J Discrete Algorithms 18:75\u201388","journal-title":"J Discrete Algorithms"},{"key":"2207_CR35","doi-asserted-by":"crossref","unstructured":"Hersh W, Turpin A, Price S, Chan B, Kramer D, Sacherek L, Olson D (2000) Do batch and user evaluations give the same results? In: SIGIR, pp 17\u201324","DOI":"10.1145\/345508.345539"},{"key":"2207_CR36","doi-asserted-by":"crossref","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: ACM Symposium on Theory of Computing, pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"key":"2207_CR37","volume-title":"The turn: integration of information seeking and retrieval in context (The Information Retrieval Series)","author":"P Ingwersen","year":"2005","unstructured":"Ingwersen P, J\u00e4rvelin K (2005) The turn: integration of information seeking and retrieval in context (The Information Retrieval Series). Springer, New York Inc, Secaucus"},{"key":"2207_CR38","unstructured":"Johnston N, Vincent D, Minnen D, Covell M, Singh S, Chinen TT, Hwang SJ, Shor J, Toderici G (2017) Improved lossy image compression with priming and spatially adaptive bit rates for recurrent networks. CoRR, arXiv:abs\/1703.10114"},{"key":"2207_CR39","unstructured":"Karypis G (2003) Cluto-software for clustering high-dimensional datasets, version 2.1.1. http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/cluto"},{"key":"2207_CR40","doi-asserted-by":"crossref","unstructured":"Lux M, Chatzichristofis SA (2008) Lire: lucene image retrieval: an extensible java cbir library. In: Conference on Multimedia, pp 1085\u20131088","DOI":"10.1145\/1459359.1459577"},{"key":"2207_CR41","unstructured":"MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Berkeley Symposium on Mathematical Statistics and Probability, vol 1, pp 281\u2013297"},{"key":"2207_CR42","doi-asserted-by":"crossref","unstructured":"Mancini V, Bustos F, Gil-Costa V, Printista AM (2012) Data partitioning evaluation for multimedia systems in hybrid environments. In: 3PGCIC, pp 321\u2013326","DOI":"10.1109\/3PGCIC.2012.25"},{"key":"2207_CR43","doi-asserted-by":"crossref","unstructured":"Marin M, Ferrarotti F, Gil-Costa V (2010) Distributing a metric-space search index onto processors. In: ICPP, pp 13\u201316","DOI":"10.1109\/ICPP.2010.51"},{"key":"2207_CR44","doi-asserted-by":"crossref","unstructured":"Marin M, Gil-Costa V, Uribe R (2008) Hybrid index for metric space databases. In: ICCS, pp 327\u2013336","DOI":"10.1007\/978-3-540-69384-0_38"},{"key":"2207_CR45","unstructured":"Matej A, Vlastislav D (2016) Optimizing query performance with inverted cache in metric spaces. In: ADBIS, pp 60\u201373"},{"issue":"1","key":"2207_CR46","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"ML Mic\u00f3","year":"1994","unstructured":"Mic\u00f3 ML, Oncina J, Vidal E (1994) A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. J Pattern Recognit Lett 15(1):9\u201317","journal-title":"J Pattern Recognit Lett"},{"key":"2207_CR47","doi-asserted-by":"crossref","unstructured":"Navarro G (2002) Searching in metric spaces by spatial approximation. In: VLDB, pp 28\u201346","DOI":"10.1007\/s007780200060"},{"key":"2207_CR48","doi-asserted-by":"crossref","unstructured":"Navarro G, Reyes N (2002) Fully dynamic spatial approximation trees. In: SPIRE, pp 254\u2013270","DOI":"10.1007\/3-540-45735-6_23"},{"key":"2207_CR49","doi-asserted-by":"crossref","unstructured":"Navarro G, Reyes N (2009) Dynamic spatial approximation trees for massive data. In: SISAP, pp 81\u201388","DOI":"10.1109\/SISAP.2009.28"},{"key":"2207_CR50","doi-asserted-by":"crossref","unstructured":"Novak D, Batko M (2009) Metric index: an efficient and scalable solution for similarity search. In: SISAP, pp 65\u201373","DOI":"10.1109\/SISAP.2009.26"},{"issue":"5","key":"2207_CR51","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/j.ipm.2010.12.004","volume":"48","author":"D Novak","year":"2012","unstructured":"Novak D, Batko M, Zezula P (2012) Large-scale similarity data management with distributed metric index. J Inf Process Manag 48(5):855\u2013872","journal-title":"J Inf Process Manag"},{"key":"2207_CR52","doi-asserted-by":"crossref","unstructured":"Novak D, Zezula P (2016) PPP-codes for large-scale similarity searching. In: Database and expert-systems applications on transactions on large-scale data- and knowledge-centered systems, pp 61\u201387","DOI":"10.1007\/978-3-662-49214-7_2"},{"key":"2207_CR53","unstructured":"Pedreira O, Brisaboa NR (2007) Sofsem. In: Theory and practice of computer science, pp 434\u2013445"},{"key":"2207_CR54","doi-asserted-by":"crossref","unstructured":"Ogras \u00dcY, Ferhatosmanoglu H (2003) Dimensionality reduction using magnitude and shape approximations. In: CIKM, pp 99\u2013107","DOI":"10.1145\/956863.956883"},{"issue":"3","key":"2207_CR55","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1109\/TBC.2016.2580920","volume":"62","author":"Z Pan","year":"2016","unstructured":"Pan Z, Lei J, Zhang Y, Sun X, Kwong S (2016) Fast motion estimation based on content property for low-complexity H.265\/HEVC encoder. J IEEE Trans Broadcast 62(3):675\u2013684","journal-title":"J IEEE Trans Broadcast"},{"key":"2207_CR56","doi-asserted-by":"crossref","unstructured":"Pandey S, Broder A, Chierichetti F, Josifovski V, Kumar R, Vassilvitskii S (2009) Nearest-neighbor caching for content-match applications. In: WWW, pp 441\u2013450","DOI":"10.1145\/1526709.1526769"},{"key":"2207_CR57","first-page":"865","volume":"1","author":"S Pramanik","year":"1999","unstructured":"Pramanik S, Alexander S, Li J (1999) An efficient searching algorithm for approximate nearest neighbor queries in high dimensions. IEEE Multimed Comput Syst 1:865\u2013869","journal-title":"IEEE Multimed Comput Syst"},{"issue":"3","key":"2207_CR58","doi-asserted-by":"crossref","first-page":"33","DOI":"10.4018\/IJOCI.2016070103","volume":"6","author":"S Raghavendra","year":"2016","unstructured":"Raghavendra S, Nithyashree K, Geeta CM, Buyya R, Venugopal KR, Iyengar SS, Patnaik LM (2016) RSSMSO rapid similarity search on metric space object stored in cloud environment. J Organ Collect Intell 6(3):33\u201349","journal-title":"J Organ Collect Intell"},{"key":"2207_CR59","doi-asserted-by":"crossref","unstructured":"Ruqeishi K, Koneuay M (2015) Regrouping metric-space search index for search engine size adaptation. In: Similarity search and applications, pp 271\u2013282","DOI":"10.1007\/978-3-319-25087-8_26"},{"key":"2207_CR60","unstructured":"Saavedra JM, Barrios JM (2015) Sketch based image retrieval using learned keyshapes (LKS). In: British Machine Vision Conference, pp 164.1\u2013164.11"},{"issue":"1","key":"2207_CR61","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.jda.2008.09.011","volume":"7","author":"M Skala","year":"2009","unstructured":"Skala M (2009) Counting distance permutations. J Discrete Algorithms 7(1):49\u201361","journal-title":"Counting distance permutations. J Discrete Algorithms"},{"key":"2207_CR62","unstructured":"Skillicorn DB, Hill JMD, McColl WF (2000) Mpeg-7. Multimedia content description interfaces, part 3: visual. Technical Report ISO\/IEC 15938-3"},{"issue":"5","key":"2207_CR63","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1109\/TKDE.2011.19","volume":"24","author":"T Skopal","year":"2012","unstructured":"Skopal T, Lokoc J, Bustos B (2012) D-cache: universal distance cache for metric access methods. J Trans Knowl Data Eng 24(5):868\u2013881","journal-title":"J Trans Knowl Data Eng"},{"key":"2207_CR64","doi-asserted-by":"crossref","unstructured":"Solar R, Gil-Costa V, Mar\u00edn M (2016) Evaluation of static\/dynamic cache for similarity search engines. In: SOFSEM, pp 615\u2013627","DOI":"10.1007\/978-3-662-49192-8_50"},{"key":"2207_CR65","doi-asserted-by":"crossref","unstructured":"Sadit Tellez E, Chvez E (2012) The list of clusters revisited. In: Pattern recognition, pp 187\u2013196","DOI":"10.1007\/978-3-642-31149-9_19"},{"key":"2207_CR66","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s101150050009","volume":"2","author":"X Wang","year":"2000","unstructured":"Wang X, Wang JTL, Lin K-I, Shasha D, Shapiro BA, Zhang K (2000) An index structure for data mining and clustering. J Knowl Inf Syst 2:161\u2013184","journal-title":"J Knowl Inf Syst"},{"key":"2207_CR67","doi-asserted-by":"crossref","unstructured":"Weber R, B\u00f6hm K (2000) Trading quality for time with nearest neighbor search. In: Extending database technology: advances in database technology, pp 21\u201335","DOI":"10.1007\/3-540-46439-5_2"},{"key":"2207_CR68","unstructured":"Wei W, Fan X, Song H, Fan X, Yang J (2017) Imperfect information dynamic stackelberg game based resource allocation using hidden Markov for cloud computing. J IEEE Trans Serv Comput PP(99):1\u20131"},{"key":"2207_CR69","unstructured":"White D, Jain R (1996) Algorithms and strategies for similarity retrieval. Technical Report VCL-96-101, Visual Computing Laboratory, University of California San Diego"},{"issue":"11","key":"2207_CR70","doi-asserted-by":"crossref","first-page":"2594","DOI":"10.1109\/TIFS.2016.2590944","volume":"11","author":"Z Xia","year":"2016","unstructured":"Xia Z, Wang X, Zhang L, Qin Z, Sun X, Ren K (2016) A privacy-preserving and copy-deterrence content-based image retrieval scheme in cloud computing. J IEEE Trans Inf Forensics Secur 11(11):2594\u20132608","journal-title":"J IEEE Trans Inf Forensics Secur"},{"key":"2207_CR71","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity search: the metric space approach, advances in database systems","author":"P Zezula","year":"2006","unstructured":"Zezula P, Amato G, Dohnal V, Batko M (2006) Similarity search: the metric space approach, advances in database systems. Springer, Berlin"},{"issue":"1","key":"2207_CR72","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TIFS.2016.2601065","volume":"12","author":"Z Zhou","year":"2017","unstructured":"Zhou Z, Wang Y, Wu QMJ, Yang CN, Sun X (2017) Effective and efficient global context verification for image copy detection. J IEEE Trans Inf Forensics Secur 12(1):48\u201363","journal-title":"J IEEE Trans Inf Forensics Secur"},{"issue":"2","key":"2207_CR73","first-page":"1","volume":"13","author":"Z Zhou","year":"2017","unstructured":"Zhou Z, Wu QMJ, Huang F, Sun X (2017) Fast and accurate near-duplicate image elimination for visual sensor networks. J Distrib Sens Netw 13(2):1\u20131","journal-title":"J Distrib Sens Netw"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-017-2207-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2207-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2207-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T16:29:10Z","timestamp":1570465750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-017-2207-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,7]]},"references-count":73,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["2207"],"URL":"https:\/\/doi.org\/10.1007\/s11227-017-2207-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,7]]}}}