{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:16:33Z","timestamp":1755839793318,"version":"3.38.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T00:00:00Z","timestamp":1733356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T00:00:00Z","timestamp":1733356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62202070","62322601"],"award-info":[{"award-number":["62202070","62322601"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2022M720567"],"award-info":[{"award-number":["2022M720567"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Excellent Youth Foundation of Chongqing","award":["CSTB2023NSCQJQX0025"],"award-info":[{"award-number":["CSTB2023NSCQJQX0025"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>With the popularity of mobile devices and the development of location technology, there is an increasing amount of text data with spatial and temporal tags generated. Querying with spatial, temporal, and keyword constraints on such data, known as spatio-temporal keyword query (STK query), is of great significance. However, most existing STK query solutions rely on tree-based indexes designed for stand-alone architectures, which struggle to scale for big data. Key-value stores, with the keys as their indexes, are designed for big data scenarios. On one hand, key-value stores can only support one-dimensional indexes initially, which makes them unsuitable for multi-dimensional STK queries. On the other hand, key-value stores put their indexes out of the memory, making it inevitable to trigger many unnecessary disk I\/Os and slow down the query efficiency. To this end, based on key-value stores, we provide the first attempt by combining the in-memory index with on-disk index to efficiently support STK queries. Specifically, we design two-layer filters as the in-memory index, which enormously prunes unqualified spatio-temporal keyword combinations. An eviction policy is employed for the in-memory index, allowing it to support an infinite amount of data with limited memory usage. We deploy our solution on both HBase and Redis, conducting extensive experiments with two real and one synthetic datasets. The experimental results demonstrate that our solution achieves approximately twice the query efficiency of the state-of-the-art key-value based solutions, and is much more scalable than the tree-based competitor.<\/jats:p>","DOI":"10.1007\/s41019-024-00265-8","type":"journal-article","created":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T08:56:45Z","timestamp":1733389005000},"page":"98-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Spatio-Temporal Keyword Query Processing Based on Key-Value Stores"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6481-0657","authenticated-orcid":false,"given":"Ruiyuan","family":"Li","sequence":"first","affiliation":[]},{"given":"Xiang","family":"He","sequence":"additional","affiliation":[]},{"given":"Yingying","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"You","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Guanyao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,5]]},"reference":[{"issue":"1","key":"265_CR1","first-page":"81","volume":"1","author":"X Chen","year":"2015","unstructured":"Chen X, Zhang C, Shi Z, Xiao W (2015) Spatio-temporal keywords queries in hbase. Big Data Inf Anal 1(1):81\u201391","journal-title":"Big Data Inf Anal"},{"key":"265_CR2","unstructured":"Shepherd TS (2024) 23 Essential Twitter (X) statistics you need to know in 2024. https:\/\/thesocialshepherd.com\/blog\/twitter-statistics"},{"key":"265_CR3","unstructured":"BLOG TSB (2024) Yelp demographics: how many people use yelp in 2024? https:\/\/thesmallbusinessblog.net\/how-many-people-use-yelp\/"},{"issue":"3","key":"265_CR4","first-page":"1","volume":"36","author":"J Zhao","year":"2017","unstructured":"Zhao J, Gao Y, Chen G, Chen R (2017) Towards efficient framework for time-aware spatial keyword queries on road networks. ACM Trans Inf Syst (TOIS) 36(3):1\u201348","journal-title":"ACM Trans Inf Syst (TOIS)"},{"key":"265_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.ins.2018.04.057","volume":"453","author":"X Liu","year":"2018","unstructured":"Liu X, Wan C, Xiong NN, Liu D, Liao G, Deng S (2018) What happened then and there: top-k spatio-temporal keyword query. Inf Sci 453:281\u2013301","journal-title":"Inf Sci"},{"key":"265_CR6","doi-asserted-by":"crossref","unstructured":"Chen L, Shang S (2019) Region-based message exploration over spatio-temporal data streams. In: Proceedings of the AAAI conference on artificial intelligence, vol 33, pp 873\u2013880","DOI":"10.1609\/aaai.v33i01.3301873"},{"key":"265_CR7","doi-asserted-by":"crossref","unstructured":"Huang X, Gao Y, Gao X, Chen G (2021) Netr-tree: an efficient framework for social-based time-aware spatial keyword query. In: 2021 IEEE international conference on web services (ICWS). IEEE, pp 198\u2013207","DOI":"10.1109\/ICWS53863.2021.00038"},{"key":"265_CR8","doi-asserted-by":"crossref","unstructured":"Hoang-Vu T-A, Vo HT, Freire J (2016) A unified index for spatio-temporal keyword queries. In: Proceedings of the 25th ACM international on conference on information and knowledge management, pp 135\u2013144","DOI":"10.1145\/2983323.2983751"},{"issue":"6","key":"265_CR9","doi-asserted-by":"publisher","first-page":"3443","DOI":"10.1109\/TSC.2021.3088131","volume":"15","author":"Q Huang","year":"2021","unstructured":"Huang Q, Du J, Yan G, Yang Y, Wei Q (2021) Privacy-preserving spatio-temporal keyword search for outsourced location-based services. IEEE Trans Serv Comput 15(6):3443\u20133456","journal-title":"IEEE Trans Serv Comput"},{"issue":"22","key":"265_CR10","doi-asserted-by":"publisher","first-page":"16243","DOI":"10.1109\/JIOT.2021.3096674","volume":"8","author":"Y Guan","year":"2021","unstructured":"Guan Y, Lu R, Zheng Y, Zhang S, Shao J, Wei G (2021) Toward privacy-preserving cybertwin-based spatiotemporal keyword query for its in 6g era. IEEE Internet Things J 8(22):16243\u201316255","journal-title":"IEEE Internet Things J"},{"key":"265_CR11","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.ins.2022.01.066","volume":"593","author":"C Luo","year":"2022","unstructured":"Luo C, Wang P, Li Y, Zheng B, Li G (2022) Efficient time-interval augmented spatial keyword queries on road networks. Inf Sci 593:505\u2013526","journal-title":"Inf Sci"},{"key":"265_CR12","doi-asserted-by":"crossref","unstructured":"Andrade DC, Rocha-Junior JB, Costa DG (2017) Efficient processing of spatio-temporal-textual queries. In: Proceedings of the 23rd Brazillian symposium on multimedia and the web, pp 165\u2013172","DOI":"10.1145\/3126858.3126877"},{"key":"265_CR13","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD international conference on management of data, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"key":"265_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel RA, Bentley JL (1974) Quad trees a data structure for retrieval on composite keys. Acta Inform 4:1\u20139","journal-title":"Acta Inform"},{"key":"265_CR15","doi-asserted-by":"crossref","unstructured":"Almaslukh A, Magdy A (2019) Temporal geo-social personalized search over streaming data. In: Proceedings of the 27th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 189\u2013198","DOI":"10.1145\/3347146.3359073"},{"issue":"4","key":"265_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3473006","volume":"7","author":"A Almaslukh","year":"2021","unstructured":"Almaslukh A, Kang Y, Magdy A (2021) Temporal geo-social personalized keyword search over streaming data. ACM Trans Spatial Algorithms Syst (TSAS) 7(4):1\u201328","journal-title":"ACM Trans Spatial Algorithms Syst (TSAS)"},{"issue":"7","key":"265_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom BH (1970) Space\/time trade-offs in hash coding with allowable errors. Commun ACM 13(7):422\u2013426","journal-title":"Commun ACM"},{"issue":"1","key":"265_CR18","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TKDE.2020.2979176","volume":"34","author":"S Nishio","year":"2020","unstructured":"Nishio S, Amagata D, Hara T (2020) Lamps: location-aware moving top-k pub\/sub. IEEE Trans Knowl Data Eng 34(1):352\u2013364","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"265_CR19","doi-asserted-by":"crossref","unstructured":"Kalamatianos G, Fakas GJ, Mamoulis N (2021) Proportionality in spatial keyword search. In: Proceedings of the 2021 international conference on management of data, pp 885\u2013897","DOI":"10.1145\/3448016.3457309"},{"issue":"2","key":"265_CR20","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00778-020-00627-4","volume":"30","author":"Y Dong","year":"2021","unstructured":"Dong Y, Xiao C, Chen H, Yu JX, Takeoka K, Oyamada M, Kitagawa H (2021) Continuous top-k spatial-keyword search on dynamic objects. VLDB J 30(2):141\u2013161","journal-title":"VLDB J"},{"issue":"1","key":"265_CR21","doi-asserted-by":"publisher","first-page":"337","DOI":"10.14778\/1687627.1687666","volume":"2","author":"G Cong","year":"2009","unstructured":"Cong G, Jensen CS, Wu D (2009) Efficient retrieval of the top-k most relevant spatial web objects. Proc VLDB Endow 2(1):337\u2013348","journal-title":"Proc VLDB Endow"},{"key":"265_CR22","doi-asserted-by":"crossref","unstructured":"Bao J, Li R, Yi X, Zheng Y (2016) Managing massive trajectories on the cloud. In: Proceedings of the 24th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 1\u201310","DOI":"10.1145\/2996913.2996916"},{"issue":"2","key":"265_CR23","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/1132956.1132959","volume":"38","author":"J Zobel","year":"2006","unstructured":"Zobel J, Moffat A (2006) Inverted files for text search engines. ACM Comput Surv (CSUR) 38(2):6","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"13","key":"265_CR24","doi-asserted-by":"publisher","first-page":"1601","DOI":"10.14778\/2733004.2733040","volume":"7","author":"L Chen","year":"2014","unstructured":"Chen L, Cui Y, Cong G, Cao X (2014) Sops: a system for efficient processing of spatial-keyword publish\/subscribe. Proc VLDB Endow 7(13):1601\u20131604","journal-title":"Proc VLDB Endow"},{"issue":"3","key":"265_CR25","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s10844-022-00752-2","volume":"60","author":"X Ding","year":"2023","unstructured":"Ding X, Zheng Y, Wang Z, Choo K-KR, Jin H (2023) A learned spatial textual index for efficient keyword queries. J Intell Inf Syst 60(3):803\u2013827","journal-title":"J Intell Inf Syst"},{"issue":"2","key":"265_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3589332","volume":"1","author":"Y Sheng","year":"2023","unstructured":"Sheng Y, Cao X, Fang Y, Zhao K, Qi J, Cong G, Zhang W (2023) Wisk: a workload-aware learned index for spatial keyword queries. Proc ACM Manag Data 1(2):1\u201327","journal-title":"Proc ACM Manag Data"},{"key":"265_CR27","unstructured":"Yin Z, Feng S, Liu S, Cong G, Ong YS, Cui B (2024) List: learning to index spatio-textual data for embedding based spatial keyword queries. arXiv preprint arXiv:2403.07331"},{"issue":"2","key":"265_CR28","doi-asserted-by":"publisher","first-page":"74","DOI":"10.14778\/3425879.3425880","volume":"14","author":"J Ding","year":"2020","unstructured":"Ding J, Nathan V, Alizadeh M, Kraska T (2020) Tsunami: a learned multi-dimensional index for correlated data and skewed workloads. Proc VLDB Endow 14(2):74\u201386","journal-title":"Proc VLDB Endow"},{"key":"265_CR29","doi-asserted-by":"crossref","unstructured":"Nathan V, Ding J, Alizadeh M, Kraska T (2020) Learning multi-dimensional indexes. In: Proceedings of the 2020 ACM SIGMOD international conference on management of data, pp 985\u20131000","DOI":"10.1145\/3318464.3380579"},{"key":"265_CR30","doi-asserted-by":"crossref","unstructured":"Anand A, Bedathur S, Berberich K, Schenkel R (2010) Efficient temporal keyword search over versioned text. In: Proceedings of the 19th ACM international conference on information and knowledge management, pp 699\u2013708","DOI":"10.1145\/1871437.1871528"},{"key":"265_CR31","doi-asserted-by":"crossref","unstructured":"Xia F, Yu C, Qian W, Zhou A (2016) Top-k temporal keyword query over social media data. In: Web technologies and applications: 18th Asia-Pacific web conference, APWeb 2016, Suzhou, China, September 23\u201325, 2016. Proceedings, part I. Springer, pp 183\u2013195","DOI":"10.1007\/978-3-319-45814-4_15"},{"key":"265_CR32","doi-asserted-by":"crossref","unstructured":"Chen L, Cong G, Cao X, Tan K-L (2015) Temporal spatial-keyword top-k publish\/subscribe. In: 2015 IEEE 31St international conference on data engineering. IEEE, pp 255\u2013266","DOI":"10.1109\/ICDE.2015.7113289"},{"issue":"11","key":"265_CR33","doi-asserted-by":"publisher","first-page":"2601","DOI":"10.1109\/TKDE.2017.2742956","volume":"29","author":"G Chen","year":"2017","unstructured":"Chen G, Zhao J, Gao Y, Chen L, Chen R (2017) Time-aware Boolean spatial keyword queries. IEEE Trans Knowl Data Eng 29(11):2601\u20132614","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"265_CR34","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.2298\/CSIS200131034C","volume":"18","author":"Z Chen","year":"2021","unstructured":"Chen Z, Zhao T, Liu W (2021) Time-aware collective spatial keyword query. Comput Sci Inf Syst 18(3):1077\u20131100","journal-title":"Comput Sci Inf Syst"},{"key":"265_CR35","first-page":"115","volume":"24","author":"S Ray","year":"2022","unstructured":"Ray S, Nickerson B (2022) Temporally relevant parallel top-k spatial keyword search. J Spat Inf Sci 24:115\u2013156","journal-title":"J Spat Inf Sci"},{"issue":"10","key":"265_CR36","doi-asserted-by":"publisher","first-page":"2418","DOI":"10.14778\/3603581.3603584","volume":"16","author":"C Luo","year":"2023","unstructured":"Luo C, Liu Q, Gao Y, Chen L, Wei Z, Ge C (2023) Task: an efficient framework for instant error-tolerant spatial keyword queries on road networks. Proc VLDB Endow 16(10):2418\u20132430","journal-title":"Proc VLDB Endow"},{"key":"265_CR37","doi-asserted-by":"crossref","unstructured":"Arseneau Y, Gautam S, Nickerson B, Ray S (2020) Stilt: unifying spatial, temporal and textual search using a generalized multi-dimensional index. In: Proceedings of the 32nd international conference on scientific and statistical database management, pp 1\u201312","DOI":"10.1145\/3400903.3400927"},{"issue":"4","key":"265_CR38","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s00778-021-00661-w","volume":"30","author":"Z Chen","year":"2021","unstructured":"Chen Z, Chen L, Cong G, Jensen CS (2021) Location-and keyword-based querying of geo-textual data: a survey. VLDB J 30(4):603\u2013640","journal-title":"VLDB J"},{"key":"265_CR39","unstructured":"Ltd R (2024) Redis. https:\/\/redis.io\/"},{"key":"265_CR40","unstructured":"Foundation TAS (2024) Apache HBase. https:\/\/hbase.apache.org\/"},{"key":"265_CR41","doi-asserted-by":"crossref","unstructured":"Li R, Wang R, Liu J, Yu Z, He H, He T, Ruan S, Bao J, Chen C, Gu F et al (2021) Distributed spatio-temporal k nearest neighbors join. In: Proceedings of the 29th international conference on advances in geographic information systems, pp 435\u2013445","DOI":"10.1145\/3474717.3484209"},{"key":"265_CR42","doi-asserted-by":"crossref","unstructured":"Li R, Bao J, He H, Ruan S, He T, Hong L, Jiang Z, Zheng Y (2020) Discovering real-time reachable area using trajectory connections. In: Database systems for advanced applications: 25th international conference, DASFAA 2020, Jeju, South Korea, September 24\u201327, 2020, proceedings, part II 25. Springer, pp 36\u201353","DOI":"10.1007\/978-3-030-59416-9_3"},{"key":"265_CR43","doi-asserted-by":"publisher","DOI":"10.1145\/3589285","author":"N Dayan","year":"2023","unstructured":"Dayan N, Bercea I, Reviriego P, Pagh R (2023) Infinifilter: expanding filters to infinity and beyond. Proc ACM Manag Data. https:\/\/doi.org\/10.1145\/3589285","journal-title":"Proc ACM Manag Data"},{"key":"265_CR44","doi-asserted-by":"crossref","unstructured":"Li R, He H, Wang R, Huang Y, Liu J, Ruan S, He T, Bao J, Zheng Y (2020) Just: Jd urban spatio-temporal data engine. In: 2020 IEEE 36th international conference on data engineering (ICDE). IEEE, pp 1558\u20131569","DOI":"10.1109\/ICDE48307.2020.00138"},{"issue":"1","key":"265_CR45","first-page":"1013","volume":"35","author":"R Li","year":"2021","unstructured":"Li R, He H, Wang R, Ruan S, He T, Bao J, Zhang J, Hong L, Zheng Y (2021) Trajmesa: a distributed nosql-based trajectory data management system. IEEE Trans Knowl Data Eng 35(1):1013\u20131027","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"265_CR46","doi-asserted-by":"crossref","unstructured":"Li R, He H, Wang R, Ruan S, Sui Y, Bao J, Zheng Y (2020) Trajmesa: a distributed nosql storage engine for big trajectory data. In: 2020 IEEE 36th international conference on data engineering (ICDE). IEEE, pp 2002\u20132005","DOI":"10.1109\/ICDE48307.2020.00224"},{"key":"265_CR47","doi-asserted-by":"crossref","unstructured":"He H, Li R, Ruan S, He T, Bao J, Li T, Zheng Y (2022) Trass: efficient trajectory similarity search based on key-value data stores. In: 2022 IEEE 38th international conference on data engineering (ICDE). IEEE, pp 2306\u20132318","DOI":"10.1109\/ICDE53745.2022.00218"},{"key":"265_CR48","doi-asserted-by":"crossref","unstructured":"He H, Xu Z, Li R, Bao J, Li T, Zheng Y (2024) Tman: a high-performance trajectory data management system based on key-value stores. In: 2024 IEEE 40th international conference on data engineering (ICDE). IEEE","DOI":"10.1109\/ICDE60146.2024.00376"},{"key":"265_CR49","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF01199431","volume":"38","author":"D Hilbert","year":"1891","unstructured":"Hilbert D (1891) \u00dcber die stetige abbildung einer linie auf ein fl\u00e4chenst\u00fcck. Math Ann 38:459\u2013460","journal-title":"Math Ann"},{"key":"265_CR50","doi-asserted-by":"crossref","unstructured":"Wang H, Dai H, Li M, Yu J, Gu R, Zheng J, Chen G (2022) Bamboo filters: make resizing smooth. In: 2022 IEEE 38th international conference on data engineering (ICDE). IEEE, pp 979\u2013991","DOI":"10.1109\/ICDE53745.2022.00078"},{"key":"265_CR51","doi-asserted-by":"crossref","unstructured":"Zhang F, Chen H, Jin H, Reviriego P (2021) The logarithmic dynamic cuckoo filter. In: 2021 IEEE 37th international conference on data engineering (ICDE). IEEE, pp 948\u2013959","DOI":"10.1109\/ICDE51399.2021.00087"},{"key":"265_CR52","unstructured":"Inc Y (2024) Yelp Open Dataset. https:\/\/www.yelp.com\/dataset"},{"key":"265_CR53","doi-asserted-by":"crossref","unstructured":"Chen Z, Cong G, Zhang Z, Fuz TZ, Chen L (2017) Distributed publish\/subscribe query processing on the spatio-textual data stream. In: 2017 IEEE 33rd international conference on data engineering (ICDE). IEEE, pp 1095\u20131106","DOI":"10.1109\/ICDE.2017.154"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-024-00265-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-024-00265-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-024-00265-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T15:24:50Z","timestamp":1740842690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-024-00265-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,5]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["265"],"URL":"https:\/\/doi.org\/10.1007\/s41019-024-00265-8","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"type":"print","value":"2364-1185"},{"type":"electronic","value":"2364-1541"}],"subject":[],"published":{"date-parts":[[2024,12,5]]},"assertion":[{"value":"29 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}