{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T09:59:18Z","timestamp":1785405558717,"version":"3.56.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T00:00:00Z","timestamp":1779235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T00:00:00Z","timestamp":1785369600000},"content-version":"vor","delay-in-days":71,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"Xiangyang Innovation and Development Joint Fund Project","award":["2026AFC0108"],"award-info":[{"award-number":["2026AFC0108"]}]},{"name":"the Natural Science Foundation of Hubei Province of China","award":["2025AFB224"],"award-info":[{"award-number":["2025AFB224"]}]},{"name":"the Hubei Provincial Regional Science and Technology Innovation Program","award":["2025EIA098"],"award-info":[{"award-number":["2025EIA098"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s44443-026-00850-z","type":"journal-article","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T12:42:29Z","timestamp":1779280949000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An index structure based on learned hybrid space-filling curves"],"prefix":"10.1007","volume":"38","author":[{"given":"Jie","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhongbo","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huaiguang","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meng","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,20]]},"reference":[{"key":"850_CR1","doi-asserted-by":"publisher","unstructured":"Bayer R (1997) The universal B-tree for multidimensional indexing: general concepts. In: International conference on worldwide computing and its applications. Springer, pp 198\u2013209. https:\/\/doi.org\/10.1007\/3-540-63343-X_48","DOI":"10.1007\/3-540-63343-X_48"},{"key":"850_CR2","doi-asserted-by":"publisher","unstructured":"Bayer R, McCreight E (1970) Organization and maintenance of large ordered indices. In: Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) workshop on data description, access and control, pp 107\u2013141. https:\/\/doi.org\/10.1145\/1734663.1734671","DOI":"10.1145\/1734663.1734671"},{"issue":"1","key":"850_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/320521.320530","volume":"2","author":"R Bayer","year":"1977","unstructured":"Bayer R, Unterauer K (1977) Prefix B-trees. ACM Trans Database Syst (TODS) 2(1):11\u201326. https:\/\/doi.org\/10.1145\/320521.320530","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"850_CR4","doi-asserted-by":"publisher","unstructured":"Beckmann N, Seeger B (2009) A revised R*-tree in comparison with related index structures. In: Proceedings of the 2009 ACM SIGMOD international conference on management of data, pp 799\u2013812. https:\/\/doi.org\/10.1145\/1559845.1559929","DOI":"10.1145\/1559845.1559929"},{"key":"850_CR5","doi-asserted-by":"publisher","unstructured":"Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) 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. https:\/\/doi.org\/10.1145\/93597.98741","DOI":"10.1145\/93597.98741"},{"issue":"9","key":"850_CR6","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517. https:\/\/doi.org\/10.1145\/361002.361007","journal-title":"Commun ACM"},{"key":"850_CR7","doi-asserted-by":"publisher","unstructured":"Berchtold S, B\u00f6hm C, Keim DA, Kriegel H-P (1997) A cost model for nearest neighbor search in high-dimensional data space. In: Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp 78\u201386. https:\/\/doi.org\/10.1145\/263661.263671","DOI":"10.1145\/263661.263671"},{"issue":"3","key":"850_CR8","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C B\u00f6hm","year":"2001","unstructured":"B\u00f6hm C, Berchtold S, Keim DA (2001) Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput Surv (CSUR) 33(3):322\u2013373. https:\/\/doi.org\/10.1145\/502807.502809","journal-title":"ACM Comput Surv (CSUR)"},{"key":"850_CR9","doi-asserted-by":"publisher","unstructured":"Ding J, Minhas UF, Yu J, Wang C, Do J, Li Y, Zhang H, Chandramouli B, Gehrke J, Kossmann D et al (2020a) ALEX: an updatable adaptive learned index. In: Proceedings of the 2020 ACM SIGMOD international conference on management of data, pp 969\u2013984. https:\/\/doi.org\/10.1145\/3318464.3389711","DOI":"10.1145\/3318464.3389711"},{"key":"850_CR10","doi-asserted-by":"crossref","unstructured":"Ding J, Nathan V, Alizadeh M, Kraska T (2020b) Tsunami: A learned multi-dimensional index for correlated data and skewed workloads. arXiv:2006.13282","DOI":"10.14778\/3425879.3425880"},{"issue":"8","key":"850_CR11","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.14778\/3389133.3389135","volume":"13","author":"P Ferragina","year":"2020","unstructured":"Ferragina P, Vinciguerra G (2020) The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds. Proc VLDB Endow 13(8):1162\u20131175. https:\/\/doi.org\/10.14778\/3389133.3389135","journal-title":"Proc VLDB Endow"},{"key":"850_CR12","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 Informatica 4:1\u20139. https:\/\/doi.org\/10.1007\/BF00288933","journal-title":"Acta Informatica"},{"issue":"2","key":"850_CR13","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, G\u00fcnther O (1998) Multidimensional access methods. ACM Comput Surv (CSUR) 30(2):170\u2013231. https:\/\/doi.org\/10.1145\/280277.280279","journal-title":"ACM Comput Surv (CSUR)"},{"key":"850_CR14","doi-asserted-by":"publisher","unstructured":"Galakatos A, Markovitch M, Binnig C, Fonseca R, Kraska T (2019) Fiting-tree: A data-aware index structure. In: Proceedings of the 2019 international conference on management of data, pp 1189\u20131206. https:\/\/doi.org\/10.1145\/3299869.3319860","DOI":"10.1145\/3299869.3319860"},{"key":"850_CR15","doi-asserted-by":"crossref","unstructured":"Gao J, Cao X, Yao X, Zhang G, Wang W (2023) LMSFC: A novel multidimensional index based on learned monotonic space filling curves. arXiv:2304.12635","DOI":"10.14778\/3603581.3603598"},{"key":"850_CR16","doi-asserted-by":"publisher","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. ACM, Boston, Massachusetts, pp 47\u201357. https:\/\/doi.org\/10.1145\/602259.602266","DOI":"10.1145\/602259.602266"},{"issue":"2","key":"850_CR17","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF01759359","volume":"169","author":"C Hamburger","year":"1995","unstructured":"Hamburger C (1995) Quasimonotonicity, regularity and duality for nonlinear systems of partial differential equations. Ann Mat Pura Appl 169(2):321\u2013354","journal-title":"Ann Mat Pura Appl"},{"key":"850_CR18","doi-asserted-by":"publisher","unstructured":"Jagadish HV (1990) Linear clustering of objects with multiple attributes. In: Proceedings of the 1990 ACM SIGMOD international conference on management of data. Association for Computing Machinery, Atlantic City, New Jersey, USA, pp 332\u2013342. https:\/\/doi.org\/10.1145\/93597.98742","DOI":"10.1145\/93597.98742"},{"key":"850_CR19","doi-asserted-by":"publisher","unstructured":"Kamel I, Faloutsos C (1994) Hilbert R-tree: An improved R-tree using fractals. In: VLDB. Santiago de Chile, vol 94, pp 500\u2013509. https:\/\/doi.org\/10.1007\/3-540-63343-X_48","DOI":"10.1007\/3-540-63343-X_48"},{"key":"850_CR20","doi-asserted-by":"publisher","unstructured":"Kraska T, Beutel A, Chi EH, Dean J, Polyzotis N (2018) The case for learned index structures. In: Proceedings of the 2018 international conference on management of data, pp 489\u2013504. https:\/\/doi.org\/10.1145\/3183713.3196909","DOI":"10.1145\/3183713.3196909"},{"key":"850_CR21","unstructured":"Lee KC, Zheng B, Li H, Lee W-C (2007) Approaching the skyline in Z order. In: VLDB, vol 7, pp 279\u2013290"},{"key":"850_CR22","doi-asserted-by":"publisher","unstructured":"Li P, Lu H, Zheng Q, Yang L, Pan G (2020) LISA: A learned index structure for spatial data. In: Proceedings of the 2020 ACM SIGMOD international conference on management of data, pp 2119\u20132133. https:\/\/doi.org\/10.1145\/3318464.3389703","DOI":"10.1145\/3318464.3389703"},{"issue":"9","key":"850_CR23","doi-asserted-by":"publisher","first-page":"2158","DOI":"10.14778\/3598581.3598589","volume":"16","author":"J Li","year":"2023","unstructured":"Li J, Wang Z, Cong G, Long C, Kiah HM, Cui B (2023) Towards designing and learning piecewise space-filling curves. Proc VLDB Endow 16(9):2158\u20132171. https:\/\/doi.org\/10.14778\/3598581.3598589","journal-title":"Proc VLDB Endow"},{"issue":"3","key":"850_CR24","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1025196714293","volume":"7","author":"MF Mokbel","year":"2003","unstructured":"Mokbel MF, Aref WG, Kamel I (2003) Analysis of multi-dimensional space-filling curves. GeoInformatica 7(3):179\u2013209. https:\/\/doi.org\/10.1023\/A:1025196714293","journal-title":"GeoInformatica"},{"key":"850_CR25","unstructured":"Morton GM (1966) A computer oriented geodetic data base and a new technique in file sequencing. Technical Report IBM Technical Report, International Business Machines Corporation, Ottawa, Canada. IBM Canada Laboratory"},{"key":"850_CR26","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1145\/3318464.3380579","DOI":"10.1145\/3318464.3380579"},{"key":"850_CR27","doi-asserted-by":"publisher","unstructured":"Orenstein JA, Merrett TH (1984) A class of data structures for associative searching. In: Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on principles of database systems, pp 181\u2013190. https:\/\/doi.org\/10.1145\/588011.588037","DOI":"10.1145\/588011.588037"},{"issue":"12","key":"850_CR28","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.14778\/3407790.3407829","volume":"13","author":"J Qi","year":"2020","unstructured":"Qi J, Liu G, Jensen CS, Kulik L (2020) Effectively learning spatial indices. Proc VLDB Endow 13(12):2341\u20132354. https:\/\/doi.org\/10.14778\/3407790.3407829","journal-title":"Proc VLDB Endow"},{"key":"850_CR29","unstructured":"Ramsak F, Markl V, Fenk R, Zirkel M, Elhardt K, Bayer R (2000) Integrating the UB-tree into a database system kernel. In: VLDB, vol 2000, pp 263\u2013272"},{"key":"850_CR30","doi-asserted-by":"publisher","unstructured":"RaulAlexandruPersa A, Zacharatou C, Doraiswamy H, Boncz P, Kemper TNA (2020) Adaptive main-memory indexing for high-performance point-polygon joins. https:\/\/doi.org\/10.1145\/2447481.2447485","DOI":"10.1145\/2447481.2447485"},{"key":"850_CR31","doi-asserted-by":"publisher","unstructured":"Robinson JT (1981) The KDB-tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of the 1981 ACM SIGMOD international conference on management of data, pp 10\u201318. https:\/\/doi.org\/10.1145\/582318.582321","DOI":"10.1145\/582318.582321"},{"key":"850_CR32","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"H Samet","year":"2006","unstructured":"Samet H (2006) Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers, San Francisco, CA, USA"},{"key":"850_CR33","unstructured":"Sellis T, Roussopoulos N, Faloutsos C (1987) The R$$^+$$-tree: A dynamic index for multi-dimensional objects. Technical report, Carnegie Mellon University"},{"key":"850_CR34","doi-asserted-by":"publisher","unstructured":"Sidlauskas D, Chester S, Zacharatou ET, Ailamaki A (2018) Improving spatial data processing by clipping minimum bounding boxes. In: 2018 IEEE 34th international conference on data engineering (ICDE). IEEE, pp 425\u2013436. https:\/\/doi.org\/10.1109\/ICDE.2018.00046","DOI":"10.1109\/ICDE.2018.00046"},{"issue":"6","key":"850_CR35","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.is.2004.12.001","volume":"31","author":"T Skopal","year":"2006","unstructured":"Skopal T, Kr\u00e1tk\u1ef3 M, Pokorn\u1ef3 J, Sn\u00e1\u0161el V (2006) A new range query algorithm for universal B-trees. Inf Syst 31(6):489\u2013511. https:\/\/doi.org\/10.1016\/j.is.2004.12.001","journal-title":"Inf Syst"},{"key":"850_CR36","doi-asserted-by":"publisher","unstructured":"Wang H, Fu X, Xu J, Lu H (2019) Learned index for spatial queries. In: 2019 20th IEEE international conference on mobile data management (MDM). IEEE, pp 569\u2013574. https:\/\/doi.org\/10.1109\/MDM.2019.00121","DOI":"10.1109\/MDM.2019.00121"},{"key":"850_CR37","unstructured":"Weber R, Schek H-J, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB, vol 98, pp 194\u2013205"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-026-00850-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-026-00850-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-026-00850-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T09:08:27Z","timestamp":1785402507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-026-00850-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,20]]},"references-count":37,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["850"],"URL":"https:\/\/doi.org\/10.1007\/s44443-026-00850-z","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,20]]},"assertion":[{"value":"1 February 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"440"}}