{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:54:52Z","timestamp":1775638492544,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T00:00:00Z","timestamp":1722988800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T00:00:00Z","timestamp":1722988800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U20A20179"],"award-info":[{"award-number":["U20A20179"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372009"],"award-info":[{"award-number":["62372009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key R &D Program of China","doi-asserted-by":"crossref","award":["2022YFB2901504"],"award-info":[{"award-number":["2022YFB2901504"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2023TQ0010"],"award-info":[{"award-number":["2023TQ0010"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["GZC20230055"],"award-info":[{"award-number":["GZC20230055"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s00778-024-00873-w","type":"journal-article","created":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T08:03:11Z","timestamp":1723017791000},"page":"1837-1859","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Enabling space-time efficient range queries with REncoder"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0042-1828","authenticated-orcid":false,"given":"Zhuochen","family":"Fan","sequence":"first","affiliation":[]},{"given":"Bowen","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Ziwei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zheng","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Jiarui","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Yuhan","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Haoyu","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2402-5854","authenticated-orcid":false,"given":"Tong","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yaofeng","family":"Tu","sequence":"additional","affiliation":[]},{"given":"Zirui","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Cui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,7]]},"reference":[{"key":"873_CR1","volume-title":"The Design and Implementation of Modern Column-Oriented Database Systems","author":"D Abadi","year":"2013","unstructured":"Abadi, D., Boncz, P., Amiato, S.H., Idreos, S., Madden, S.: The Design and Implementation of Modern Column-Oriented Database Systems. Mass, Now Hanover (2013)"},{"issue":"14","key":"873_CR2","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.14778\/2556549.2556556","volume":"6","author":"K Alexiou","year":"2013","unstructured":"Alexiou, K., Kossmann, D., Larson, P.-\u00c5.: Adaptive range filters for cold data: avoiding trips to Siberia. Proc. VLDB Endow. 6(14), 1714\u20131725 (2013)","journal-title":"Proc. VLDB Endow."},{"issue":"10","key":"873_CR3","doi-asserted-by":"publisher","first-page":"841","DOI":"10.14778\/2732951.2732958","volume":"7","author":"S Alsubaiee","year":"2014","unstructured":"Alsubaiee, S., Behm, A., Borkar, V., Heilbron, Z., Kim, Y.-S., Carey, M.J., Dreseler, M., Li, C.: Storage management in AsterixDB. Proc. VLDB Endow. 7(10), 841\u2013852 (2014)","journal-title":"Proc. VLDB Endow."},{"key":"873_CR4","unstructured":"Apache. Accumulo. https:\/\/accumulo.apache.org"},{"key":"873_CR5","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger,B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"issue":"7","key":"873_CR6","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"873_CR7","unstructured":"BOB Hash Website. http:\/\/burtleburtle.net\/bob\/hash\/evahash.html"},{"issue":"4","key":"873_CR8","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: a survey. Internet Math. 1(4), 485\u2013509 (2004)","journal-title":"Internet Math."},{"issue":"2","key":"873_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1365815.1365816","volume":"26","author":"F Chang","year":"2008","unstructured":"Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: a distributed storage system for structured data. ACM Trans. Comput. Syst. (TOCS) 26(2), 1\u201326 (2008)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"873_CR10","unstructured":"CockroachLabs. CockroachDB. https:\/\/github.com\/cockroachdb\/cockroach"},{"issue":"2","key":"873_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer, D.: Ubiquitous B-tree. ACM Comput. Surv. 11(2), 121\u2013137 (1979)","journal-title":"ACM Comput. Surv."},{"key":"873_CR12","doi-asserted-by":"crossref","unstructured":"Cooper, B.F., Silberstein, A., Tam, E., Ramakrishnan, R., Sears, R.: Benchmarking cloud serving systems with YCSB. In: Proceedings of the 1st ACM Symposium on Cloud Computing, pp. 143\u2013154 (2010)","DOI":"10.1145\/1807128.1807152"},{"key":"873_CR13","doi-asserted-by":"crossref","unstructured":"Crainiceanu, A., Linga, P., Machanavajjhala, A., Gehrke, J., Shanmugasundaram, J.: P-ring: an efficient and robust p2p range index structure. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, pp. 223\u2013234","DOI":"10.1145\/1247480.1247507"},{"issue":"4","key":"873_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3276980","volume":"43","author":"N Dayan","year":"2018","unstructured":"Dayan, N., Athanassoulis, M., Idreos, S.: Optimal bloom filters and adaptive merging for LSM-trees. ACM Trans. Database Syst. (TODS) 43(4), 1\u201348 (2018)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"873_CR15","doi-asserted-by":"crossref","unstructured":"DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: Amazon\u2019s highly available key-value store. IEEE Computer Society Non-profit Organization US Postage PAID Silver Spring (2007)","DOI":"10.1145\/1294261.1294281"},{"key":"873_CR16","unstructured":"Dgraph. Badger Key-Value DB in Go. https:\/\/github.com\/dgraphio\/badger"},{"key":"873_CR17","doi-asserted-by":"crossref","unstructured":"Dharmapurikar, S., Krishnamurthy, P., Taylor,D.E.: Longest prefix matching using bloom filters. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 201\u2013212 (2003)","DOI":"10.1145\/863977.863979"},{"key":"873_CR18","unstructured":"Facebook. MyRocks. http:\/\/myrocks.io"},{"key":"873_CR19","unstructured":"Facebook. RocksDB. https:\/\/github.com\/facebook\/rocksdb\/"},{"key":"873_CR20","unstructured":"Gao, J., Steenkiste, P.: An adaptive protocol for efficient support of range queries in DHT-based systems. In: Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP), pp. 239\u2013250 (2004)"},{"key":"873_CR21","unstructured":"Google LevelDB. https:\/\/github.com\/google\/leveldb"},{"key":"873_CR22","doi-asserted-by":"crossref","unstructured":"Goswami, M., Gr\u00f6nlund, A., Larsen, K.G., Pagh, R.: Approximate range emptiness in constant time and optimal space. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 769\u2013775. SIAM (2014)","DOI":"10.1137\/1.9781611973730.52"},{"key":"873_CR23","doi-asserted-by":"crossref","unstructured":"Graefe, G., Kuno, H.: Modern B-tree techniques. In: 2011 IEEE 27th International Conference on Data Engineering, pp. 1370\u20131373. IEEE (2011)","DOI":"10.1109\/ICDE.2011.5767956"},{"key":"873_CR24","doi-asserted-by":"crossref","unstructured":"Guttman,A.: 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 (1984)","DOI":"10.1145\/602259.602266"},{"key":"873_CR25","unstructured":"Intel Instructions. https:\/\/software.intel.com\/sites\/landingpage\/IntrinsicsGuide"},{"key":"873_CR26","doi-asserted-by":"crossref","unstructured":"Jacobson,G.: Space-efficient static trees and graphs. In: 30th annual symposium on foundations of computer science, pp. 549\u2013554. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"873_CR27","doi-asserted-by":"crossref","unstructured":"Kahveci, T., Singh, A.: Variable length queries for time series data. In: Proceedings 17th International Conference on Data Engineering, pp. 273\u2013282. IEEE (2001)","DOI":"10.1109\/ICDE.2001.914838"},{"key":"873_CR28","doi-asserted-by":"crossref","unstructured":"Kipf, A., Marcus, R., van Renen, A., Stoian, M., Kemper, A., Kraska, T., Neumann, T.: SOSD: A Benchmark for Learned Indexes (2019). arXiv preprint arXiv:1911.13014","DOI":"10.14778\/3421424.3421425"},{"key":"873_CR29","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-1-84882-765-3_9","volume-title":"Algorithms for Next Generation Networks","author":"A Kirsch","year":"2010","unstructured":"Kirsch, A., Mitzenmacher, M., Varghese, G.: Hash-based techniques for high-speed packet processing. In: Cormode, G., Thottan, M. (eds.) Algorithms for Next Generation Networks, pp. 181\u2013218. Springer, London (2010). https:\/\/doi.org\/10.1007\/978-1-84882-765-3_9"},{"key":"873_CR30","doi-asserted-by":"crossref","unstructured":"Knorr, E.R., Lemaire, B., Lim, A., Luo, S., Zhang, H., Idreos, S., Mitzenmacher, M.: Proteus: a self-designing range filter. In: Proceedings of the 2022 International Conference on Management of Data, pp. 1670\u20131684 (2022)","DOI":"10.1145\/3514221.3526167"},{"key":"873_CR31","doi-asserted-by":"crossref","unstructured":"Kondylakis, H., Dayan, N., Zoumpatianos, K., Palpanas, T.: Coconut palm: static and streaming data series exploration now in your palm. In: Proceedings of the 2019 International Conference on Management of Data, pp. 1941\u20131944 (2019)","DOI":"10.1145\/3299869.3320233"},{"issue":"6","key":"873_CR32","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1007\/s00778-019-00573-w","volume":"28","author":"H Kondylakis","year":"2019","unstructured":"Kondylakis, H., Dayan, N., Zoumpatianos, K., Palpanas, T.: Coconut: sortable summarizations for scalable indexes over static and streaming data series. VLDB J. 28(6), 847\u2013869 (2019)","journal-title":"VLDB J."},{"key":"873_CR33","unstructured":"Kyrola, A., Guestrin, C.: GraphChi-DB: Simple Design for a Scalable Graph Database System\u2013on Just a PC (2014). arXiv preprint arXiv:1403.0701"},{"issue":"2","key":"873_CR34","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1773912.1773922","volume":"44","author":"A Lakshman","year":"2010","unstructured":"Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. ACM SIGOPS Oper. Syst. Rev. 44(2), 35\u201340 (2010)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"key":"873_CR35","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s41019-018-0074-4","volume":"3","author":"K Li","year":"2018","unstructured":"Li, K., Li, G.: Approximate query processing: What is new and where to go? A survey on approximate query processing. Data Sci. Eng. 3, 379\u2013397 (2018)","journal-title":"Data Sci. Eng."},{"issue":"12","key":"873_CR36","doi-asserted-by":"publisher","first-page":"2355","DOI":"10.14778\/3407790.3407830","volume":"13","author":"Q Liu","year":"2020","unstructured":"Liu, Q., Zheng, L., Shen, Y., Chen, L.: Stable learned bloom filters for data streams. Proc. VLDB Endow. 13(12), 2355\u20132367 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"873_CR37","doi-asserted-by":"crossref","unstructured":"Luo, S., Chatterjee, S., Ketsetsidis, R., Dayan, N., Qin, W., Idreos, S.: Rosetta: a robust space-time optimized range filter for key-value stores. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 2071\u20132086 (2020)","DOI":"10.1145\/3318464.3389731"},{"issue":"1","key":"873_CR38","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00778-019-00555-y","volume":"29","author":"C Luo","year":"2020","unstructured":"Luo, C., Carey, M.J.: LSM-based storage techniques: a survey. VLDB J. 29(1), 393\u2013418 (2020)","journal-title":"VLDB J."},{"key":"873_CR39","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035179","volume-title":"Handbook of Data Structures and Applications","author":"DP Mehta","year":"2004","unstructured":"Mehta, D.P., Sahni, S.: Handbook of Data Structures and Applications. Chapman and Hall\/CRC, Boca Raton (2004)"},{"key":"873_CR40","unstructured":"Morton, G.M.: A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing (1966)"},{"key":"873_CR41","unstructured":"M\u00f6\u00dfner, B., Riegger, C., Bernhardt, A., Petrov, I.: bloomRF: on performing range-queries in bloom-filters with piecewise-monotone hash functions and prefix hashing. In: Proceedings of the 26th International Conference on Extending database Technology (EDBT), vol. 26, pp. 131\u2013143 (2023)"},{"issue":"4","key":"873_CR42","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"P O\u2019Neil","year":"1996","unstructured":"O\u2019Neil, P., Cheng, E., Gawlick, D., O\u2019Neil, E.: The log-structured merge-tree (LSM-tree). Acta Inform. 33(4), 351\u2013385 (1996)","journal-title":"Acta Inform."},{"key":"873_CR43","doi-asserted-by":"crossref","unstructured":"Peng, Y., Guo, J., Li, F., Qian, W., Zhou, A.: Persistent bloom filter: membership testing for the entire history. In: Proceedings of the 2018 International Conference on Management of Data, pp. 1037\u20131052 (2018)","DOI":"10.1145\/3183713.3183737"},{"key":"873_CR44","doi-asserted-by":"crossref","unstructured":"Powers,D.M.: Applications and explanations of zipf\u2019s law. In: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (NeMLaP3\/CoNLL \u201998), pp. 151\u2013160 (1998)","DOI":"10.3115\/1603899.1603924"},{"key":"873_CR45","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"2012","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer Science & Business Media, Berlin (2012)"},{"issue":"13","key":"873_CR46","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.14778\/3151106.3151108","volume":"10","author":"K Ren","year":"2017","unstructured":"Ren, K., Zheng, Q., Arulraj, J., Gibson, G.: SlimDB: a space-efficient key-value storage engine for semi-sorted data. Proc. VLDB Endow. 10(13), 2037\u20132048 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"873_CR47","unstructured":"Roozenburg, J.: A literature survey on bloom filters. Research Assignment (2005)"},{"issue":"2","key":"873_CR48","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/spe.576","volume":"34","author":"A Rousskov","year":"2004","unstructured":"Rousskov, A., Wessels, D.: High-performance benchmarking with web polygraph. Softw. Pract. Exp. 34(2), 187\u2013211 (2004)","journal-title":"Softw. Pract. Exp."},{"issue":"1","key":"873_CR49","doi-asserted-by":"publisher","first-page":"526","DOI":"10.14778\/1453856.1453914","volume":"1","author":"R Sears","year":"2008","unstructured":"Sears, R., Callaghan, M., Brewer, E.: Rose: Compressed, log-structured replication. Proc. VLDB Endow. 1(1), 526\u2013537 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"873_CR50","unstructured":"Sellis, T., Roussopoulos, N., Faloutsos,C.: The R+-tree: A dynamic index for multi-dimensional objects. Technical Report, University of Maryland (1987)"},{"key":"873_CR51","unstructured":"Source code related to REncoder. https:\/\/github.com\/pkufzc\/REncoder"},{"key":"873_CR52","doi-asserted-by":"crossref","unstructured":"Tarkoma, S., Rothenberg, C.E., Lagerspetz, E.: Theory and practice of bloom filters for distributed systems. IEEE Commun. Surv. Tutor. 14(1), 131\u2013155 (2011)","DOI":"10.1109\/SURV.2011.031611.00024"},{"issue":"8","key":"873_CR53","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.14778\/3529337.3529347","volume":"15","author":"K Vaidya","year":"2022","unstructured":"Vaidya, K., Chatterjee, S., Knorr, E., Mitzenmacher, M., Idreos, S., Kraska, T.: SNARF: a learning-enhanced range filter. Proc. VLDB Endow. 15(8), 1632\u20131644 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"873_CR54","doi-asserted-by":"crossref","unstructured":"Vairam, P.K., Kumar, P., Rebeiro, C., Veezhinathan, K.: FadingBF: a bloom filter with consistent guarantees for online applications. IEEE Trans. Comput. 71, 40\u201352 (2020)","DOI":"10.1109\/TC.2020.3036424"},{"key":"873_CR55","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zhong, Z., Guo, J., Wu, Y., Li, H., Yang, T., Tu, Y., Zhang, H., Cui, B.: Rencoder: a space-time efficient range filter with local encoder. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp. 2036\u20132049 (2023)","DOI":"10.1109\/ICDE55515.2023.00158"},{"issue":"4","key":"873_CR56","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1109\/TC.2021.3067713","volume":"71","author":"Y Wu","year":"2021","unstructured":"Wu, Y., He, J., Yan, S., Wu, J., Yang, T., Ruas, O., Zhang, G., Cui, B.: Elastic bloom filter: deletable and expandablefilter using elastic fingerprints. IEEE Trans. Comput. 71(4), 984\u2013991 (2021)","journal-title":"IEEE Trans. Comput."},{"key":"873_CR57","doi-asserted-by":"crossref","unstructured":"Xie, R., Li, M., Miao, Z., Gu, R., Huang, H., Dai, H., Chen, G.: Hash adaptive bloom filter. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 636\u2013647. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00061"},{"issue":"5","key":"873_CR58","doi-asserted-by":"publisher","first-page":"3116","DOI":"10.1109\/TNET.2017.2730227","volume":"25","author":"T Yang","year":"2017","unstructured":"Yang, T., Liu, A.X., Shahzad, M., Yang, D., Fu, Q., Xie, G., Li, X.: A shifting framework for set queries. IEEE\/ACM Trans. Netw. 25(5), 3116\u20133131 (2017)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"873_CR59","doi-asserted-by":"crossref","unstructured":"Yi, Y., Li, R., Chen, F., Liu, A.X., Lin, Y.: A digital watermarking approach to secure and precise range query processing in sensor networks. In: 2013 Proceedings IEEE INFOCOM, pp. 1950\u20131958 (2013)","DOI":"10.1109\/INFCOM.2013.6566995"},{"key":"873_CR60","doi-asserted-by":"crossref","unstructured":"Zhang, H., Lim, H., Leis, V., Andersen, D.G., Kaminsky, M., Keeton, K., Pavlo, A.: Surf: practical range query filtering with fast succinct tries. In: Proceedings of the 2018 International Conference on Management of Data, pp. 323\u2013336 (2018)","DOI":"10.1145\/3183713.3196931"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00873-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-024-00873-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00873-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T10:08:47Z","timestamp":1729505327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-024-00873-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,7]]},"references-count":60,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["873"],"URL":"https:\/\/doi.org\/10.1007\/s00778-024-00873-w","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,7]]},"assertion":[{"value":"28 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}