{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T11:11:52Z","timestamp":1781781112098,"version":"3.54.5"},"reference-count":93,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00778-024-00893-6","type":"journal-article","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T03:25:34Z","timestamp":1737429934000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["How good are multi-dimensional learned indexes? An experimental survey"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1475-2732","authenticated-orcid":false,"given":"Qiyu","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maocheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuxiang","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanyan","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,21]]},"reference":[{"key":"893_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional space. In: ICDT 2001, Proceedings 8, pp. 420\u2013434. Springer (2001)","DOI":"10.1007\/3-540-44503-X_27"},{"key":"893_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS, pp. 459\u2013468. IEEE Computer Society (2006)","DOI":"10.1109\/FOCS.2006.49"},{"key":"893_CR3","unstructured":"ANN Project: http:\/\/www.cs.umd.edu\/~mount\/ANN\/. Accessed: 2024-04-15"},{"key":"893_CR4","doi-asserted-by":"crossref","unstructured":"Arge, L., de\u00a0Berg, M., Haverkort, H.J., Yi, K.: The priority r-tree: a practically efficient and worst-case optimal r-tree. ACM Trans. Algorithms 4(1), 9:1\u20139:30 (2008)","DOI":"10.1145\/1328911.1328920"},{"key":"893_CR5","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: SODA, pp. 1027\u20131035. SIAM (2007)"},{"issue":"6","key":"893_CR6","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM (JACM) 45(6), 891\u2013923 (1998)","journal-title":"J. ACM (JACM)"},{"key":"893_CR7","doi-asserted-by":"crossref","unstructured":"Aum\u00fcller, M., Bernhardsson, E., Faithfull, A.: Ann-benchmarks: a benchmarking tool for approximate nearest neighbor algorithms. Inf. Syst. 87, 101374 (2020)","DOI":"10.1016\/j.is.2019.02.006"},{"key":"893_CR8","unstructured":"Apache Spark. https:\/\/spark.apache.org\/. Accessed: 2024-04-15"},{"key":"893_CR9","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD Conference, pp. 322\u2013331. ACM Press (1990)","DOI":"10.1145\/93605.98741"},{"issue":"9","key":"893_CR10","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":"893_CR11","doi-asserted-by":"crossref","unstructured":"Boffa, A., Ferragina, P., Vinciguerra, G.: A \"learned\" approach to quicken and compress rank\/select dictionaries. In: ALENEX, pp. 46\u201359. SIAM (2021)","DOI":"10.1137\/1.9781611976472.4"},{"key":"893_CR12","unstructured":"Boost Geometry. http:\/\/boost.org\/libs\/geometry"},{"key":"893_CR13","unstructured":"B\u00f6rzs\u00f6nyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp. 421\u2013430. IEEE Computer Society (2001)"},{"issue":"3","key":"893_CR14","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/328939.328959","volume":"24","author":"T Bozkaya","year":"1999","unstructured":"Bozkaya, T., Ozsoyoglu, M.: Indexing large metric spaces for similarity search queries. ACM Trans. Database Syst. (TODS) 24(3), 361\u2013404 (1999)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"893_CR15","doi-asserted-by":"crossref","unstructured":"Chen, H., Chiang, R.H., Storey, V.C.: Business intelligence and analytics: from big data to big impact. MIS Q. 1165\u20131188 (2012)","DOI":"10.2307\/41703503"},{"key":"893_CR16","doi-asserted-by":"crossref","unstructured":"Chen, L., Gao, Y., Zheng, B., Jensen, C.S., Yang, H., Yang, K.: Pivot-based metric indexing. Proc. VLDB Endow. 10(10) (2017)","DOI":"10.14778\/3115404.3115411"},{"issue":"9","key":"893_CR17","doi-asserted-by":"publisher","first-page":"2175","DOI":"10.1109\/TPAMI.2013.18","volume":"35","author":"Q Chen","year":"2013","unstructured":"Chen, Q., Li, D., Tang, C.K.: Knn matting. IEEE Trans. Pattern Anal. Mach. Intell. 35(9), 2175\u20132188 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"893_CR18","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: SCG, pp. 253\u2013262. ACM (2004)","DOI":"10.1145\/997817.997857"},{"key":"893_CR19","unstructured":"Davitkova, A., Milchevski, E., Michel, S.: The ML-index: a multidimensional, learned index for point, range, and nearest-neighbor queries. In: EDBT, pp. 407\u2013410. OpenProceedings.org (2020)"},{"key":"893_CR20","doi-asserted-by":"crossref","unstructured":"Ding, J., Minhas, U.F., Yu, J., Wang, C., Do, J., Li, Y., Zhang, H., Chandramouli, B., Gehrke, J., Kossmann, D., Lomet, D.B., Kraska, T.: ALEX: an updatable adaptive learned index. In: SIGMOD Conference, pp. 969\u2013984. ACM (2020)","DOI":"10.1145\/3318464.3389711"},{"issue":"2","key":"893_CR21","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.: Tsunami: a learned multi-dimensional index for correlated data and skewed workloads. Proc. VLDB Endow. 14(2), 74\u201386 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"893_CR22","unstructured":"Daily Historical Stock Prices. https:\/\/www.kaggle.com\/ehallmar\/daily-historical-stock-prices-1970-2018. Accessed: 2024-10-11"},{"key":"893_CR23","doi-asserted-by":"crossref","unstructured":"Faghmous, J.H., Kumar, V.: Spatio-temporal data mining for climate data: advances, challenges, and opportunities. In: Data mining and knowledge discovery for big data, pp. 83\u2013116. Springer (2014)","DOI":"10.1007\/978-3-642-40837-3_3"},{"key":"893_CR24","unstructured":"Ferragina, P., Lillo, F., Vinciguerra, G.: Why are learned indexes so effective? In: ICML. Proceedings of Machine Learning Research, vol. 119, pp. 3123\u20133132. PMLR (2020)"},{"issue":"8","key":"893_CR25","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.14778\/3389133.3389135","volume":"13","author":"P Ferragina","year":"2020","unstructured":"Ferragina, P., Vinciguerra, G.: The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds. Proc. VLDB Endow. 13(8), 1162\u20131175 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"893_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees a data structure for retrieval on composite keys. Acta Inf. 4, 1\u20139 (1974)","journal-title":"Acta Inf."},{"key":"893_CR27","unstructured":"FourSquare Data. https:\/\/sites.google.com\/site\/yangdingqi\/home\/foursquare-dataset. Accessed: 2024-04-15"},{"issue":"10","key":"893_CR28","doi-asserted-by":"publisher","first-page":"2605","DOI":"10.14778\/3603581.3603598","volume":"16","author":"J Gao","year":"2023","unstructured":"Gao, J., Cao, X., Yao, X., Zhang, G., Wang, W.: LMSFC: a novel multidimensional index based on learned monotonic space filling curves. Proc. VLDB Endow. 16(10), 2605\u20132617 (2023)","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"893_CR29","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1109\/TPAMI.2013.240","volume":"36","author":"T Ge","year":"2014","unstructured":"Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization. IEEE Trans. Pattern Anal. Mach. Intell. 36(4), 744\u2013755 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"893_CR30","unstructured":"GEOS. https:\/\/github.com\/libgeos\/geos. Accessed: 2024-04-15"},{"key":"893_CR31","unstructured":"gperftools: https:\/\/github.com\/gperftools\/gperftools. Accessed: 2024-04-15"},{"key":"893_CR32","unstructured":"Gu, T., Feng, K., Cong, G., Long, C., Wang, Z., Wang, S.: The RLR-tree: a reinforcement learning based r-tree for spatial data. arXiV:2103.04541 (2021)"},{"key":"893_CR33","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD Conference, pp. 47\u201357. ACM Press (1984)","DOI":"10.1145\/971697.602266"},{"key":"893_CR34","unstructured":"Hadian, A., Kumar, A., Heinis, T.: Hands-off model integration in spatial index structures. In: AIDB@VLDB (2020)"},{"key":"893_CR35","doi-asserted-by":"crossref","unstructured":"Haider, C.M.R., Wang, J., Aref, W.G., et\u00a0al.: The \u201cai+ r\u201d-tree: An instance-optimized r-tree. In: 2022 23rd IEEE International Conference on Mobile Data Management (MDM), pp. 9\u201318. IEEE (2022)","DOI":"10.1109\/MDM55031.2022.00023"},{"key":"893_CR36","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: SIGMOD Conference, pp. 237\u2013248. ACM Press (1998)","DOI":"10.1145\/276304.276326"},{"key":"893_CR37","doi-asserted-by":"crossref","unstructured":"Huber, P.J.: Robust estimation of a location parameter. In: Breakthroughs in Statistics: Methodology and Distribution, pp. 492\u2013518. Springer (1992)","DOI":"10.1007\/978-1-4612-4380-9_35"},{"issue":"2","key":"893_CR38","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K., Yu, C., Zhang, R.: iDistance: an adaptive B$$ ^{\\text{+ }}$$-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. 30(2), 364\u2013397 (2005)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"893_CR39","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H J\u00e9gou","year":"2011","unstructured":"J\u00e9gou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33(1), 117\u2013128 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"893_CR40","unstructured":"Kamel, I., Faloutsos, C.: Hilbert R-tree: an improved R-tree using fractals. In: VLDB, pp. 500\u2013509. Morgan Kaufmann (1994)"},{"key":"893_CR41","doi-asserted-by":"crossref","unstructured":"Kanth, K.V.R., Ravada, S., Abugov, D.: Quadtree and r-tree indexes in oracle spatial: a comparison using GIS data. In: SIGMOD Conference, pp. 546\u2013557. ACM (2002)","DOI":"10.1145\/564691.564755"},{"key":"893_CR42","doi-asserted-by":"crossref","unstructured":"Kipf, A., Marcus, R., van Renen, A., Stoian, M., Kemper, A., Kraska, T., Neumann, T.: Radixspline: a single-pass learned index. In: aiDM@SIGMOD, pp. 5:1\u20135:5. ACM (2020)","DOI":"10.1145\/3401071.3401659"},{"key":"893_CR43","unstructured":"Kraska, T., Alizadeh, M., Beutel, A., Chi, E.H., Kristo, A., Leclerc, G., Madden, S., Mao, H., Nathan, V.: SageDB: a learned database system. In: CIDR. www.cidrdb.org (2019)"},{"key":"893_CR44","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: SIGMOD Conference, pp. 489\u2013504. ACM (2018)","DOI":"10.1145\/3183713.3196909"},{"key":"893_CR45","doi-asserted-by":"crossref","unstructured":"Kristo, A., Vaidya, K., \u00c7etintemel, U., Misra, S., Kraska, T.: The case for a learned sorting algorithm. In: SIGMOD Conference, pp. 1001\u20131016. ACM (2020)","DOI":"10.1145\/3318464.3389752"},{"key":"893_CR46","unstructured":"Leutenegger, S.T., Edgington, J.M., L\u00f3pez, M.A.: STR: A simple and efficient algorithm for R-tree packing. In: ICDE, pp. 497\u2013506. IEEE Computer Society (1997)"},{"key":"893_CR47","doi-asserted-by":"crossref","unstructured":"Li, P., Lu, H., Zheng, Q., Yang, L., Pan, G.: LISA: A learned index structure for spatial data. In: SIGMOD Conference, pp. 2119\u20132133. ACM (2020)","DOI":"10.1145\/3318464.3389703"},{"key":"893_CR48","doi-asserted-by":"crossref","unstructured":"Liu, H., Wang, R., Shan, S., Chen, X.: Deep supervised hashing for fast image retrieval. In: CVPR, pp. 2064\u20132072. IEEE Computer Society (2016)","DOI":"10.1109\/CVPR.2016.227"},{"key":"893_CR49","unstructured":"Liu, Q., Han, S., Qi, Y., Peng, J., Li, J., Lin, L., Chen, L.: Why are learned indexes so effective but sometimes ineffective? arXiv preprint arXiv:2410.00846 (2024)"},{"key":"893_CR50","doi-asserted-by":"crossref","unstructured":"Liu, Q., Shen, Y., Chen, L.: Hap: an efficient hamming space index based on augmented pigeonhole principle. In: Proceedings of the 2022 International Conference on Management of Data, pp. 917\u2013930 (2022)","DOI":"10.1145\/3514221.3517880"},{"issue":"11","key":"893_CR51","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(11), 2355\u20132367 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"893_CR52","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","volume":"45","author":"Y Malkov","year":"2014","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inf. Syst. 45, 61\u201368 (2014)","journal-title":"Inf. Syst."},{"issue":"4","key":"893_CR53","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2020","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2020)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"893_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14778\/3421424.3421425","volume":"14","author":"R Marcus","year":"2020","unstructured":"Marcus, R., Kipf, A., van Renen, A., Stoian, M., Misra, S., Kemper, A., Neumann, T., Kraska, T.: Benchmarking learned indexes. Proc. VLDB Endow. 14(1), 1\u201313 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"893_CR55","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: A model for learned bloom filters and optimizing by sandwiching. In: NeurIPS, pp. 462\u2013471 (2018)","DOI":"10.1007\/978-1-4614-8265-9_751"},{"key":"893_CR56","unstructured":"morton-nd: https:\/\/github.com\/morton-nd\/morton-nd. Accessed: 2024-04-15"},{"key":"893_CR57","unstructured":"nanoflann: https:\/\/github.com\/jlblancoc\/nanoflann"},{"key":"893_CR58","doi-asserted-by":"crossref","unstructured":"Nathan, V., Ding, J., Alizadeh, M., Kraska, T.: Learning multi-dimensional indexes. In: SIGMOD Conference, pp. 985\u20131000. ACM (2020)","DOI":"10.1145\/3318464.3380579"},{"issue":"1","key":"893_CR59","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. ACM Trans. Database Syst. 9(1), 38\u201371 (1984)","journal-title":"ACM Trans. Database Syst."},{"key":"893_CR60","unstructured":"Numpy: https:\/\/numpy.org\/"},{"key":"893_CR61","unstructured":"NYC Yellow Taxi Trip Data: https:\/\/www.kaggle.com\/datasets\/elemento\/nyc-yellow-taxi-trip-data. Accessed: 2024-10-11"},{"issue":"9","key":"893_CR62","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1145\/358746.358758","volume":"24","author":"J O\u2019Rourke","year":"1981","unstructured":"O\u2019Rourke, J.: An on-line algorithm for fitting straight lines between data ranges. Commun. ACM 24(9), 574\u2013578 (1981)","journal-title":"Commun. ACM"},{"key":"893_CR63","unstructured":"OpenStreet Map: https:\/\/planet.openstreetmap.org. Accessed: 2024-04-15"},{"key":"893_CR64","doi-asserted-by":"crossref","unstructured":"Pai, S., Mathioudakis, M., Wang, Y.: Wazi: A learned and workload-aware z-index. In: EDBT, pp. 559\u2013571 (2024)","DOI":"10.1002\/9783527843435.index"},{"issue":"11","key":"893_CR65","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.14778\/3236187.3236213","volume":"11","author":"V Pandey","year":"2018","unstructured":"Pandey, V., Kipf, A., Neumann, T., Kemper, A.: How good are modern spatial analytics systems? Proc. VLDB Endow. 11(11), 1661\u20131673 (2018)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"893_CR66","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/s41019-020-00147-9","volume":"6","author":"V Pandey","year":"2021","unstructured":"Pandey, V., van Renen, A., Kipf, A., Kemper, A.: How good are modern spatial libraries? Data Sci. Eng. 6(2), 192\u2013208 (2021)","journal-title":"Data Sci. Eng."},{"key":"893_CR67","unstructured":"PostgreSQL: Postgresql: The world\u2019s most advanced open source relational database. Web resource: https:\/\/www.postgresql.org\/ (2021)"},{"key":"893_CR68","unstructured":"PyTorch: https:\/\/pytorch.org\/"},{"issue":"11","key":"893_CR69","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, C.S., Kulik, L.: Effectively learning spatial indices. Proc. VLDB Endow. 13(11), 2341\u20132354 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"893_CR70","doi-asserted-by":"crossref","unstructured":"Qi, J., Tao, Y., Chang, Y., Zhang, R.: Packing R-trees with space-filling curves: theoretical optimality, empirical efficiency, and bulk-loading parallelizability. ACM Trans. Database Syst. 45(3), 14:1\u201314:47 (2020)","DOI":"10.1145\/3397506"},{"key":"893_CR71","unstructured":"Ramsak, F., Markl, V., Fenk, R., Zirkel, M., Elhardt, K., Bayer, R.: Integrating the UB-tree into a database system kernel. In: VLDB, pp. 263\u2013272. Morgan Kaufmann (2000)"},{"key":"893_CR72","doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: 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 (1981)","DOI":"10.1145\/582318.582321"},{"issue":"1","key":"893_CR73","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3485126","volume":"55","author":"V Rosenfeld","year":"2022","unstructured":"Rosenfeld, V., Bre\u00df, S., Markl, V.: Query processing on heterogeneous CPU\/GPU systems. ACM Comput. Surv. (CSUR) 55(1), 1\u201338 (2022)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"11","key":"893_CR74","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.1038\/nn.3839","volume":"17","author":"TJ Sejnowski","year":"2014","unstructured":"Sejnowski, T.J., Churchland, P.S., Movshon, J.A.: Putting big data to good use in neuroscience. Nat. Neurosci. 17(11), 1440\u20131441 (2014)","journal-title":"Nat. Neurosci."},{"issue":"8","key":"893_CR75","doi-asserted-by":"publisher","first-page":"1992","DOI":"10.14778\/3594512.3594528","volume":"16","author":"Z Sun","year":"2023","unstructured":"Sun, Z., Zhou, X., Li, G.: Learned index: A comprehensive experimental evaluation. Proc. VLDB Endow. 16(8), 1992\u20132004 (2023)","journal-title":"Proc. VLDB Endow."},{"issue":"13","key":"893_CR76","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.14778\/3007263.3007310","volume":"9","author":"M Tang","year":"2016","unstructured":"Tang, M., Yu, Y., Malluhi, Q.M., Ouzzani, M., Aref, W.G.: LocationSpark: a distributed in-memory data management system for big spatial data. Proc. VLDB Endow. 9(13), 1565\u20131568 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"893_CR77","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Sun, J.: The TPR*-tree: an optimized spatio-temporal access method for predictive queries. In: VLDB, pp. 790\u2013801. Morgan Kaufmann (2003)","DOI":"10.1016\/B978-012722442-8\/50075-6"},{"key":"893_CR78","unstructured":"Tensorflow: https:\/\/www.tensorflow.org\/"},{"key":"893_CR79","unstructured":"Toronto3D Data: https:\/\/github.com\/WeikaiTan\/Toronto-3D. Accessed: 2024-04-15"},{"key":"893_CR80","unstructured":"TPC-H Homepage: http:\/\/www.tpc.org\/tpch\/. Accessed: 2024-10-11"},{"key":"893_CR81","doi-asserted-by":"crossref","unstructured":"Wang, H., Fu, X., Xu, J., Lu, H.: Learned index for spatial queries. In: MDM, pp. 569\u2013574. IEEE (2019)","DOI":"10.1109\/MDM.2019.00121"},{"issue":"4","key":"893_CR82","doi-asserted-by":"publisher","first-page":"171","DOI":"10.3390\/ijgi12040171","volume":"12","author":"L Wang","year":"2023","unstructured":"Wang, L., Hu, L., Fu, C., Yu, Y., Tang, P., Zhang, F., Liu, R.: SLBRIN: a spatial learned index based on brin. ISPRS Int. J. Geo Inf. 12(4), 171 (2023)","journal-title":"ISPRS Int. J. Geo Inf."},{"key":"893_CR83","doi-asserted-by":"crossref","unstructured":"Wang, N., Xu, J.: Spatial queries based on learned index. In: Spatial Data and Intelligence: First International Conference, SpatialDI 2020, Virtual Event, May 8\u20139, 2020, Proceedings 1, pp. 245\u2013257. Springer (2021)","DOI":"10.1007\/978-3-030-69873-7_18"},{"issue":"8","key":"893_CR84","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.14778\/3457390.3457393","volume":"14","author":"J Wu","year":"2021","unstructured":"Wu, J., Zhang, Y., Chen, S., Chen, Y., Wang, J., Xing, C.: Updatable learned index with precise positions. Proc. VLDB Endow. 14(8), 1276\u20131288 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"893_CR85","doi-asserted-by":"crossref","unstructured":"Xia, C., Lu, H., Ooi, B.C., Hu, J.: Gorder: An efficient method for KNN join processing. In: VLDB, pp. 756\u2013767. Morgan Kaufmann (2004)","DOI":"10.1016\/B978-012088469-8\/50067-X"},{"key":"893_CR86","doi-asserted-by":"crossref","unstructured":"Xie, D., Li, F., Yao, B., Li, G., Zhou, L., Guo, M.: Simba: Efficient in-memory spatial analytics. In: SIGMOD Conference, pp. 1071\u20131085. ACM (2016)","DOI":"10.1145\/2882903.2915237"},{"issue":"11","key":"893_CR87","first-page":"2185","volume":"30","author":"D Xu","year":"2018","unstructured":"Xu, D., Tsang, I.W., Zhang, Y.: Online product quantization. IEEE Trans. Knowl. Data Eng. 30(11), 2185\u20132198 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"893_CR88","doi-asserted-by":"crossref","unstructured":"Yang, Z., Chandramouli, B., Wang, C., Gehrke, J., Li, Y., Minhas, U.F., Larson, P., Kossmann, D., Acharya, R.: Qd-tree: Learning data layouts for big data analytics. In: SIGMOD Conference, pp. 193\u2013208. ACM (2020)","DOI":"10.1145\/3318464.3389770"},{"key":"893_CR89","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor. In: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, vol.\u00a066, p. 311. SIAM (1993)"},{"key":"893_CR90","doi-asserted-by":"crossref","unstructured":"Yu, J., Wu, J., Sarwat, M.: GeoSpark: a cluster computing framework for processing large-scale spatial data. In: SIGSPATIAL\/GIS, pp. 70:1\u201370:4. ACM (2015)","DOI":"10.1145\/2820783.2820860"},{"key":"893_CR91","unstructured":"Zeighami, S., Shahabi, C.: Theoretical analysis of learned database operations under distribution shift through distribution learnability. In: 41st ICML"},{"key":"893_CR92","unstructured":"Zeighami, S., Shahabi, C.: Towards establishing guaranteed error for learned database operations. In: The 12th ICLR"},{"issue":"1","key":"893_CR93","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1109\/TITS.2018.2815678","volume":"20","author":"L Zhu","year":"2019","unstructured":"Zhu, L., Yu, F.R., Wang, Y., Ning, B., Tang, T.: Big data analytics in intelligent transportation systems: A survey. IEEE Trans. Intell. Transp. Syst. 20(1), 383\u2013398 (2019)","journal-title":"IEEE Trans. Intell. Transp. Syst."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00893-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-024-00893-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-024-00893-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T07:32:26Z","timestamp":1744270346000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-024-00893-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,21]]},"references-count":93,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["893"],"URL":"https:\/\/doi.org\/10.1007\/s00778-024-00893-6","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,21]]},"assertion":[{"value":"15 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"17"}}