{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:26:51Z","timestamp":1772119611108,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T00:00:00Z","timestamp":1697241600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T00:00:00Z","timestamp":1697241600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais,Brazil"},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10586-023-04159-8","type":"journal-article","created":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T04:02:10Z","timestamp":1697256130000},"page":"3499-3519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Large-scale response-aware online ANN search in dynamic datasets"],"prefix":"10.1007","volume":"27","author":[{"given":"Guilherme","family":"Andrade","sequence":"first","affiliation":[]},{"suffix":"Jr.","given":"Willian","family":"Barreiros","sequence":"additional","affiliation":[]},{"given":"Leonardo","family":"Rocha","sequence":"additional","affiliation":[]},{"given":"Renato","family":"Ferreira","sequence":"additional","affiliation":[]},{"given":"George","family":"Teodoro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,14]]},"reference":[{"key":"4159_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 Comput. Surv. 33, 322\u2013373 (2001). https:\/\/doi.org\/10.1145\/502807.502809","journal-title":"ACM Comput. Surv."},{"key":"4159_CR2","first-page":"291","volume-title":"Content-Based Multimedia Retrieval","author":"F Amato","year":"2015","unstructured":"Amato, F., Greco, L., Persia, F., et al.: Content-Based Multimedia Retrieval, pp. 291\u2013310. Springer International Publishing, Cham (2015)"},{"key":"4159_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-023-15005-9","author":"C Sitaula","year":"2023","unstructured":"Sitaula, C., Shahi, T.B., Marzbanrad, F., et al.: Recent advances in scene image representation and classification. Multimed. Tools Appl. (2023). https:\/\/doi.org\/10.1007\/s11042-023-15005-9","journal-title":"Multimed. Tools Appl."},{"key":"4159_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-023-15139-w","author":"MJA Dujaili","year":"2023","unstructured":"Dujaili, M.J.A.: Survey on facial expressions recognition: databases, features and classification schemes. Multimed. Tools Appl. (2023). https:\/\/doi.org\/10.1007\/s11042-023-15139-w","journal-title":"Multimed. Tools Appl."},{"key":"4159_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-023-15605-5","author":"P Khunsongkiet","year":"2023","unstructured":"Khunsongkiet, P., Bootkrajang, J., Techawut, C.: Low-level feature image retrieval using representative images from minimum spanning tree clustering. Multimed. Tools Appl. (2023). https:\/\/doi.org\/10.1007\/s11042-023-15605-5","journal-title":"Multimed. Tools Appl."},{"key":"4159_CR6","doi-asserted-by":"publisher","unstructured":"Wan, J., Wang, D., Hoi, S.C.H., et\u00a0al.: Deep learning for content-based image retrieval: a comprehensive study. In: Proceedings of the 22Nd ACM International Conference on Multimedia. ACM, New York, NY, USA, MM \u201914, pp. 157\u2013166 (2014). https:\/\/doi.org\/10.1145\/2647868.2654948","DOI":"10.1145\/2647868.2654948"},{"key":"4159_CR7","doi-asserted-by":"publisher","unstructured":"Douze, M., J\u00e9gou, H., Sandhawalia, H., et\u00a0al.: Evaluation of GIST descriptors for web-scale image search. In: Proceedings of the ACM International Conference on Image and Video Retrieval. ACM, New York, NY, USA, CIVR \u201909, pp. 19:1\u201319:8 (2009). https:\/\/doi.org\/10.1145\/1646396.1646421","DOI":"10.1145\/1646396.1646421"},{"issue":"9","key":"4159_CR8","doi-asserted-by":"publisher","first-page":"1704","DOI":"10.1109\/TPAMI.2011.235","volume":"34","author":"H J\u00e9gou","year":"2012","unstructured":"J\u00e9gou, H., Perronnin, F., Douze, M., et al.: Aggregating local image descriptors into compact codes. IEEE Trans. Pattern Anal. Mach. Intell. 34(9), 1704\u20131716 (2012). https:\/\/doi.org\/10.1109\/TPAMI.2011.235","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4159_CR9","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., et al.: Similarity Search: The Metric Space Approach, vol. 32. Springer Science & Business Media, Berlin (2006)"},{"issue":"3","key":"4159_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JH Friedman","year":"1977","unstructured":"Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3(3), 209\u2013226 (1977). https:\/\/doi.org\/10.1145\/355744.355745","journal-title":"ACM Trans. Math. Softw."},{"key":"4159_CR11","doi-asserted-by":"publisher","unstructured":"Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: Proceedings of the 23rd International Conference on Machine learning, ICML \u201906, pp. 97\u2013104 (2006). https:\/\/doi.org\/10.1145\/1143844.1143857","DOI":"10.1145\/1143844.1143857"},{"issue":"11","key":"4159_CR12","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja, M., Lowe, D.G.: Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans. Pattern Anal. Mach. Intell. 36(11), 2227\u20132240 (2014). https:\/\/doi.org\/10.1109\/TPAMI.2014.2321376","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4159_CR13","doi-asserted-by":"publisher","unstructured":"Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of the 24rd International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, VLDB \u201998, pp. 194\u2013205 (1998). https:\/\/doi.org\/10.5555\/645924.671192","DOI":"10.5555\/645924.671192"},{"key":"4159_CR14","doi-asserted-by":"publisher","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of the 25th International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, VLDB \u201999, pp. 518\u2013529 (1999). https:\/\/doi.org\/10.5555\/645925.671516","DOI":"10.5555\/645925.671516"},{"issue":"1","key":"4159_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2010","unstructured":"Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33(1), 117\u2013128 (2010). https:\/\/doi.org\/10.1109\/TPAMI.2010.57","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4159_CR16","doi-asserted-by":"publisher","unstructured":"Andrade, G., Teodoro, G., Ferreira, R.: Scalable and efficient spatial-aware parallelization strategies for multimedia retrieval. In: 32nd IEEE International Symposium on Computer Architecture and High Performance Computing, SBAC-PAD 2020, Porto, Portugal, September 9\u201311, 2020, pp. 124\u2013131. IEEE (2020). https:\/\/doi.org\/10.1109\/SBAC-PAD49847.2020.00027","DOI":"10.1109\/SBAC-PAD49847.2020.00027"},{"key":"4159_CR17","doi-asserted-by":"publisher","first-page":"102992","DOI":"10.1016\/j.parco.2022.102992","volume":"115","author":"G Andrade","year":"2023","unstructured":"Andrade, G., Ferreira, R., Teodoro, G.: Spatial-aware data partition for distributed memory parallelization of ANN search in multimedia retrieval. Parallel Comput. 115, 102992 (2023). https:\/\/doi.org\/10.1016\/j.parco.2022.102992","journal-title":"Parallel Comput."},{"key":"4159_CR18","unstructured":"Stupar, A., Michel, S., Schenkel, R.: RankReduce\u2014processing K-nearest neighbor queries on top of MapReduce. In: Proceedings of the 8th Workshop on Large-Scale Distributed Systems for Information Retrieval (LSDS-IR\u201910), pp. 1\u20136 (2010). http:\/\/ceur-ws.org\/Vol-630\/lsdsir2.pdf"},{"key":"4159_CR19","doi-asserted-by":"publisher","unstructured":"Bahmani, B., Goel, A., Shinde, R.: Efficient distributed locality sensitive hashing. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management (CIKM), pp. 2174\u20132178 (2012). https:\/\/doi.org\/10.1145\/2396761.2398596","DOI":"10.1145\/2396761.2398596"},{"key":"4159_CR20","doi-asserted-by":"publisher","unstructured":"Moise, D., Shestakov, D., Gudmundsson, G., et\u00a0al.: Indexing and searching 100M images with Map-reduce. In: Proceedings of the 3rd ACM Conference on International Conference on Multimedia Retrieval, ICMR \u201913, pp. 17\u201324 (2013). https:\/\/doi.org\/10.1145\/2461466.2461470","DOI":"10.1145\/2461466.2461470"},{"key":"4159_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jpdc.2020.10.001","volume":"148","author":"R Souza","year":"2021","unstructured":"Souza, R., Fernandes, A., Teixeira, T.S.F.X., et al.: Online multimedia retrieval on CPU-GPU platforms with adaptive work partition. J. Parallel Distrib. Comput. 148, 31\u201345 (2021). https:\/\/doi.org\/10.1016\/j.jpdc.2020.10.001","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"4159_CR22","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2020","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2020). https:\/\/doi.org\/10.1109\/TPAMI.2018.2889473","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4159_CR23","unstructured":"Muja, M., Lowe, D.: Fast approximate nearest neighbors with automatic algorithm configuration. In: VISAPP 2009\u2014Proceedings of the 4th International Conference on Computer Vision Theory and Applications, vol. 1, pp. 331\u2013340 (2009)"},{"issue":"21","key":"4159_CR24","doi-asserted-by":"publisher","first-page":"30465","DOI":"10.1007\/s11042-022-12690-w","volume":"81","author":"S Santini","year":"2022","unstructured":"Santini, S.: A meta-indexing method for fast probably approximately correct nearest neighbor searches. Multimed. Tools Appl. 81(21), 30465\u201330491 (2022). https:\/\/doi.org\/10.1007\/s11042-022-12690-w","journal-title":"Multimed. Tools Appl."},{"issue":"2","key":"4159_CR25","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1011343115154","volume":"14","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Marroqu\u00edn, J.L., Navarro, G.: Fixed queries array: a fast and economical data structure for proximity searching. Multimed. Tools Appl. 14(2), 113\u2013135 (2001). https:\/\/doi.org\/10.1023\/A:1011343115154","journal-title":"Multimed. Tools Appl."},{"issue":"3","key":"4159_CR26","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10619-012-7092-4","volume":"30","author":"M Kruli\u0161","year":"2012","unstructured":"Kruli\u0161, M., Skopal, T., Loko\u010d, J., et al.: Combining CPU and GPU architectures for fast similarity search. Distrib. Parallel Databases 30(3), 179\u2013207 (2012). https:\/\/doi.org\/10.1007\/s10619-012-7092-4","journal-title":"Distrib. Parallel Databases"},{"issue":"3","key":"4159_CR27","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s00778-013-0329-7","volume":"23","author":"G Teodoro","year":"2014","unstructured":"Teodoro, G., Valle, E., Mariano, N., et al.: Approximate similarity search for online multimedia services on distributed CPU-GPU platforms. VLDB J. 23(3), 427\u2013448 (2014). https:\/\/doi.org\/10.1007\/s00778-013-0329-7","journal-title":"VLDB J."},{"key":"4159_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.jpdc.2018.11.009","volume":"125","author":"G Andrade","year":"2019","unstructured":"Andrade, G., Fernandes, A., Gomes, J.M., et al.: Large-scale parallel similarity search with product quantization for online multimedia services. J. Parallel Distrib. Comput. 125, 81\u201392 (2019). https:\/\/doi.org\/10.1016\/j.jpdc.2018.11.009","journal-title":"J. Parallel Distrib. Comput."},{"issue":"14","key":"4159_CR29","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.14778\/2556549.2556574","volume":"6","author":"N Sundaram","year":"2013","unstructured":"Sundaram, N., Turmukhametova, A., Satish, N., et al.: Streaming similarity search over one billion tweets using parallel locality-sensitive hashing. Proc. VLDB Endow. 6(14), 1930\u20131941 (2013). https:\/\/doi.org\/10.14778\/2556549.2556574","journal-title":"Proc. VLDB Endow."},{"key":"4159_CR30","unstructured":"Meisburger, N., Shrivastava, A.: Distributed tera-scale similarity search with MPI: provably efficient similarity search over billions without a single distance computation. CoRR abs\/2008.03260 (2020). arXiv:2008.03260"},{"issue":"3","key":"4159_CR31","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1109\/TBDATA.2019.2921572","volume":"7","author":"J Johnson","year":"2021","unstructured":"Johnson, J., Douze, M., J\u00e9gou, H.: Billion-scale similarity search with GPUs. IEEE Trans. Big Data 7(3), 535\u2013547 (2021). https:\/\/doi.org\/10.1109\/TBDATA.2019.2921572","journal-title":"IEEE Trans. Big Data"},{"issue":"1","key":"4159_CR32","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008). https:\/\/doi.org\/10.1145\/1327452.1327492","journal-title":"Commun. ACM"},{"key":"4159_CR33","unstructured":"Forum, M.P.: MPI: a message-passing interface standard. Technical report, USA (1994)"},{"key":"4159_CR34","doi-asserted-by":"publisher","DOI":"10.1145\/3209662","author":"GT Gudmundsson","year":"2018","unstructured":"Gudmundsson, G.T., J\u00f3nsson, B.T., Amsaleg, L., et al.: Prototyping a web-scale multimedia retrieval service using spark. ACM Trans. Multimed. Comput. Commun. Appl. (2018). https:\/\/doi.org\/10.1145\/3209662","journal-title":"ACM Trans. Multimed. Comput. Commun. Appl."},{"key":"4159_CR35","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., et\u00a0al.: Spark: cluster computing with working sets. In: Proceedings of the 2nd USENIX Conference on Hot Topics in Cloud Computing, HotCloud\u201910, p. 10 (2010)"},{"issue":"4","key":"4159_CR36","doi-asserted-by":"publisher","first-page":"850","DOI":"10.14778\/3503585.3503594","volume":"15","author":"I Doshi","year":"2021","unstructured":"Doshi, I., Das, D., Bhutani, A., et al.: LANNS: a web-scale approximate nearest neighbor lookup system. Proc. VLDB Endow. 15(4), 850\u2013858 (2021). https:\/\/doi.org\/10.14778\/3503585.3503594","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"4159_CR37","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1142\/S1793351X1840010X","volume":"12","author":"N Zhu","year":"2018","unstructured":"Zhu, N., Lu, Y., He, W., et al.: Towards update-efficient and parallel-friendly content-based indexing scheme in cloud computing. Int. J. Semant. Comput. 12(2), 191\u2013213 (2018). https:\/\/doi.org\/10.1142\/S1793351X1840010X","journal-title":"Int. J. Semant. Comput."},{"key":"4159_CR38","unstructured":"Singh, A., Subramanya, S.J., Krishnaswamy, R., et\u00a0al.: Freshdiskann: a fast and accurate graph-based ANN index for streaming similarity search. CoRR abs\/2105.09613 (2021). arXiv:2105.09613"},{"key":"4159_CR39","doi-asserted-by":"publisher","unstructured":"Gil-Costa, V., Marin, M.: Load balancing query processing in metric-space similarity search. In: 2012 12th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID 2012), pp. 368\u2013375 (2012). https:\/\/doi.org\/10.1109\/CCGrid.2012.30","DOI":"10.1109\/CCGrid.2012.30"},{"key":"4159_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-023-14825-z","author":"K Yang","year":"2023","unstructured":"Yang, K., Wang, H., Du, M., et al.: An efficient indexing technique for billion-scale nearest neighbor search. Multimed. Tools Appl. (2023). https:\/\/doi.org\/10.1007\/s11042-023-14825-z","journal-title":"Multimed. Tools Appl."},{"key":"4159_CR41","volume-title":"Data Warehousing and Knowledge Discovery","author":"K Kerdprasop","year":"2005","unstructured":"Kerdprasop, K., Kerdprasop, N., Sattayatham, P.: Weighted K-means for density-biased clustering. In: Tjoa, A.M., Trujillo, J. (eds.) Data Warehousing and Knowledge Discovery. Springer, Berlin, Heidelberg (2005)"},{"key":"4159_CR42","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.future.2019.07.047","volume":"101","author":"X Wei","year":"2019","unstructured":"Wei, X., Liu, Y., Wang, X., et al.: A survey on quality-assurance approximate stream processing and applications. Future Gener. Comput. Syst. 101, 1062\u20131080 (2019). https:\/\/doi.org\/10.1016\/j.future.2019.07.047","journal-title":"Future Gener. Comput. Syst."},{"key":"4159_CR43","doi-asserted-by":"crossref","unstructured":"Lev, Y., Luchangco, V., Olszewski, M.: Scalable reader-writer locks. In: Proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, pp. 101\u2013110 (2009)","DOI":"10.1145\/1583991.1584020"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-023-04159-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-023-04159-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-023-04159-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T17:16:54Z","timestamp":1717003014000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-023-04159-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,14]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["4159"],"URL":"https:\/\/doi.org\/10.1007\/s10586-023-04159-8","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3161488\/v1","asserted-by":"object"}]},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,14]]},"assertion":[{"value":"11 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}