{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T21:29:28Z","timestamp":1774042168313,"version":"3.50.1"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["RS-2022-00155911"],"award-info":[{"award-number":["RS-2022-00155911"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.datak.2026.102577","type":"journal-article","created":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T00:25:25Z","timestamp":1770769525000},"page":"102577","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["When temporary results meet intermediate index: An optimization technique of procedural SQL query processing"],"prefix":"10.1016","volume":"164","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-5483-2341","authenticated-orcid":false,"given":"Md Arif","family":"Rahman","sequence":"first","affiliation":[]},{"given":"Syed Jalaluddin","family":"Hashmi","sequence":"additional","affiliation":[]},{"given":"Kethsiya","family":"Gnanajothy","sequence":"additional","affiliation":[]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.datak.2026.102577_b1","series-title":"Neo: A learned query optimizer","author":"Marcus","year":"2019"},{"key":"10.1016\/j.datak.2026.102577_b2","doi-asserted-by":"crossref","unstructured":"R. Marcus, P. Negi, H. Mao, N. Tatbul, M. Alizadeh, T. Kraska, Bao: Making learned query optimization practical, in: Proceedings of the 2021 International Conference on Management of Data, 2021, pp. 1275\u20131288.","DOI":"10.1145\/3448016.3452838"},{"key":"10.1016\/j.datak.2026.102577_b3","doi-asserted-by":"crossref","unstructured":"Z. Yang, W.-L. Chiang, S. Luan, G. Mittal, M. Luo, I. Stoica, Balsa: Learning a query optimizer without expert demonstrations, in: Proceedings of the 2022 International Conference on Management of Data, 2022, pp. 931\u2013944.","DOI":"10.1145\/3514221.3517885"},{"key":"10.1016\/j.datak.2026.102577_b4","series-title":"Lero: A learning-to-rank query optimizer","author":"Zhu","year":"2023"},{"key":"10.1016\/j.datak.2026.102577_b5","series-title":"GenJoin: Conditional generative Plan-to-Plan query optimizer that learns from subplan hints","author":"Sulimov","year":"2024"},{"key":"10.1016\/j.datak.2026.102577_b6","doi-asserted-by":"crossref","unstructured":"K. Park, H. Seo, M.K. Rasel, Y.-K. Lee, C. Jeong, S.Y. Lee, C. Lee, D.-H. Lee, Iterative Query Processing based on Unified Optimization Techniques, in: Proceedings of the 2019 International Conference on Management of Data, 2019, pp. 54\u201368.","DOI":"10.1145\/3299869.3324960"},{"issue":"2","key":"10.1016\/j.datak.2026.102577_b7","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/276305.276337","article-title":"AutoAdmin \u201cwhat-if\u201d index analysis utility","volume":"27","author":"Chaudhuri","year":"1998","journal-title":"ACM SIGMOD Rec."},{"key":"10.1016\/j.datak.2026.102577_b8","series-title":"Introducing HypoPG, hypothetical indexes for PostgreSQL","author":"Group","year":"2015"},{"key":"10.1016\/j.datak.2026.102577_b9","series-title":"Automatic indexing (DBMS_AUTO_INDEX) in oracle database 19c","author":"Oracle-Base","year":"2021"},{"key":"10.1016\/j.datak.2026.102577_b10","doi-asserted-by":"crossref","unstructured":"S. Das, M. Grbic, I. Ilic, I. Jovandic, A. Jovanovic, V.R. Narasayya, M. Radulovic, M. Stikic, G. Xu, S. Chaudhuri, Automatically indexing millions of databases in microsoft azure sql database, in: Proceedings of the 2019 International Conference on Management of Data, 2019, pp. 666\u2013679.","DOI":"10.1145\/3299869.3314035"},{"key":"10.1016\/j.datak.2026.102577_b11","series-title":"Advanced Compiler Design Implementation","author":"Muchnick","year":"1997"},{"key":"10.1016\/j.datak.2026.102577_b12","series-title":"Database Systems: The Complete Book","author":"Garcia-Molina","year":"2008"},{"key":"10.1016\/j.datak.2026.102577_b13","doi-asserted-by":"crossref","unstructured":"T. Fischer, D. Hirn, T. Grust, Snakes on a plan: Compiling python functions into plain SQL queries, in: Proceedings of the 2022 International Conference on Management of Data, 2022, pp. 2389\u20132392.","DOI":"10.1145\/3514221.3520175"},{"key":"10.1016\/j.datak.2026.102577_b14","series-title":"TPC BENCHMARKTM DS version 2.13.0","author":"Council","year":"2020"},{"issue":"8","key":"10.1016\/j.datak.2026.102577_b15","doi-asserted-by":"crossref","first-page":"1378","DOI":"10.14778\/3457390.3457402","article-title":"Procedural extensions of SQL: Understanding their usage in the wild","volume":"14","author":"Gupta","year":"2021","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.datak.2026.102577_b16","series-title":"2011 IEEE 27th International Conference on Data Engineering","first-page":"1284","article-title":"DBridge: A program rewrite tool for set-oriented query execution","author":"Chavan","year":"2011"},{"key":"10.1016\/j.datak.2026.102577_b17","doi-asserted-by":"crossref","unstructured":"K.V. Emani, K. Ramachandra, S. Bhattacharya, S. Sudarshan, Extracting equivalent sql from imperative code in database applications, in: Proceedings of the 2016 International Conference on Management of Data, 2016, pp. 1781\u20131796.","DOI":"10.1145\/2882903.2882926"},{"key":"10.1016\/j.datak.2026.102577_b18","doi-asserted-by":"crossref","unstructured":"S. Gupta, S. Purandare, K. Ramachandra, Aggify: Lifting the Curse of Cursor Loops using Custom Aggregates, in: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, 2020, pp. 559\u2013573.","DOI":"10.1145\/3318464.3389736"},{"issue":"4","key":"10.1016\/j.datak.2026.102577_b19","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1145\/3186728.3164140","article-title":"Froid: Optimization of imperative programs in a relational database","volume":"11","author":"Ramachandra","year":"2017","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.datak.2026.102577_b20","series-title":"2014 IEEE 30th International Conference on Data Engineering","first-page":"532","article-title":"Decorrelation of user defined function invocations in queries","author":"Simhadri","year":"2014"},{"issue":"4","key":"10.1016\/j.datak.2026.102577_b21","doi-asserted-by":"crossref","first-page":"759","DOI":"10.3390\/electronics13040759","article-title":"Forester: Approximate processing of an imperative procedure for Query-Time exploratory data analysis in a relational database","volume":"13","author":"Rahman","year":"2024","journal-title":"Electronics"},{"key":"10.1016\/j.datak.2026.102577_b22","unstructured":"M.A. Rahman, Y.-K. Lee, Iterative Skyline Query Processing using Rule-based Optimization Techniques, in: Korean DataBase Conference 2025, Vol. 27, 2025."},{"key":"10.1016\/j.datak.2026.102577_b23","series-title":"The 10th International Conference on Big Data Applications and Services","first-page":"143","article-title":"AutoCache: Efficient execution of UDF through the detection of cached variables for the analytical analysis on federated databases","volume":"Vol. 10","author":"Rahman","year":"2022"},{"issue":"12","key":"10.1016\/j.datak.2026.102577_b24","doi-asserted-by":"crossref","first-page":"1770","DOI":"10.14778\/2824032.2824074","article-title":"Query optimization in Oracle 12c database in-memory","volume":"8","author":"Das","year":"2015","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.datak.2026.102577_b25","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1016\/j.ins.2022.08.051","article-title":"Automatic index selection with learned cost estimator","volume":"612","author":"Gao","year":"2022","journal-title":"Inform. Sci."},{"issue":"11","key":"10.1016\/j.datak.2026.102577_b26","doi-asserted-by":"crossref","first-page":"3126","DOI":"10.14778\/3551793.3551857","article-title":"Tiresias: enabling predictive autonomous storage and indexing","volume":"15","author":"Abebe","year":"2022","journal-title":"Proc. VLDB Endow."},{"issue":"12","key":"10.1016\/j.datak.2026.102577_b27","doi-asserted-by":"crossref","first-page":"2382","DOI":"10.14778\/3407790.3407832","article-title":"Magic mirror in my hand, which is the best in the land? an experimental evaluation of index selection algorithms","volume":"13","author":"Kossmann","year":"2020","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.datak.2026.102577_b28","series-title":"Similarity Search and Applications - 14th International Conference, SISAP 2021, Dortmund, Germany, September 29 - October 1, 2021, Proceedings","first-page":"95","article-title":"Towards a learned index structure for approximate nearest neighbor search query processing","volume":"Vol. 13058","author":"H\u00fcnem\u00f6rder","year":"2021"},{"key":"10.1016\/j.datak.2026.102577_b29","series-title":"Em-K indexing for approximate query matching in Large-scale ER","author":"Herath","year":"2021"},{"issue":"2","key":"10.1016\/j.datak.2026.102577_b30","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1109\/TVCG.2018.2869149","article-title":"PANENE: A progressive algorithm for indexing and querying approximate k-Nearest neighbors","volume":"26","author":"Jo","year":"2020","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"10.1016\/j.datak.2026.102577_b31","series-title":"Web Technologies and Applications - 13th Asia-Pacific Web Conference, APWeb 2011, Beijing, China, April 18-20, 2011. Proceedings","first-page":"155","article-title":"Efficient approximate top-k query algorithm using cube index","volume":"Vol. 6612","author":"Chen","year":"2011"},{"key":"10.1016\/j.datak.2026.102577_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.116956","article-title":"Join optimization for inverted index technique on relational database management systems","volume":"198","author":"Shin","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.datak.2026.102577_b33","series-title":"28th Conference of Open Innovations Association, FRUCT 2021, Moscow, Russia, January 27-29, 2021","first-page":"215","article-title":"Relational data index consolidation","author":"Kvet","year":"2021"},{"issue":"3","key":"10.1016\/j.datak.2026.102577_b34","first-page":"220","article-title":"Efficient of bitmap join indexes for optimising star join queries in relational data warehouses","volume":"9","author":"Yahyaoui","year":"2020","journal-title":"Int. J. Comput. Intell. Stud."},{"issue":"2","key":"10.1016\/j.datak.2026.102577_b35","doi-asserted-by":"crossref","first-page":"119","DOI":"10.3233\/ICA-160534","article-title":"Novel visual information indexing in relational databases","volume":"24","author":"Korytkowski","year":"2017","journal-title":"Integr. Comput. Aided Eng."},{"key":"10.1016\/j.datak.2026.102577_b36","series-title":"2018 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2018, Rio de Janeiro, Brazil, July 8-13, 2018","first-page":"1","article-title":"Indexes for necessity queries. Implementation and performance evaluation on a fuzzy Object-Relational database management system","author":"Medina","year":"2018"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X26000248?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X26000248?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T19:46:37Z","timestamp":1774035997000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X26000248"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":36,"alternative-id":["S0169023X26000248"],"URL":"https:\/\/doi.org\/10.1016\/j.datak.2026.102577","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"When temporary results meet intermediate index: An optimization technique of procedural SQL query processing","name":"articletitle","label":"Article Title"},{"value":"Data & Knowledge Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.datak.2026.102577","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102577"}}