{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:39Z","timestamp":1740123879433,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007514","name":"Universit\u00e0 di Pisa","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007514","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Similarity joins are recognized to be among the most used data processing and analysis operations. We introduce a C++-based high-level parallel pattern implemented on top of FastFlow Building Blocks to provide the programmer with ready-to-use similarity join computations. The<jats:italic>SimilarityJoin<\/jats:italic>pattern is implemented according to the MapReduce paradigm enriched with locality sensitive hashing (LSH) to optimize the whole computation. The new parallel pattern can be used with any C++ serializable data structure and executed on shared- and distributed-memory machines. We present experimental validations of the proposed solution considering two different clusters and small and large input datasets to evaluate in-core and out-of-core executions. The performance assessment of the<jats:italic>SimilarityJoin<\/jats:italic>pattern has been conducted by comparing the execution time against the one obtained from the original hand-tuned Hadoop-based implementation of the LSH-based similarity join algorithms as well as a Spark-based version. The experiments show that the<jats:italic>SimilarityJoin<\/jats:italic>pattern: (1) offers a significant performance improvement for small and medium datasets; (2) is competitive also for computations using large input datasets producing out-of-core executions.<\/jats:p>","DOI":"10.1007\/s10766-024-00772-1","type":"journal-article","created":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T18:02:50Z","timestamp":1716487370000},"page":"207-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LSH SimilarityJoin Pattern in FastFlow"],"prefix":"10.1007","volume":"52","author":[{"given":"Nicol\u00f2","family":"Tonci","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Rivault","sequence":"additional","affiliation":[]},{"given":"Mostafa","family":"Bamha","sequence":"additional","affiliation":[]},{"given":"Sophie","family":"Robert","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Limet","sequence":"additional","affiliation":[]},{"given":"Massimo","family":"Torquati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: 22nd International Conference on Data Engineering (2006)","key":"772_CR1","DOI":"10.1109\/ICDE.2006.9"},{"issue":"3","key":"772_CR2","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1109\/TKDE.2002.1000343","volume":"14","author":"D Dey","year":"2002","unstructured":"Dey, D., Sarkar, S., De, P.: A distance-based approach to entity reconciliation in heterogeneous databases. IEEE Trans. Knowl. Data Eng. 14(3), 567\u2013582 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: Proceedings of the 16th International Conference on World Wide Web, pp. 131\u2013140 (2007)","key":"772_CR3","DOI":"10.1145\/1242572.1242591"},{"doi-asserted-by":"crossref","unstructured":"Shang, Y., Li, Z., Qu, W., Xu, Y., Song, Z., Zhou, X.: Scalable collaborative filtering recommendation algorithm with mapreduce. In: 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing, pp. 103\u2013108 (2014)","key":"772_CR4","DOI":"10.1109\/DASC.2014.27"},{"issue":"1","key":"772_CR5","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)","journal-title":"Commun. ACM"},{"issue":"3\u20134","key":"772_CR6","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/s10766-022-00733-6","volume":"50","author":"S Rivault","year":"2022","unstructured":"Rivault, S., Bamha, M., Limet, S., Robert, S.: A scalable similarity join algorithm based on MapReduce and LSH. Int. J. Parallel Prog. 50(3\u20134), 360\u2013380 (2022). https:\/\/doi.org\/10.1007\/s10766-022-00733-6","journal-title":"Int. J. Parallel Prog."},{"unstructured":"Torquati, M.: Harnessing Parallelism in Multi\/Many-Cores with Streams and Parallel Patterns. Ph.D. thesis, University of Pisa (2019)","key":"772_CR7"},{"doi-asserted-by":"publisher","unstructured":"Aldinucci, M., Danelutto, M., Kilpatrick, P., Torquati, M.: Fastflow: high-level and efficient streaming on multi-core. Programming multi-core and many-core computing systems, parallel and distributed computing (2017). https:\/\/doi.org\/10.1002\/9781119332015.ch13","key":"772_CR8","DOI":"10.1002\/9781119332015.ch13"},{"doi-asserted-by":"publisher","unstructured":"Tonci, N., Torquati, M., Mencagli, G., Danelutto, M.: Distributed-memory fastflow building blocks. Int. J. Parall. Program. 51, 1\u201321 (2023). https:\/\/doi.org\/10.1007\/s10766-022-00750-5","key":"772_CR9","DOI":"10.1007\/s10766-022-00750-5"},{"key":"772_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2022.102905","author":"K Iwabuchi","year":"2022","unstructured":"Iwabuchi, K., Youssef, K., Velusamy, K., Gokhale, M., Pearce, R.: Metall: a persistent memory allocator for data-centric analytics. Parallel Comput. (2022). https:\/\/doi.org\/10.1016\/j.parco.2022.102905","journal-title":"Parallel Comput."},{"doi-asserted-by":"publisher","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 604\u2013613 (1998). https:\/\/doi.org\/10.1145\/276698.276876","key":"772_CR11","DOI":"10.1145\/276698.276876"},{"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, pp. 518\u2013529 (1999)","key":"772_CR12"},{"unstructured":"Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: a survey (2014). https:\/\/arxiv.org\/abs\/1408.2927","key":"772_CR13"},{"key":"772_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.procs.2014.05.014","volume":"29","author":"MAH Hassan","year":"2014","unstructured":"Hassan, M.A.H., Bamha, M., Loulergue, F.: Handling data-skew effects in join operations using mapreduce. Procedia Comput. Sci. 29, 145\u2013158 (2014). https:\/\/doi.org\/10.1016\/j.procs.2014.05.014","journal-title":"Procedia Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Rivault, S., Bamha, M., Limet, S., Robert, S.: Towards a scalable set similarity join using mapreduce and lsh. In: Computational Science\u2014ICCS 2022: 22nd International Conference, London, UK, June 21\u201323, 2022, Proceedings, Part I, pp. 569\u2013583. Springer, Berlin (2022). https:\/\/doi.org\/10.1007\/978-3-031-08751-6_41","key":"772_CR15","DOI":"10.1007\/978-3-031-08751-6_41"},{"issue":"6","key":"772_CR16","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1007\/s10766-013-0273-6","volume":"42","author":"M Aldinucci","year":"2014","unstructured":"Aldinucci, M., Campa, S., Danelutto, M., Kilpatrick, P., Torquati, M.: Design patterns percolating to parallel programming framework implementation. Int. J. Parallel Program. 42(6), 1012\u20131031 (2014). https:\/\/doi.org\/10.1007\/s10766-013-0273-6","journal-title":"Int. J. Parallel Program."},{"key":"772_CR17","first-page":"1","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface","author":"F Darema","year":"2001","unstructured":"Darema, F.: The spmd model: past, present and future. In: Cotronis, Y., Dongarra, J. (eds.) Recent Advances in Parallel Virtual Machine and Message Passing Interface, pp. 1\u20131. Springer, Berlin Heidelberg, Berlin, Heidelberg (2001)"},{"doi-asserted-by":"publisher","unstructured":"Aldinucci, M., Danelutto, M., Kilpatrick, P., Meneghin, M., Torquati, M.: An efficient unbounded lock-free queue for multi-core systems. In: Euro-Par 2012 Parallel Processing, pp. 662\u2013673. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-32820-6_65","key":"772_CR18","DOI":"10.1007\/978-3-642-32820-6_65"},{"unstructured":"Grant, W.S., Voorhies, R.: Cereal a C++11 library for serialization (2013)","key":"772_CR19"},{"key":"772_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 5, 75\u201391 (1995)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"772_CR21","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/3231541.3231549","volume":"10","author":"M Werner","year":"2018","unstructured":"Werner, M., Oliver, D.: Acm sigspatial gis cup 2017: range queries under fr\u00e9chet distance. SIGSPATIAL Spec. 10(1), 24\u201327 (2018)","journal-title":"SIGSPATIAL Spec."},{"doi-asserted-by":"crossref","unstructured":"Driemel, A., Har-Peled, S., Wenk, C.: Approximating the fr\u00e9chet distance for realistic curves in near linear time. CoRR abs\/1003.0460 (2010)","key":"772_CR22","DOI":"10.1145\/1810959.1811019"},{"doi-asserted-by":"publisher","unstructured":"Driemel, A., Silvestri, F.: Locality-Sensitive Hashing of Curves. In: B.\u00a0Aronov, M.J. Katz (eds.) 33rd International Symposium on Computational Geometry (SoCG 2017), Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a077, pp. 37:1\u201337:16. Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.37","key":"772_CR23","DOI":"10.4230\/LIPIcs.SoCG.2017.37"},{"key":"772_CR24","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-030-24766-9_19","volume-title":"Algorithms and Data Structures","author":"M Ceccarello","year":"2019","unstructured":"Ceccarello, M., Driemel, A., Silvestri, F.: Fresh: Fr\u00e9chet similarity with hashing. In: Friggstad, Z., Sack, J.R., Salavatipour, M.R. (eds.) Algorithms and Data Structures, pp. 254\u2013268. Springer International Publishing, Cham (2019)"},{"doi-asserted-by":"publisher","unstructured":"Theobald, M., Siddharth, J., Paepcke, A.: Spotsigs: Robust and efficient near duplicate detection in large web collections. In: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (2008). https:\/\/doi.org\/10.1145\/1390334.1390431","key":"772_CR25","DOI":"10.1145\/1390334.1390431"},{"issue":"1","key":"772_CR26","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/2627692.2627706","volume":"43","author":"S Wandelt","year":"2014","unstructured":"Wandelt, S., Deng, D., Gerdjikov, S., Mishra, S., Mitankin, P., Patil, M., Siragusa, E., Tiskin, A., Wang, W., Wang, J., Leser, U.: State-of-the-art in string similarity search and join. SIGMOD Rec. 43(1), 64\u201376 (2014). https:\/\/doi.org\/10.1145\/2627692.2627706","journal-title":"SIGMOD Rec."},{"doi-asserted-by":"publisher","unstructured":"Oprisa, C., Checiches, M., Nandrean, A.: Locality-sensitive hashing optimizations for fast malware clustering. In: 2014 IEEE 10th International Conference on Intelligent Computer Communication and Processing (ICCP), pp. 97\u2013104 (2014). https:\/\/doi.org\/10.1109\/ICCP.2014.6936960","key":"772_CR27","DOI":"10.1109\/ICCP.2014.6936960"},{"unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient exact set-similarity joins. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 918\u2013929 (2006)","key":"772_CR28"},{"issue":"8","key":"772_CR29","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1016\/S0169-7552(97)00031-7","volume":"29","author":"AZ Broder","year":"1997","unstructured":"Broder, A.Z., Glassman, S.C., Manasse, M.S., Zweig, G.: Syntactic clustering of the Web. Comput. Netw. ISDN Syst. 29(8), 1157\u20131166 (1997)","journal-title":"Comput. Netw. ISDN Syst."},{"unstructured":"Shrivastava, A., Li, P.: Densifying one permutation hashing via rotation for fast near neighbor search. In: Proceedings of the 31st International Conference on Machine Learning, pp. 557\u2013565 (2014)","key":"772_CR30"},{"issue":"11","key":"772_CR31","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/2934664","volume":"59","author":"M Zaharia","year":"2016","unstructured":"Zaharia, M., Xin, R.S., Wendell, P., Das, T., Armbrust, M., Dave, A., Meng, X., Rosen, J., Venkataraman, S., Franklin, M.J., et al.: Apache spark: a unified engine for big data processing. Commun. ACM 59(11), 56\u201365 (2016)","journal-title":"Commun. ACM"},{"issue":"10","key":"772_CR32","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.14778\/3231751.3231760","volume":"11","author":"F Fier","year":"2018","unstructured":"Fier, F., Augsten, N., Bouros, P., Leser, U., Freytag, J.C.: Set similarity joins on mapreduce: An experimental survey. Proc. VLDB Endow. 11(10), 1110\u20131122 (2018)","journal-title":"Proc. VLDB Endow."},{"doi-asserted-by":"crossref","unstructured":"Tran, T.T.Q.: Filters based fuzzy big joins. Ph.D. thesis (2020). Th\u00e9se de doctorat dirig\u00e9e par D\u2019Orazio, Laurent et Laurent, Anne Informatique Rennes 1 2020","key":"772_CR33","DOI":"10.1109\/FUZZ48607.2020.9177610"},{"doi-asserted-by":"publisher","unstructured":"Hu, X., Tao, Y., Yi, K.: Output-optimal parallel algorithms for similarity joins. In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 79\u201390. ACM (2017). https:\/\/doi.org\/10.1145\/3034786.3056110","key":"772_CR34","DOI":"10.1145\/3034786.3056110"},{"issue":"2","key":"772_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3311967","volume":"44","author":"X Hu","year":"2019","unstructured":"Hu, X., Yi, K., Tao, Y.: Output-optimal massively parallel algorithms for similarity joins. ACM Trans. Database Syst. 44(2), 1\u201336 (2019)","journal-title":"ACM Trans. Database Syst."},{"unstructured":"Aum\u00fcller, M., Ceccarello, M.: Implementing distributed similarity joins using locality sensitive hashing. p.\u00a013. OpenProceedings.org (2022)","key":"772_CR36"},{"key":"772_CR37","doi-asserted-by":"publisher","DOI":"10.5555\/128874","author":"MI Cole","year":"1989","unstructured":"Cole, M.I.: Algorithmic skeletons: structured management of parallel computation. Pitman Lond. (1989). https:\/\/doi.org\/10.5555\/128874","journal-title":"Pitman Lond."},{"unstructured":"Ciechanowicz, P., Poldner, M., Kuchen, H.: The M\u00fcnster Skeleton library Muesli: a comprehensive overview. In: ERCIS Working Papers\u00a07, University of M\u00fcnster, European Research Center for Information Systems (ERCIS) (2009)","key":"772_CR38"},{"issue":"6","key":"772_CR39","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1007\/s10766-021-00704-3","volume":"49","author":"A Ernstsson","year":"2021","unstructured":"Ernstsson, A., Ahlqvist, J., Zouzoula, S., Kessler, C.: Skepu 3: portable high-level programming of heterogeneous systems and HPC clusters. Int. J. Parallel Prog. 49(6), 846\u2013866 (2021)","journal-title":"Int. J. Parallel Prog."},{"doi-asserted-by":"crossref","unstructured":"Matsuzaki, K., Iwasaki, H., Emoto, K., Hu, Z.: A library of constructive skeletons for sequential style of parallel programming. In: Proceedings of the 1st International Conference on Scalable Information Systems, pp. 13\u2013es (2006)","key":"772_CR40","DOI":"10.1145\/1146847.1146860"},{"issue":"24","key":"772_CR41","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4175","volume":"29","author":"D del Rio Astorga","year":"2017","unstructured":"del Rio Astorga, D., Dolz, M.F., Fern\u00e1ndez, J., Garc\u00eda, J.D.: A generic parallel pattern interface for stream and data processing. Concurr. Comput. Pract. Exp. 29(24), e4175 (2017)","journal-title":"Concurr. Comput. Pract. Exp."},{"doi-asserted-by":"publisher","unstructured":"Steuwer, M., Kegel, P., Gorlatch, S.: Skelcl-a portable skeleton library for high-level GPU programming. In: 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, pp. 1176\u20131182. IEEE (2011). https:\/\/doi.org\/10.1109\/IPDPS.2011.269","key":"772_CR42","DOI":"10.1109\/IPDPS.2011.269"},{"doi-asserted-by":"publisher","unstructured":"Rieger, C., Wrede, F., Kuchen, H.: Musket: A domain-specific language for high-level parallel programming with algorithmic skeletons. In: Proceedings of the 34th ACM\/SIGAPP Symposium on Applied Computing, SAC \u201919, pp. 1534\u20131543. ACM, New York (2019). https:\/\/doi.org\/10.1145\/3297280.3297434","key":"772_CR43","DOI":"10.1145\/3297280.3297434"},{"issue":"01","key":"772_CR44","doi-asserted-by":"publisher","first-page":"1740005","DOI":"10.1142\/S0129626417400059","volume":"27","author":"D Griebler","year":"2017","unstructured":"Griebler, D., Danelutto, M., Torquati, M., Fernandes, L.G.: Spar: a DSL for high-level and productive stream parallelism. Parallel Process. Lett. 27(01), 1740005 (2017). https:\/\/doi.org\/10.1142\/S0129626417400059","journal-title":"Parallel Process. Lett."},{"unstructured":"Archibald, B.: Algorithmic skeletons for exact combinatorial search at scale. Ph.D. thesis, University of Glasgow (2018)","key":"772_CR45"},{"issue":"4","key":"772_CR46","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1177\/1094342014567907","volume":"29","author":"M Aldinucci","year":"2015","unstructured":"Aldinucci, M., Pezzi, G.P., Drocco, M., Spampinato, C., Torquati, M.: Parallel visual data restoration on multi-gpgpus using stencil-reduce pattern. Int. J. High Perform. Comput. Appl. 29(4), 461\u2013472 (2015). https:\/\/doi.org\/10.1177\/1094342014567907","journal-title":"Int. J. High Perform. Comput. Appl."},{"issue":"2","key":"772_CR47","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/s10766-016-0413-x","volume":"45","author":"T De Matteis","year":"2017","unstructured":"De Matteis, T., Mencagli, G.: Parallel patterns for window-based stateful operators on data streams: an algorithmic skeleton approach. Int. J. Parallel Prog. 45(2), 382\u2013401 (2017). https:\/\/doi.org\/10.1007\/s10766-016-0413-x","journal-title":"Int. J. Parallel Prog."},{"key":"772_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2021.102790","volume":"104","author":"C Bellas","year":"2021","unstructured":"Bellas, C., Gounaris, A.: Hyset: a hybrid framework for exact set similarity join using a GPU. Parallel Comput. 104, 102790 (2021)","journal-title":"Parallel Comput."},{"doi-asserted-by":"crossref","unstructured":"Quirino, R.D., Ribeiro-J\u00fanior, S., Ribeiro, L.A., Martins, W.S.: fgssjoin: A gpu-based algorithm for set similarity joins. In: ICEIS (1), pp. 152\u2013161 (2017)","key":"772_CR49","DOI":"10.5220\/0006339001520161"},{"doi-asserted-by":"crossref","unstructured":"Yang, J., Zhang, W., Wang, X., Zhang, Y., Lin, X.: Distributed streaming set similarity join. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 565\u2013576. IEEE (2020)","key":"772_CR50","DOI":"10.1109\/ICDE48307.2020.00055"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-024-00772-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10766-024-00772-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-024-00772-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T21:59:42Z","timestamp":1732053582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10766-024-00772-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,23]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["772"],"URL":"https:\/\/doi.org\/10.1007\/s10766-024-00772-1","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2024,5,23]]},"assertion":[{"value":"26 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2024","order":3,"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 competing interests as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}