Involuntarily Trained and Analytical Query Optimization Model

Abstract

In the management of a database system, it is essential to present the outcomes of any query mix with high throughput and low execution time. The experiment conducts on the Postgresql queries on the TPC-H benchmark for the determination of response time of query mixes MPL3, while they are running concurrently. This research uses the deterministic approach for attaining the response time of the query mixes in conjunction with other query mixes. The selected query mix executes in three threads simultaneously. This makes query set(s) in each thread containing query mixes having the same ending of execution time as well as having the same starting time. It makes sure that each query set consists of at least one query mix executing at a time, the number of query mixes may vary in the query set. For attaining the research targets, it is necessary to maintain a catalog to save such query sets which have the same execution time. Due to achieving a high level of parallel processing, this research presents a query mix response time.