Oct 2026· International Journal of Computer Science and Mathematical Theory· pp. 56· 1 citation
TL;DR
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% storage overhead and refresh indices.
Abstract
Query optimization is a crucial aspect of modern database management, relying heavily on cost
models, equivalence rules, and materialized views to achieve efficient performance. This
systematic review aims to critically evaluate the strengths and weaknesses of these three
optimization levers, highlighting their implications for relational databases and distributed
frameworks such as Hadoop, Spark, and Cloud SQL engines. A systematic review protocol was
adopted across IEEE Xplore, ACM Digital Library, Springer, and Scopus. The Preferred
Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) framework guided the
process to ensure transparency and replicability. A total of 5,908 records were identified and
through the inclusion and exclusion criteria of the study, 7 studies were eventually retained for
synthesis. Data were extracted systematically, recording author, year, database context,
optimization technique, and main findings. 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% storage
overhead and refresh indices between 3.4 and 4.0. Relational systems showed 72–80% efficiency
but limited scalability, while distributed platforms achieved 82–88% efficiency with scalability
scores between 3.8 and 4.5/5, though accompanied by energy and refresh penalties.
Oracle Database is a leading enterprise relational database management system, supporting both transactional and analytical workloads. Recent SQL enhancements, including the introduction of the GROUP BY ALL construct, improve query expressiveness, maintainability, and developer productivity by implicitly including all...
Michal Kvet· 2026 New Trends in Signal Pr...· 0 citations
Published database comparisons usually cover engine pairs, conflate engine and schema effects, and compare queries that compute different results. StreamCart, a realistic e-commerce benchmark, decomposes performance across an optimized relational baseline (PostgreSQL) and five specialized engines (MongoDB, Cassandra, N...
ACMO, the Adaptive Cost Modeling and Optimization framework, is introduced, which estimates query costs on MongoDB-style document collections without requiring query execution traces or a running database engine, relying instead on document structure and field-level statistics.
R. Porchezhian, Roshini Pininti, A. Sudha et al.· IEEE Access· 0 citations
Dynamic form builders require database structures that can accommodate variable attributes while maintaining efficient query performance. However, the performance implications of different storage representations within the same database management system remain insufficiently characterized, particularly for relational...
Muhammad Salmansyah Mousavi Akhyar, Triyanna Widiyaningtyas· SISTEMASI· 0 citations
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.
Rehab Mohammed Abdelhalim Mokhtar, N. Palanichamy· Journal of Informatics and W...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.