{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:16:20Z","timestamp":1776122180652,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T00:00:00Z","timestamp":1727222400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T00:00:00Z","timestamp":1727222400000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10115-024-02233-0","type":"journal-article","created":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T20:46:20Z","timestamp":1727297180000},"page":"497-519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learned index for non-key queries"],"prefix":"10.1007","volume":"67","author":[{"given":"Rui","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,25]]},"reference":[{"key":"2233_CR1","doi-asserted-by":"crossref","unstructured":"Zhang H, Andersen DG, Pavlo A, Kaminsky M, Ma L, Shen R (2016) Reducing the storage overhead of main-memory OLTP databases with hybrid indexes. In: Proceedings of the 2016 international conference on management of data, pp 1567\u20131581","DOI":"10.1145\/2882903.2915222"},{"key":"2233_CR2","doi-asserted-by":"crossref","unstructured":"Kraska T, Beutel A, Chi EH, Dean J, Polyzotis N (2018) The case for learned index structures. In: SIGMOD conference, pp 489\u2013504","DOI":"10.1145\/3183713.3196909"},{"issue":"4","key":"2233_CR3","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10791-015-9257-z","volume":"18","author":"Y Lv","year":"2015","unstructured":"Lv Y, Zhai C (2015) Negative query generation: bridging the gap between query likelihood retrieval models and relevance. Inf Retr J 18(4):359\u2013378","journal-title":"Inf Retr J"},{"key":"2233_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer D (1979) Ubiquitous B-Tree. ACM Comput Surv (CSUR) 11:121\u2013137","journal-title":"ACM Comput Surv (CSUR)"},{"key":"2233_CR5","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:422\u2013426","journal-title":"Commun ACM"},{"key":"2233_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45:5\u201332","journal-title":"Mach Learn"},{"key":"2233_CR7","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman JH (2001) Greedy function approximation: a gradient boosting machine. Ann Stat 29:1189\u20131232","journal-title":"Ann Stat"},{"key":"2233_CR8","doi-asserted-by":"crossref","unstructured":"Ding J, Minhas UF, Yu J et al. (2020) ALEX: an updatable adaptive learned index. In: Proceedings of the 2020 ACM SIGMOD international conference on management of data, pp 969\u2013984","DOI":"10.1145\/3318464.3389711"},{"key":"2233_CR9","unstructured":"Li P, Hua Y, Zuo P, et al. (2019) A scalable learned index scheme in storage systems. arXiv preprint arXiv:1905.06256"},{"key":"2233_CR10","unstructured":"Rao J, Ross KA (1999) Cache conscious indexing for decision-support in main memory. In: Proceedings of the 25th international conference on very large data base, pp 78\u201389"},{"key":"2233_CR11","doi-asserted-by":"crossref","unstructured":"Kaczmarski K (2012) B+-tree optimized for GPGPU. In: On the move to meaningful internet systems: OTM 2012: confederated international conferences: CoopIS, DOA-SVI, and ODBASE 2012, Rome, Italy, September 10\u201314 Proceedings. Part II, Springer, Berlin Heidelberg, p 2012","DOI":"10.1007\/978-3-642-33615-7_27"},{"key":"2233_CR12","doi-asserted-by":"crossref","unstructured":"Kim C, Chhugani J, Satish N et al. (2010) FAST: fast architecture sensitive tree search on modern CPUs and GPUs. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data, pp 339\u2013350","DOI":"10.1145\/1807167.1807206"},{"key":"2233_CR13","doi-asserted-by":"crossref","unstructured":"Shahvarani A, Jacobsen HA (2016) A hybrid B+-Tree as solution for in-memory indexing on CPU-GPU heterogeneous computing platforms. In: Proceedings of the 2016 international conference on management of data, pp 1523\u20131538","DOI":"10.1145\/2882903.2882918"},{"key":"2233_CR14","unstructured":"Boehm M, Schlegel B, Volk PB et al. (2011) Efficient in-memory indexing with generalized prefix trees. In: Datenbanksysteme f\u00fcr Business, Technologie und Web (BTW)"},{"key":"2233_CR15","doi-asserted-by":"crossref","unstructured":"Zukowski M, Heman S, Nes N et al. (2006) Super-scalar RAM-CPU cache compression. In: 22nd international conference on data engineering, pp 59\u201359","DOI":"10.1109\/ICDE.2006.150"},{"key":"2233_CR16","unstructured":"Galakatos A, Markovitch M, Binnig C, Fonseca R, Kraska T (2018) A-Tree: a bounded approximate index structure. CoRR arXiv:abs\/1801.10207"},{"key":"2233_CR17","doi-asserted-by":"crossref","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","DOI":"10.1145\/1734663.1734671"},{"key":"2233_CR18","doi-asserted-by":"crossref","unstructured":"Galakatos A, Markovitch M, Binnig C, et al. (2019) Fiting-tree: a data-aware index structure. In: Proceedings of the 2019 international conference on management of data, pp 1189\u20131206","DOI":"10.1145\/3299869.3319860"},{"key":"2233_CR19","doi-asserted-by":"crossref","unstructured":"Ferragina P, Vinciguerra G (2020) The PGM-index: a fully-dynamic compressed learned index with provable worst-case bounds. In: Proceedings of the VLDB endowment, pp 1162\u20131175","DOI":"10.14778\/3389133.3389135"},{"key":"2233_CR20","doi-asserted-by":"crossref","unstructured":"Kipf A, Marcus R, van Renen A, Stoian M, Kemper A, Kraska T, Neumann T (2020) RadixSpline: a single-pass learned index. In: Proceedings of the third international workshop on exploiting artificial intelligence techniques for data management, pp 1\u20135","DOI":"10.1145\/3401071.3401659"},{"key":"2233_CR21","doi-asserted-by":"crossref","unstructured":"Setiawan NF, Rubinstein BIP, Borovica-Gajic R (2020) Function interpolation for learned index structures. In: Borovica-Gajic R, Qi J, Wang W (eds) Australasian database conference 2020, LNCS, vol 12008. Springer, Cham, Heidelberg, pp 68\u201380","DOI":"10.1007\/978-3-030-39469-1_6"},{"key":"2233_CR22","doi-asserted-by":"crossref","unstructured":"Tang C, Wang Y, Dong Z et al. (2020) XIndex: a scalable learned index for multicore data storage. In: Proceedings of the 25th ACM SIGPLAN symposium on principles and practice of parallel programming, pp 308\u2013320","DOI":"10.1145\/3332466.3374547"},{"key":"2233_CR23","unstructured":"Abu-Libdeh H, Alt\u0131nb\u00fcken D, Beutel A, Chi EH, Doshi L, Kraska T et al. (2020) Learned indexes for a google-scale disk-based database. arXiv preprint arXiv:2012.12501"},{"key":"2233_CR24","doi-asserted-by":"crossref","unstructured":"Boffa A, Ferragina P, Vinciguerra G (2021) A \u201cLearned\u201d approach to quicken and compress rank\/select dictionaries. In: Proceedings of the workshop on algorithm engineering and experiments (ALENEX), pp 46\u201359","DOI":"10.1137\/1.9781611976472.4"},{"key":"2233_CR25","doi-asserted-by":"crossref","unstructured":"Ding J, Nathan V, Alizadeh M, Kraska T (2020) Tsunami: a learned multi-dimensional index for correlated data and skewed workloads. arXiv preprint arXiv:2006.13282","DOI":"10.14778\/3425879.3425880"},{"key":"2233_CR26","unstructured":"Ho D, Ding J, Misra S, Tatbul N, Nathan V, Md V, Kraska T (2019) LISA: towards learned DNA sequence search. arXiv preprint arXiv:1910.04728"},{"key":"2233_CR27","unstructured":"Macke S, Beutel A, Kraska T, Sathiamoorthy M, Cheng DZ, Chi EH (2018) Lifting the curse of multidimensional data with learned existence indexes. In: Workshop on ML for systems at NeurIPS, pp 1\u20136"},{"key":"2233_CR28","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":"2233_CR29","first-page":"1928","volume":"71","author":"H Byun","year":"2021","unstructured":"Byun H, Lim H (2021) Learned FBF: learning-based functional bloom filter for key-value storage. IEEE Trans Comput 71:1928\u20131938","journal-title":"IEEE Trans Comput"},{"key":"2233_CR30","doi-asserted-by":"crossref","unstructured":"Bhattacharya A, Bedathur S, Bagchi A (2020) Adaptive learned bloom filters under incremental workloads. In: Proceedings of the 7th ACM IKDD CoDS and 25th COMAD, pp 107\u2013115","DOI":"10.1145\/3371158.3371171"},{"key":"2233_CR31","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 (2020) Stable learned bloom filters for data streams. Proc VLDB Endow 13:2355\u20132367","journal-title":"Proc VLDB Endow"},{"key":"2233_CR32","unstructured":"Vaidya K, Knorr E, Mitzenmacher M, Kraska T (2020) Partitioned learned bloom filters. In: International conference on learning representations"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02233-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-024-02233-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02233-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:04:47Z","timestamp":1738325087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-024-02233-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,25]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["2233"],"URL":"https:\/\/doi.org\/10.1007\/s10115-024-02233-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,25]]},"assertion":[{"value":"19 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 September 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":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}