Aug 2026· International Journal of Intelligent Systems and Data Science· 1 citation· 22 references
TL;DR
This paper presents a structured algorithmic framework for automated physical design tuning in SQL-based relational databases that intelligently parses SQL workloads, identifies syntactically relevant and workload-significant table subsets and column groups, and iteratively refines candidate physical design structures including B-tree indexes, materialized views, and partitioned indexes.
Abstract
This paper presents a structured algorithmic framework for automated physical design tuning in SQL-based relational databases. The approach centers on an incremental, anytime-capable optimization process that intelligently parses SQL workloads, identifies syntactically relevant and workload-significant table subsets and column groups, and iteratively refines candidate physical design structures including B+-tree indexes, materialized views, and partitioned indexes (conceptual framework support; see Section 4.1 for implementation status). Through a multi-phase methodology involving workload compression, candidate selection, index merging, and greedy enumeration, the system efficiently navigates the configuration space under storage and time constraints. A novel prioritization mechanism ensures early focus on high-impact queries while maintaining the ability to refine recommendations progressively. This SQL-native methodology is fully integrated with the query optimizer's what-if analysis interface (implemented as a prototype extension for PostgreSQL 14, using the HypoPG extension version 1.3.1 for hypothetical index evaluation) and is designed to support large-scale, dynamic workload environments with practical time-bounded tuning scenarios.
The Domain-Oriented Tooling Pattern is proposed: instead of generating SQL at query time, the model selects from a small set of domain-aligned tools whose parameterized queries encapsulate schema navigation, joins and business rules on the server side.
The rapid growth of data volume, structural heterogeneity, and real-time processing demands in modern e-commerce platforms challenges the scalability and flexibility of single-model database systems. Hybrid database architectures, which integrate multiple storage paradigms within a coordinated framework, offer a promis...
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...· 0 citations
SafeQL is proposed, a search-based refinement paradigm that redefines the role of the DBMS as an active guide in the refinement process, and significantly improves execution accuracy and efficiency compared to regeneration-based methods.
Geonho Lee, Min-Soo Kim· Proceedings of the VLDB Endo...· 0 citations
The amount of data stored in magnetic disks (e.g., floppy disks) increases by 100% each year for each department in a company, necessitating efforts to maintain an optimal database system. Designing a database is the initial step in creating a system with optimal performance. However, database design alone is not suffi...
Juanda Hakim Lubis, I. Jaya, Fajrul Malik Aminullah Napitupulu et al.· AIUB Journal of Science and...· 0 citations
Modern web applications are increasingly reliant on Object-Relational Mapper (ORM) frameworks to bridge the gap between high-level application logic and relational databases. However, in standard Create, Read, Update, and Delete (CRUD) architectures, the use of a unified data model often leads to significant performanc...
Justin Evan Surya, Kenny Jingga· International Conferences on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.