Journal article · 2026 · Open access
Learning Execution Plan Embeddings for Multi-Dimensional Query Resource Prediction
IEEE Access, 14, 37131–37150 · Published 1 January 2026 · DOI 10.1109/access.2026.3670242
In brief
“Learning Execution Plan Embeddings for Multi-Dimensional Query Resource Prediction” is a 2026 journal article by Mahendran Vasagam and 2 co-authors, published in IEEE Access. OpenAlex counts 72 citations as of 18 November 2026, which puts it in the top 1% of works published in 2026 by citations. It is open access under a CC BY licence: the full text is free to read at IEEE Access.
- Citations
- 72
- Most cited in
- 2026 (72)
- Field-weighted impact
- 189.50
- References
- 17
- Authors
- 3
Abstract
Multi-cluster query engines are common in production, but routing queries to appropriately-sized clusters remains an unsolved problem. Current approaches like round-robin, hash-based routing, or manual rules waste resources when simple queries land on oversized clusters and cause failures when complex queries hit undersized ones. Production systems experience resource mismatch failures, requiring manual workarounds such as migrating problematic queries to separate engines. We address this with a system for intelligent cluster sizing using learned execution plan embeddings to predict query resource requirements. Instead of analyzing query text, we vectorize execution plan structure and search for similar historical queries, predicting memory, Central Processing Unit (CPU) and runtime based on actual past performance rather than unreliable optimizer estimates. We employ a tiered inference strategy that supports fast, feature-based vectors (10 basic dimensions; 13–23 ms overhead), gradient boosting with enhanced features (24 dimensions; 76.5% accuracy), and graph neural network embeddings for complex queries (78.1% accuracy). An adaptive classifier maps predictions to cluster sizes using thresholds that adjust based on observed utilization patterns. Unfamiliar queries are routed conservatively, and the system automatically improves from observed outcomes. Empirical validation on 2,954 queries from a Trino deployment shows 98.8–99.8% within-one-size accuracy and 74.8–76.5% exact-match routing. In benchmark workloads, our approach reduces out-of-memory failures by 82% and infrastructure costs by 33%, with less than 51 ms of routing overhead. Gradient boosting achieves 76.5% accuracy, while graph neural networks reach 78.1% for complex join structures.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Vasagam, M., Kumar, A., & Garg, A. (2026). Learning Execution Plan Embeddings for Multi-Dimensional Query Resource Prediction. IEEE Access, 14, 37131–37150. https://doi.org/10.1109/access.2026.3670242
MLA 9
Vasagam, Mahendran, et al. “Learning Execution Plan Embeddings for Multi-Dimensional Query Resource Prediction.” IEEE Access, vol. 14, 2026, pp. 37131–37150. https://doi.org/10.1109/access.2026.3670242.
Chicago
Vasagam, Mahendran, Ashok Kumar, and Anshul Garg. 2026. “Learning Execution Plan Embeddings for Multi-Dimensional Query Resource Prediction.” IEEE Access 14: 37131–37150. https://doi.org/10.1109/access.2026.3670242.
Harvard
Vasagam, M., Kumar, A. and Garg, A. (2026) ‘Learning Execution Plan Embeddings for Multi-Dimensional Query Resource Prediction’, IEEE Access, 14, pp. 37131–37150. doi:10.1109/access.2026.3670242.
IEEE
M. Vasagam, A. Kumar, and A. Garg, “Learning Execution Plan Embeddings for Multi-Dimensional Query Resource Prediction,” IEEE Access, vol. 14, pp. 37131–37150, 2026, doi: 10.1109/access.2026.3670242.
BibTeX
@article{vasagam2026learning,
title = {{Learning Execution Plan Embeddings for Multi-Dimensional Query Resource Prediction}},
author = {Vasagam, Mahendran and Kumar, Ashok and Garg, Anshul},
journal = {IEEE Access},
year = {2026},
volume = {14},
pages = {37131--37150},
doi = {10.1109/access.2026.3670242},
url = {https://doi.org/10.1109/access.2026.3670242}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Information Systems › Advanced Database Systems and Queries
- query routing
- Trino
- graph neural networks
- gradient boosting
- memory estimation
- adaptive classifier
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Vasagam, M., Kumar, A., & Garg, A. (2026). Learning Execution Plan Embeddings for Multi-Dimensional Query Resource Prediction. IEEE Access, 14, 37131–37150. https://doi.org/10.1109/access.2026.3670242
How many times has this paper been cited?
72 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at IEEE Access: sign in and open the full text from this page.
Who wrote this paper?
Mahendran Vasagam, Ashok Kumar, Anshul Garg.
What is the DOI of this paper?
10.1109/access.2026.3670242, permanently at https://doi.org/10.1109/access.2026.3670242. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.