{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:17:39Z","timestamp":1767140259080,"version":"build-2238731810"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T00:00:00Z","timestamp":1614038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T00:00:00Z","timestamp":1614038400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s00778-020-00644-3","type":"journal-article","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T22:02:48Z","timestamp":1614031368000},"page":"447-470","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Internal and external memory set containment join"],"prefix":"10.1007","volume":"30","author":[{"given":"Chengcheng","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4596-3850","authenticated-orcid":false,"given":"Dong","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Shuo","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Fan","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Li","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ling","family":"Shao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,23]]},"reference":[{"key":"644_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, M., Manchanda, K., Soni, R., Lal, A., Chowdary, C.R.: Parallel implementation of local similarity search for unstructured text using prefix filtering. In: International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 98\u2013103 (2017)","DOI":"10.1109\/PDCAT.2017.00025"},{"key":"644_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, P., Arasu, A., Kaushik, R.: On indexing error-tolerant set containment. In: SIGMOD, pp. 927\u2013938 (2010)","DOI":"10.1145\/1807167.1807267"},{"key":"644_CR3","doi-asserted-by":"crossref","unstructured":"Baraglia, R., Morales, G.D.F., Lucchese, C.: Document similarity self-join with mapreduce. In: ICDM, pp. 731\u2013736 (2010)","DOI":"10.1109\/ICDM.2010.70"},{"key":"644_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.P: Scaling up all pairs similarity search. In: WWW, pp. 131\u2013140 (2007)","DOI":"10.1145\/1242572.1242591"},{"issue":"1","key":"644_CR5","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10115-015-0895-7","volume":"49","author":"P Bouros","year":"2016","unstructured":"Bouros, P., Mamoulis, N., Ge, S., Terrovitis, M.: Set containment join revisited. Knowl. Inf. Syst. 49(1), 375\u2013402 (2016)","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"644_CR6","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/1629175.1629198","volume":"53","author":"J Dean","year":"2010","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: a flexible data processing tool. Commun. ACM 53(1), 72\u201377 (2010)","journal-title":"Commun. ACM"},{"issue":"10","key":"644_CR7","first-page":"1082","volume":"10","author":"D Deng","year":"2017","unstructured":"Deng, D., Kim, A., Madden, S., Stonebraker, M.: Silkmoth: an efficient method for finding related sets with maximum matching constraints. PVLDB 10(10), 1082\u20131093 (2017)","journal-title":"PVLDB"},{"key":"644_CR8","doi-asserted-by":"crossref","unstructured":"Deng, D., Li, G., Hao, S., Wang, J., Feng, J.: Massjoin: a mapreduce-based method for scalable string similarity joins. In: ICDE, pp. 340\u2013351 (2014)","DOI":"10.1109\/ICDE.2014.6816663"},{"issue":"4","key":"644_CR9","first-page":"360","volume":"9","author":"D Deng","year":"2015","unstructured":"Deng, D., Li, G., Wen, H., Feng, J.: An efficient partition based method for exact set similarity joins. PVLDB 9(4), 360\u2013371 (2015)","journal-title":"PVLDB"},{"key":"644_CR10","doi-asserted-by":"crossref","unstructured":"Deng, D., Tao, Y., Li, G.: Overlap set similarity joins with theoretical guarantees. In: SIGMOD, pp. 905\u2013920 (2018)","DOI":"10.1145\/3183713.3183748"},{"key":"644_CR11","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ins.2019.03.035","volume":"493","author":"X Ding","year":"2019","unstructured":"Ding, X., Yang, W., Choo, K.R., Wang, X., Jin, H.: Privacy preserving similarity joins using mapreduce. Inf. Sci. 493, 20\u201333 (2019)","journal-title":"Inf. Sci."},{"key":"644_CR12","doi-asserted-by":"crossref","unstructured":"do\u00a0Carmo\u00a0Oliveira, D.J., Borges, F.F., Ribeiro, L.A., Cuzzocrea, A.: Set similarity joins with complex expressions on distributed platforms. In: ADBIS, pp. 216\u2013230 (2018)","DOI":"10.1007\/978-3-319-98398-1_15"},{"key":"644_CR13","doi-asserted-by":"crossref","unstructured":"Elsayed, T., Lin, J.J., Oard, D.W.: Pairwise document similarity in large collections with mapreduce. In: ACL, pp. 265\u2013268 (2008)","DOI":"10.3115\/1557690.1557767"},{"issue":"10","key":"644_CR14","first-page":"1110","volume":"11","author":"F Fier","year":"2018","unstructured":"Fier, F., Augsten, N., Bouros, P., Leser, U., Freytag, J.: Set similarity joins on mapreduce: an experimental survey. PVLDB 11(10), 1110\u20131122 (2018)","journal-title":"PVLDB"},{"issue":"1","key":"644_CR15","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s11227-018-2578-0","volume":"75","author":"E Gavagsaz","year":"2019","unstructured":"Gavagsaz, E., Rezaee, A., Javadi, H.H.S.: Load balancing in join algorithms for skewed data in mapreduce systems. J. Supercomput. 75(1), 228\u2013254 (2019)","journal-title":"J. Supercomput."},{"key":"644_CR16","unstructured":"Helmer, S., Moerkotte, G.: Evaluation of main memory join algorithms for joins with set comparison join predicates. In: VLDB, pp. 386\u2013395 (1997)"},{"issue":"3","key":"644_CR17","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/s00778-003-0106-0","volume":"12","author":"S Helmer","year":"2003","unstructured":"Helmer, S., Moerkotte, G.: A performance study of four index structures for set-valued attributes of low cardinality. VLDB J. 12(3), 244\u2013261 (2003)","journal-title":"VLDB J."},{"key":"644_CR18","doi-asserted-by":"crossref","unstructured":"Ibrahim, A., Fletcher, G.H.L.: Efficient processing of containment queries on nested sets. In: EDBT, pp. 227\u2013238 (2013)","DOI":"10.1145\/2452376.2452404"},{"key":"644_CR19","doi-asserted-by":"crossref","unstructured":"Jampani, R., Pudi, V.: Using prefix-trees for efficiently computing set joins. In: DASFAA, pp. 761\u2013772 (2005)","DOI":"10.1007\/11408079_69"},{"issue":"8","key":"644_CR20","first-page":"625","volume":"7","author":"Y Jiang","year":"2014","unstructured":"Jiang, Y., Li, G., Feng, J., Li, W.: String similarity joins: an experimental evaluation. PVLDB 7(8), 625\u2013636 (2014)","journal-title":"PVLDB"},{"key":"644_CR21","doi-asserted-by":"crossref","unstructured":"Kunkel, A., Rheinl\u00e4nder, A., Schiefer, C., Helmer, S., Bouros, P., Leser, U.: Piejoin: towards parallel set containment joins. In: SSDBM, pp. 11:1\u201311:12 (2016)","DOI":"10.1145\/2949689.2949694"},{"key":"644_CR22","doi-asserted-by":"crossref","unstructured":"Li, C., Lu, J., Lu, Y.: Efficient merging and filtering algorithms for approximate string searches. In: ICDE, pp. 257\u2013266 (2008)","DOI":"10.1109\/ICDE.2008.4497434"},{"issue":"2","key":"644_CR23","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2487259.2487261","volume":"38","author":"G Li","year":"2013","unstructured":"Li, G., Deng, D., Feng, J.P.: A partition-based method for string similarity joins with edit-distance constraints. ACM Trans. Database Syst. 38(2), 9:1\u20139:33 (2013)","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"644_CR24","first-page":"253","volume":"5","author":"G Li","year":"2011","unstructured":"Li, G., Deng, D., Wang, J., Feng, J.: PASS-JOIN: a partition-based method for similarity joins. PVLDB 5(3), 253\u2013264 (2011)","journal-title":"PVLDB"},{"key":"644_CR25","doi-asserted-by":"crossref","unstructured":"Li, R., Ju, L., Peng, Z., Yu, Z., Wang, C.: Batch text similarity search with mapreduce. In: 13th Asia-Pacific Web Conference, pp. 412\u2013423 (2011)","DOI":"10.1007\/978-3-642-20291-9_46"},{"issue":"3","key":"644_CR26","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1007\/s11227-016-1651-9","volume":"72","author":"W Liu","year":"2016","unstructured":"Liu, W., Shen, Y., Wang, P.: An efficient mapreduce algorithm for similarity join in metric spaces. J. Supercomput. 72(3), 1179\u20131200 (2016)","journal-title":"J. Supercomput."},{"key":"644_CR27","doi-asserted-by":"crossref","unstructured":"Luo, Y., Fletcher, G.H.L., Hidders, J., Bra, P.D.: Efficient and scalable trie-based algorithms for computing set containment relations. In: ICDE, pp. 303\u2013314 (2015)","DOI":"10.1109\/ICDE.2015.7113293"},{"key":"644_CR28","doi-asserted-by":"crossref","unstructured":"Mamoulis, N.: Efficient processing of joins on set-valued attributes. In SIGMOD, pp. 157\u2013168 (2003)","DOI":"10.1145\/872757.872778"},{"issue":"9","key":"644_CR29","first-page":"636","volume":"9","author":"W Mann","year":"2016","unstructured":"Mann, W., Augsten, N., Bouros, P.: An empirical evaluation of set similarity join techniques. PVLDB 9(9), 636\u2013647 (2016)","journal-title":"PVLDB"},{"key":"644_CR30","doi-asserted-by":"crossref","unstructured":"Melnik, S., Garcia-Molina, H.: Divide-and-conquer algorithm for computing set containment joins. In: EDBT, pp. 427\u2013444 (2002)","DOI":"10.1007\/3-540-45876-X_28"},{"key":"644_CR31","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/762471.762474","volume":"28","author":"S Melnik","year":"2003","unstructured":"Melnik, S., Garcia-Molina, H.: Adaptive algorithms for set containment joins. ACM Trans. Database Syst. 28, 56\u201399 (2003)","journal-title":"ACM Trans. Database Syst."},{"issue":"8","key":"644_CR32","first-page":"704","volume":"5","author":"A Metwally","year":"2012","unstructured":"Metwally, A., Faloutsos, C.: V-smart-join: a scalable mapreduce framework for all-pair similarity joins of multisets and vectors. PVLDB 5(8), 704\u2013715 (2012)","journal-title":"PVLDB"},{"key":"644_CR33","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/00107510500052444","volume":"46","author":"MEJ Newman","year":"2005","unstructured":"Newman, M.E.J.: Power laws, Pareto distributions and Zipf\u2019s law. Contemp. Phys. 46, 323\u2013351 (2005)","journal-title":"Contemp. Phys."},{"issue":"1","key":"644_CR34","first-page":"28","volume":"12","author":"J Qin","year":"2018","unstructured":"Qin, J., Xiao, C.: Pigeonring: a principle for faster thresholded similarity search. PVLDB 12(1), 28\u201342 (2018)","journal-title":"PVLDB"},{"key":"644_CR35","unstructured":"Ramasamy, K., Patel, J.M., Naughton, J.F., Kaushik, R.P: Set containment joins: the good, the bad and the ugly. In: VLDB, pp. 351\u2013362 (2000)"},{"issue":"12","key":"644_CR36","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1109\/PROC.1979.11543","volume":"67","author":"C Roberts","year":"1979","unstructured":"Roberts, C.: Partial-match retrieval via the method of superimposed codes. Proc. IEEE 67(12), 1624\u20131642 (1979)","journal-title":"Proc. IEEE"},{"key":"644_CR37","doi-asserted-by":"crossref","unstructured":"Rong, C., Lin, C., Silva, Y.N., Wang, J., Lu, W., Du, X.: Fast and scalable distributed set similarity joins for big data analytics. In: ICDE, pp. 1059\u20131070 (2017)","DOI":"10.1109\/ICDE.2017.151"},{"issue":"10","key":"644_CR38","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1109\/TKDE.2012.195","volume":"25","author":"C Rong","year":"2013","unstructured":"Rong, C., Lu, W., Wang, X., Du, X., Chen, Y., Tung, A.K.H.: Efficient and scalable processing of string similarity join. IEEE Trans. Knowl. Data Eng. 25(10), 2217\u20132230 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"12","key":"644_CR39","first-page":"1059","volume":"7","author":"AD Sarma","year":"2014","unstructured":"Sarma, A.D., He, Y., Chaudhuri, S.: Clusterjoin: a similarity joins framework using map-reduce. PVLDB 7(12), 1059\u20131070 (2014)","journal-title":"PVLDB"},{"key":"644_CR40","doi-asserted-by":"crossref","unstructured":"Silva, Y.N., Reed, J.M.: Exploiting mapreduce-based similarity joins. In: SIGMOD, pp. 693\u2013696 (2012)","DOI":"10.1145\/2213836.2213935"},{"issue":"9","key":"644_CR41","first-page":"961","volume":"12","author":"J Sun","year":"2019","unstructured":"Sun, J., Shang, Z., Li, G., Bao, Z., Deng, D.: Balance-aware distributed string similarity-based query processing system. PVLDB 12(9), 961\u2013974 (2019)","journal-title":"PVLDB"},{"issue":"12","key":"644_CR42","first-page":"1925","volume":"10","author":"J Sun","year":"2017","unstructured":"Sun, J., Shang, Z., Li, G., Deng, D., Bao, Z.: Dima: a distributed in-memory similarity-based query processing system. PVLDB 10(12), 1925\u20131928 (2017)","journal-title":"PVLDB"},{"key":"644_CR43","doi-asserted-by":"crossref","unstructured":"Terrovitis, M., Bouros, P., Vassiliadis, P., Sellis, T.K., Mamoulis, N.: Efficient answering of set containment queries for skewed item distributions. In: EDBT, pp. 225\u2013236 (2011)","DOI":"10.1145\/1951365.1951394"},{"issue":"10","key":"644_CR44","first-page":"944","volume":"5","author":"M Terrovitis","year":"2012","unstructured":"Terrovitis, M., Liagouris, J., Mamoulis, N., Skiadopoulos, S.: Privacy preservation by disassociation. PVLDB 5(10), 944\u2013955 (2012)","journal-title":"PVLDB"},{"issue":"1","key":"644_CR45","first-page":"115","volume":"1","author":"M Terrovitis","year":"2008","unstructured":"Terrovitis, M., Mamoulis, N., Kalnis, P.: Privacy-preserving anonymization of set-valued data. PVLDB 1(1), 115\u2013125 (2008)","journal-title":"PVLDB"},{"issue":"1","key":"644_CR46","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s00778-010-0192-8","volume":"20","author":"M Terrovitis","year":"2011","unstructured":"Terrovitis, M., Mamoulis, N., Kalnis, P.: Local and global recoding methods for anonymizing set-valued data. VLDB J. 20(1), 83\u2013106 (2011)","journal-title":"VLDB J."},{"key":"644_CR47","doi-asserted-by":"crossref","unstructured":"Terrovitis, M., Passas, S., Vassiliadis, P., Sellis, T.K.: A combination of trie-trees and inverted files for the indexing of set-valued attributes. In: CIKM, pp. 728\u2013737 (2006)","DOI":"10.1145\/1183614.1183718"},{"key":"644_CR48","doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using mapreduce. In: SIGMOD, pp. 495\u2013506 (2010)","DOI":"10.1145\/1807167.1807222"},{"issue":"1","key":"644_CR49","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 Record 43(1), 64\u201376 (2014)","journal-title":"SIGMOD Record"},{"key":"644_CR50","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, G., Feng, J.: Can we beat the prefix filtering?: An adaptive framework for similarity join and search. In: SIGMOD, pp. 85\u201396 (2012)","DOI":"10.1145\/2213836.2213847"},{"issue":"2","key":"644_CR51","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00354-008-0081-5","volume":"28","author":"L Wang","year":"2010","unstructured":"Wang, L., von Laszewski, G., Younge, A.J., He, X., Kunze, M., Tao, J., Fu, C.: Cloud computing: a perspective study. New Gener. Comput. 28(2), 137\u2013146 (2010)","journal-title":"New Gener. Comput."},{"key":"644_CR52","doi-asserted-by":"crossref","unstructured":"Wang, P., Xiao, C., Qin, J., Wang, W., Zhang, X., Ishikawa, Y.: Local similarity search for unstructured text. In: SIGMOD, pp. 1991\u20132005 (2016)","DOI":"10.1145\/2882903.2915211"},{"issue":"9","key":"644_CR53","first-page":"925","volume":"10","author":"X Wang","year":"2017","unstructured":"Wang, X., Qin, L., Lin, X., Zhang, Y., Chang, L.: Leveraging set relations in exact set similarity join. PVLDB 10(9), 925\u2013936 (2017)","journal-title":"PVLDB"},{"issue":"2","key":"644_CR54","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00778-018-0529-2","volume":"28","author":"X Wang","year":"2019","unstructured":"Wang, X., Qin, L., Lin, X., Zhang, Y., Chang, L.: Leveraging set relations in exact and dynamic set similarity join. VLDB J. 28(2), 267\u2013292 (2019)","journal-title":"VLDB J."},{"issue":"1","key":"644_CR55","first-page":"933","volume":"1","author":"C Xiao","year":"2008","unstructured":"Xiao, C., Wang, W., Lin, X.: Ed-join: an efficient algorithm for similarity joins with edit distance constraints. PVLDB 1(1), 933\u2013944 (2008)","journal-title":"PVLDB"},{"key":"644_CR56","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Shang, H.: Top-k set similarity joins. In: ICDE, pp. 916\u2013927 (2009)","DOI":"10.1109\/ICDE.2009.111"},{"key":"644_CR57","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: WWW, pp. 131\u2013140 (2008)","DOI":"10.1145\/1367497.1367516"},{"key":"644_CR58","doi-asserted-by":"crossref","unstructured":"Yang, J., Zhang, W., Yang, S., Zhang, Y., Lin, X.: Tt-join: efficient set containment join. In: ICDE, pp. 509\u2013520 (2017)","DOI":"10.1109\/ICDE.2017.107"},{"issue":"4","key":"644_CR59","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s00778-018-0505-x","volume":"27","author":"J Yang","year":"2018","unstructured":"Yang, J., Zhang, W., Yang, S., Zhang, Y., Lin, X., Yuan, L.: Efficient set containment join. VLDB J. 27(4), 471\u2013495 (2018)","journal-title":"VLDB J."},{"key":"644_CR60","doi-asserted-by":"crossref","unstructured":"Yang, Y., Zhang, W., Zhang, Y., Lin, X., Wang, L.: Selectivity estimation on set containment search. In: DASFAA, pp. 330\u2013349 (2019)","DOI":"10.1007\/978-3-030-18576-3_20"},{"issue":"3","key":"644_CR61","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s11704-015-5900-5","volume":"10","author":"M Yu","year":"2016","unstructured":"Yu, M., Li, G., Deng, D., Feng, J.: String similarity search and join: a survey. Front. Comput. Sci. 10(3), 399\u2013417 (2016)","journal-title":"Front. Comput. Sci."},{"issue":"11","key":"644_CR62","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., Ghodsi, A., Gonzalez, J., Shenker, S., Stoica, I.: Apache spark: a unified engine for big data processing. Commun. ACM 59(11), 56\u201365 (2016)","journal-title":"Commun. ACM"}],"updated-by":[{"DOI":"10.1007\/s00778-021-00662-9","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,4,2]],"date-time":"2021-04-02T00:00:00Z","timestamp":1617321600000}}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-020-00644-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-020-00644-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-020-00644-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T17:15:26Z","timestamp":1627665326000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-020-00644-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,23]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["644"],"URL":"https:\/\/doi.org\/10.1007\/s00778-020-00644-3","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,23]]},"assertion":[{"value":"31 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2021","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s00778-021-00662-9","URL":"https:\/\/doi.org\/10.1007\/s00778-021-00662-9","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}