Oct 2026· Journal of Informatics and Web Engineering· 0 citations
TL;DR
A synthesized reference architecture for adaptive and learned query optimizers as a generic framework derived from prior system is presented, explaining on how the classical optimizer components can be enhanced through runtime monitoring integration and feedback mechanisms.
Abstract
As databases continue to grow and complexity there is an urgent need to achieve more efficient and faster query processing. This paper presents a technical review of methods that work towards optimization of various types of queries. It progresses by focusing on basic approaches like rules-based optimization and cost-based optimization. Based on this basis, the paper presents a synthesized reference architecture for adaptive and learned query optimizers as a generic framework derived from prior system. It explains on how the classical optimizer components can be enhanced through runtime monitoring integration and feedback mechanisms. From this perspective, it becomes possible to explain how learning modules and execution feedback should be added to the standard optimization pipelines instead of requiring any revolutionary changes in the current database systems. Next, various Adaptive Query Processing (AQP) approaches are reviewed to highlight their strengths and limitations. A fundamental aspect to consider with respect to decision-making process is covered in how effective these methods are from a re-optimization point of view, as well as with adaptive operators. The final section discussed the emerging trends in this field, including some current developments and what is expected to come regarding query optimization alongside machine learning integration, and distributed queries handling advancement issues. By synthesizing insights from existing literature, this review equips researchers with a robust understanding of the current state and future potential of query optimization and adaptive processing techniques.
The evidence indicates that adaptive cost models achieve 15–30% efficiency gains over classical models but at higher computational cost, graphbased equivalence transformations reduce query latency by around 18% compared to static rules, and materialized views deliver 15–32% performance gains but introduce 10–20% storag...
M. Okoronkwo· International Journal of Com...· 1 citation
The focus of this paper is on query processing and not search (approximate or exact). The goal is to find all or k answers and the expressiveness of a query (as opposed to a search expression which is typically simpler) is considered important. Although SQL query processing has matured over the last several decades, qu...
Traditional methods view AI, data science, and optimization as distinct domains, limiting the capabilities of intelligent systems and their adaptability. A single framework is introduced in this paper that combines these three pillars based on a modular architecture with adaptive multi-objective optimization. It includ...
Sai Siddharth Murakonda· 2026 International Conferenc...· 0 citations
Modern data management systems must simultaneously address three critical challenges: efficient query optimization for large queries, reliable detection of logical errors in database engines, and high-performance processing across heterogeneous hardware
architectures. Traditional query optimizers rely on dynamic progra...
Praveen Kumar Kumbum, Ramachandra Reddy Vangala· Journal of Data Science and...· 1 citation
Modern query optimizers use analytical cost models to estimate the cost of a given query plan. Such cost models are typically functions of a set of"cost units"that specify unit CPU cost when processing a row or unit IO cost when accessing a disk page. These cost units are traditionally viewed as platform-dependent cons...
Wentao Wu, Xiao-Ying Wang, Vivek R. Narasayya et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.