{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T04:20:11Z","timestamp":1728015611527},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T00:00:00Z","timestamp":1662681600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T00:00:00Z","timestamp":1662681600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s11280-022-01098-z","type":"journal-article","created":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T11:06:13Z","timestamp":1662721573000},"page":"1395-1433","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Chunk-oriented dimension ordering for efficient range query processing on sparse multidimensional data"],"prefix":"10.1007","volume":"26","author":[{"given":"Shuai","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianmin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,9]]},"reference":[{"key":"1098_CR1","doi-asserted-by":"crossref","unstructured":"Zhao, W., Rusu, F., Dong, B., Wu, K., Nugent, P.: Incremental view maintenance over array data. In: SIGMOD, pp. 139\u2013154 (2017)","DOI":"10.1145\/3035918.3064041"},{"key":"1098_CR2","doi-asserted-by":"crossref","unstructured":"Xing, H., Agrawal, G.: Accelerating array joining with integrated value-index. In: SSDBM, pp. 145\u2013156 (2019)","DOI":"10.1145\/3335783.3335790"},{"issue":"9","key":"1098_CR3","first-page":"989","volume":"12","author":"D Choi","year":"2019","unstructured":"Choi, D., Park, C.-S., Chung, Y.D.: Progressive top-k subarray query processing in array databases. PVLDB 12(9), 989\u20131001 (2019)","journal-title":"PVLDB"},{"issue":"12","key":"1098_CR4","first-page":"2909","volume":"13","author":"RA Rodriges Zalipynis","year":"2020","unstructured":"Rodriges Zalipynis, R.A.: Bitfun: fast answers to queries with tunable functions in geospatial array dbms. PVLDB 13(12), 2909\u20132912 (2020)","journal-title":"PVLDB"},{"key":"1098_CR5","doi-asserted-by":"crossref","unstructured":"Baunsgaard, S., Boehm, M., Chaudhary, A., Derakhshan, B., Gei\u00dfels\u00f6der, S., Grulich, P.M., Hildebrand, M., Innerebner, K., Markl, V., Neubauer, C., et al.: Exdra: Exploratory data science on federated raw data. In: SIGMOD, pp. 2450\u20132463 (2021)","DOI":"10.1145\/3448016.3457549"},{"key":"1098_CR6","doi-asserted-by":"crossref","unstructured":"Guo, X., Li, T., Li, X., Zhao, H., Wang, S., Pang, C.: An efficient multidimensional $$l_{\\infty }$$ wavelet method and its application to approximate query processing. World Wide Web 24(1), 105\u2013133 (2021)","DOI":"10.1007\/s11280-020-00834-7"},{"key":"1098_CR7","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.ins.2021.08.100","volume":"580","author":"X Song","year":"2021","unstructured":"Song, X., Li, J., Tang, Y., Zhao, T., Chen, Y., Guan, Z.: Jkt: a joint graph convolutional network based deep knowledge tracing. Inform. Sci. 580, 510\u2013523 (2021)","journal-title":"Inform. Sci."},{"key":"1098_CR8","doi-asserted-by":"publisher","first-page":"108274","DOI":"10.1016\/j.knosys.2022.108274","volume":"241","author":"X Song","year":"2022","unstructured":"Song, X., Li, J., Lei, Q., Zhao, W., Chen, Y., Mian, A.: Bi-clkt: Bi-graph contrastive learning based knowledge tracing. Knowl.-Based Syst. 241, 108274 (2022)","journal-title":"Knowl.-Based Syst."},{"key":"1098_CR9","doi-asserted-by":"publisher","first-page":"100219","DOI":"10.1016\/j.array.2022.100219","volume":"15","author":"S Mitra","year":"2022","unstructured":"Mitra, S., Banerjee, S., Naskar, M.K.: Remodelling correlation: a fault resilient technique of correlation sensitive stochastic designs. Array 15, 100219 (2022)","journal-title":"Array"},{"issue":"6","key":"1098_CR10","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1007\/s11280-017-0444-2","volume":"20","author":"X Fu","year":"2017","unstructured":"Fu, X., Miao, X., Xu, J., Gao, Y.: Continuous range-based skyline queries in road networks. World Wide Web 20(6), 1443\u20131467 (2017)","journal-title":"World Wide Web"},{"issue":"3","key":"1098_CR11","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1007\/s11280-022-01038-x","volume":"25","author":"H Yin","year":"2022","unstructured":"Yin, H., Gao, H., Wang, B., Li, S., Li, J.: Efficient trajectory compression and range query processing. World Wide Web 25(3), 1259\u20131285 (2022)","journal-title":"World Wide Web"},{"key":"1098_CR12","doi-asserted-by":"crossref","unstructured":"Haldar, N.A.H., Li, J., Ali, M.E., Cai, T., Chen, Y., Sellis, T., Reynolds, M.: Top-k socio-spatial co-engaged location selection for social users. TKDE (2022)","DOI":"10.1109\/TKDE.2022.3151095"},{"issue":"3","key":"1098_CR13","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s11280-013-0265-x","volume":"18","author":"W Zhou","year":"2015","unstructured":"Zhou, W., Zhang, H.: Correlation range query for effective recommendations. World Wide Web 18(3), 709\u2013729 (2015)","journal-title":"World Wide Web"},{"issue":"7","key":"1098_CR14","doi-asserted-by":"publisher","first-page":"773","DOI":"10.14778\/3192965.3192969","volume":"11","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Meliou, A., Miklau, G.: Rc-index: Diversifying answers to range queries. Proceedings of the VLDB Endowment 11(7), 773\u2013786 (2018)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"1098_CR15","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s11280-019-00726-5","volume":"23","author":"N Cui","year":"2020","unstructured":"Cui, N., Yang, X., Wang, B., Geng, J., Li, J.: Secure range query over encrypted data in outsourced environments. World Wide Web 23(1), 491\u2013517 (2020)","journal-title":"World Wide Web"},{"issue":"12","key":"1098_CR16","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.14778\/2824032.2824038","volume":"8","author":"P Nagarkar","year":"2015","unstructured":"Nagarkar, P., Candan, K.S., Bhat, A.: Compressed spatial hierarchical bitmap (cshb) indexes for efficiently processing spatial range query workloads. Proceedings of the VLDB Endowment 8(12), 1382\u20131393 (2015)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"1098_CR17","doi-asserted-by":"crossref","unstructured":"Zhao, W., Rusu, F., Dong, B., Wu, K.: Similarity join over array data. In: SIGMOD, pp. 2007\u20132022 (2016)","DOI":"10.1145\/2882903.2915247"},{"key":"1098_CR18","unstructured":"Sarawagi, S., Stonebraker, M.: Efficient organization of large multidimensional arrays. In: ICDE, pp 328\u2013336. IEEE (1994)"},{"key":"1098_CR19","doi-asserted-by":"crossref","unstructured":"Abadi, D., Madden, S., Ferreira, M.: Integrating compression and execution in column-oriented database systems. In: SIGMOD, pp. 671\u2013682 (2006)","DOI":"10.1145\/1142473.1142548"},{"key":"1098_CR20","doi-asserted-by":"crossref","unstructured":"Bian, H., Yan, Y., Tao, W., Chen, L.J., Chen, Y., Du, X., Moscibroda, T.: Wide table layout optimization based on column ordering and duplication. In: SIGMOD, pp. 299\u2013314 (2017)","DOI":"10.1145\/3035918.3035930"},{"issue":"1","key":"1098_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s007780200062","volume":"11","author":"AP Marathe","year":"2002","unstructured":"Marathe, A.P., Salem, K.: Query processing techniques for arrays. VLDBJ 11(1), 68\u201391 (2002)","journal-title":"VLDBJ"},{"issue":"4","key":"1098_CR22","first-page":"349","volume":"10","author":"S Papadopoulos","year":"2016","unstructured":"Papadopoulos, S., Datta, K., Madden, S., Mattson, T.: The tiledb array data storage manager. PVLDB 10(4), 349\u2013360 (2016)","journal-title":"PVLDB"},{"issue":"10","key":"1098_CR23","first-page":"1247","volume":"11","author":"RA Rodriges Zalipynis","year":"2018","unstructured":"Rodriges Zalipynis, R.A.: Chronosdb: distributed, file based, geospatial array dbms. PVLDB 11(10), 1247\u20131261 (2018)","journal-title":"PVLDB"},{"key":"1098_CR24","doi-asserted-by":"crossref","unstructured":"Baumann, P., Dehmel, A., Furtado, P., Ritsch, R., Widmann, N.: The multidimensional database system rasdaman. In: SIGMOD, pp. 575\u2013577 (1998)","DOI":"10.1145\/276305.276386"},{"key":"1098_CR25","doi-asserted-by":"crossref","unstructured":"Van Ballegooij, A.R.: Ram: a multidimensional array dbms. In: EDBT, pp 154\u2013165. Springer (2004)","DOI":"10.1007\/978-3-540-30192-9_15"},{"issue":"1","key":"1098_CR26","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00778-007-0071-0","volume":"17","author":"R Cornacchia","year":"2008","unstructured":"Cornacchia, R., H\u00e9man, S., Zukowski, M., de Vries, A.P., Boncz, P.: Flexible and efficient ir using array databases. VLDBJ 17(1), 151\u2013168 (2008)","journal-title":"VLDBJ"},{"key":"1098_CR27","doi-asserted-by":"crossref","unstructured":"Brown, P.G.: Overview of scidb: large scale array storage, processing and analysis. In: SIGMOD, pp 963\u2013968. ACM (2010)","DOI":"10.1145\/1807167.1807271"},{"key":"1098_CR28","doi-asserted-by":"crossref","unstructured":"Stonebraker, M., Brown, P., Poliakov, A., Raman, S.: The architecture of Scidb. In: SSDBM, pp. 1\u201316 (2011)","DOI":"10.1007\/978-3-642-22351-8_1"},{"key":"1098_CR29","doi-asserted-by":"crossref","unstructured":"Soroush, E., Balazinska, M., Wang, D.: Arraystore: A storage manager for complex parallel array processing. In: SIGMOD, pp. 253\u2013264 (2011)","DOI":"10.1145\/1989323.1989351"},{"issue":"9","key":"1098_CR30","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"1098_CR31","doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: The Kdb-Tree: A search structure for large multidimensional dynamic indexes. In: SIGMOD, pp. 10\u201318 (1981)","DOI":"10.1145\/582318.582321"},{"issue":"2","key":"1098_CR32","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H Samet","year":"1984","unstructured":"Samet, H.: The quadtree and related hierarchical data structures. ACM Computing Surveys (CSUR) 16(2), 187\u2013260 (1984)","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"1","key":"1098_CR33","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: An adaptable, symmetric multikey file structure. TODS 9(1), 38\u201371 (1984)","journal-title":"TODS"},{"key":"1098_CR34","unstructured":"Weber, R., Schek, H.-J., Blott, S.: A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In: VLDB, vol. 98, pp. 194\u2013205 (1998)"},{"key":"1098_CR35","unstructured":"Ramsak, F., Markl, V., Fenk, R., Zirkel, M., Elhardt, K., Bayer, R.: Integrating the ub-tree into a database system kernel. In: VLDB, vol. 2000, pp 263\u2013272. Citeseer (2000)"},{"key":"1098_CR36","doi-asserted-by":"crossref","unstructured":"Qian, G., Zhu, Q., Xue, Q., Pramanik, S.: The nd-tree: a dynamic indexing technique for multidimensional non-ordered discrete data spaces. In: Proceedings 2003 VLDB Conference, pp 620\u2013631. Elsevier (2003)","DOI":"10.1016\/B978-012722442-8\/50061-6"},{"issue":"1","key":"1098_CR37","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/1125857.1125860","volume":"24","author":"G Qian","year":"2006","unstructured":"Qian, G., Zhu, Q., Xue, Q., Pramanik, S.: A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces. TOIS 24 (1), 79\u2013110 (2006)","journal-title":"TOIS"},{"key":"1098_CR38","doi-asserted-by":"crossref","unstructured":"Chen, C., Pramanik, S., Zhu, Q., Alok, W., Qian, G.: The C-Nd Tree: A multidimensional index for hybrid continuous and non-ordered discrete data spaces. In: EDBT, pp. 462\u2013471 (2009)","DOI":"10.1145\/1516360.1516414"},{"key":"1098_CR39","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A dynamic index structure for spatial searching. In: SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"1098_CR40","doi-asserted-by":"crossref","unstructured":"Antoshenkov, G.: Byte-aligned bitmap compression. In: DCC, p 476. IEEE (1995)","DOI":"10.1109\/DCC.1995.515586"},{"issue":"1","key":"1098_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1132863.1132864","volume":"31","author":"K Wu","year":"2006","unstructured":"Wu, K., Otoo, E.J., Shoshani, A.: Optimizing bitmap indices with efficient compression. TODS 31(1), 1\u201338 (2006)","journal-title":"TODS"},{"issue":"1","key":"1098_CR42","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.datak.2009.08.006","volume":"69","author":"D Lemire","year":"2010","unstructured":"Lemire, D., Kaser, O., Aouiche, K.: Sorting improves word-aligned bitmap indexes. DKE 69(1), 3\u201328 (2010)","journal-title":"DKE"},{"issue":"16","key":"1098_CR43","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.ipl.2010.05.018","volume":"110","author":"A Colantonio","year":"2010","unstructured":"Colantonio, A., Di Pietro, R.: Concise: Compressed ncomposable integer set. IPL (Information Processing Letters) 110(16), 644\u2013650 (2010)","journal-title":"IPL (Information Processing Letters)"},{"key":"1098_CR44","doi-asserted-by":"crossref","unstructured":"Guzun, G., Canahuate, G., Chiu, D., Sawin, J.: A tunable compression framework for bitmap indices. In: ICDE, pp 484\u2013495. IEEE (2014)","DOI":"10.1109\/ICDE.2014.6816675"},{"issue":"5","key":"1098_CR45","first-page":"709","volume":"46","author":"S Chambi","year":"2016","unstructured":"Chambi, S., Lemire, D., Kaser, O., Godin, R.: Better bitmap performance with roaring bitmaps. Software: Practice and Experience 46(5), 709\u2013719 (2016)","journal-title":"Software: Practice and Experience"},{"key":"1098_CR46","doi-asserted-by":"crossref","unstructured":"Zuo, W., Hou, X.: An improved probability propagation algorithm for density peak clustering based on natural nearest neighborhood. Array 100232 (2022)","DOI":"10.1016\/j.array.2022.100232"},{"key":"1098_CR47","doi-asserted-by":"publisher","first-page":"100161","DOI":"10.1016\/j.array.2022.100161","volume":"14","author":"T Hoya","year":"2022","unstructured":"Hoya, T.: Reducing the number of centers in a probabilistic neural network via applying the first neighbor means clustering algorithm. Array 14, 100161 (2022)","journal-title":"Array"},{"key":"1098_CR48","doi-asserted-by":"crossref","unstructured":"Alshammari, M., Stavrakakis, J., Takatsuka, M.: A parameter-free graph reduction for spectral clustering and spectralnet. Array 100192 (2022)","DOI":"10.1016\/j.array.2022.100192"},{"issue":"2","key":"1098_CR49","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s11280-021-00945-9","volume":"25","author":"C Yuan","year":"2022","unstructured":"Yuan, C., Zhu, Y., Zhong, Z., Zheng, W., Zhu, X.: Robust self-tuning multi-view clustering. World Wide Web 25(2), 489\u2013512 (2022)","journal-title":"World Wide Web"},{"key":"1098_CR50","doi-asserted-by":"crossref","unstructured":"Rodriges Zalipynis, R.A.: Distributed in situ processing of big raster data in the cloud. In: International Andrei Ershov Memorial Conference on Perspectives of System Informatics, pp 337\u2013351. Springer (2017)","DOI":"10.1007\/978-3-319-74313-4_24"},{"key":"1098_CR51","doi-asserted-by":"crossref","unstructured":"Johnson, D., Krishnan, S., Chhugani, J., Kumar, S., Venkatasubramanian, S.: Compressing large boolean matrices using reordering techniques. In: PVLDB, pp. 13\u201323 (2004)","DOI":"10.1016\/B978-012088469-8.50005-X"},{"issue":"12","key":"1098_CR52","doi-asserted-by":"publisher","first-page":"2550","DOI":"10.1016\/j.ins.2011.02.002","volume":"181","author":"D Lemire","year":"2011","unstructured":"Lemire, D., Kaser, O.: Reordering columns for smaller indexes. Inform. Sci. 181(12), 2550\u20132570 (2011)","journal-title":"Inform. Sci."},{"key":"1098_CR53","doi-asserted-by":"crossref","unstructured":"Pourabbas, E., Shoshani, A., Wu, K.: Minimizing index size by reordering rows and columns. In: SSDBM, pp 467\u2013484. Springer (2012)","DOI":"10.1007\/978-3-642-31235-9_31"},{"key":"1098_CR54","doi-asserted-by":"crossref","unstructured":"Shi, J.: Column partition and permutation for run length encoding in columnar databases. In: SIGMOD, pp. 2873\u20132874 (2020)","DOI":"10.1145\/3318464.3384413"},{"issue":"1\u20133","key":"1098_CR55","first-page":"1","volume":"4","author":"G Cormode","year":"2011","unstructured":"Cormode, G., Garofalakis, M., Haas, P.J., Jermaine, C., et al.: Synopses for massive data: samples, histograms, wavelets, sketches. Foundations and Trends\u00ae in Databases 4(1\u20133), 1\u2013294 (2011)","journal-title":"Foundations and Trends\u00ae in Databases"},{"key":"1098_CR56","first-page":"651","volume":"99","author":"J Li","year":"1999","unstructured":"Li, J., Rotem, D., Srivastava, J.: Aggregation algorithms for very large compressed data warehouses. PVLDB 99, 651\u2013662 (1999)","journal-title":"PVLDB"},{"key":"1098_CR57","doi-asserted-by":"crossref","unstructured":"Otoo, E.J., Rotem, D., Seshadri, S.: Optimal chunking of large multidimensional arrays for data warehousing. In: DOLAP, pp 25\u201332. ACM (2007)","DOI":"10.1145\/1317331.1317337"},{"key":"1098_CR58","doi-asserted-by":"crossref","unstructured":"Nishimura, S., Yokota, H.: Quilts: Multidimensional data partitioning framework based on query-aware and skew-tolerant space-filling curves. In: SIGMOD, pp. 1525\u20131537 (2017)","DOI":"10.1145\/3035918.3035934"},{"key":"1098_CR59","volume-title":"Space-filling Curves: an Introduction with Applications in Scientific Computing, vol. 9","author":"M Bader","year":"2012","unstructured":"Bader, M.: Space-filling Curves: an Introduction with Applications in Scientific Computing, vol. 9. Springer, Berlin (2012)"},{"key":"1098_CR60","unstructured":"Rusu, F., Cheng, Y.: A survey on array storage, query languages, and systems. arXiv:1302.0103 (2013)"},{"key":"1098_CR61","unstructured":"Chang, C., Moon, B., Acharya, A., Shock, C., Sussman, A., Saltz, J.: Titan: A high-performance remote-sensing database. In: ICDE, pp 375\u2013384. IEEE (1997)"},{"issue":"1","key":"1098_CR62","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/1024022","volume":"24","author":"J Hartmanis","year":"1982","unstructured":"Hartmanis, J.: Computers and intractability: a guide to the theory of np-completeness. Siam Review 24(1), 90 (1982)","journal-title":"Siam Review"},{"key":"1098_CR63","unstructured":"Guard, U.C.: Vessel Traffic Data. https:\/\/marinecadastre.gov\/ais\/ (2020)"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-022-01098-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-022-01098-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-022-01098-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T15:12:55Z","timestamp":1727968375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-022-01098-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,9]]},"references-count":63,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1098"],"URL":"https:\/\/doi.org\/10.1007\/s11280-022-01098-z","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2022,9,9]]},"assertion":[{"value":"9 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2022","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 declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}]}}