Analysis of SARGable Queries for Query Optimization in Relational Database

Being lived in the era of the 4th Industrial Revolution where software plays a pivotal role in almost every aspect of our life. The accomplishment of any software application relies on the Database system which is responsible for storing and retrieving information related to that software. Relational Database systems are based on relational techniques and use the principle of Structured Query Language for storing and retrieving data. The term Search Argumentable, also known as SARGable queries, is the query optimization technique that can take the help of Indexes. SARGable queries not only speed up query performance but use fewer system resource. SARGable queries provide a way such the database engine to swiftly refine and extract rows from tables which engenders superior query performance in Relational Databases. The experiment presents some study of SARGable query results generated from the comparison of non-SARGable queries in SQL Server. The study demonstrates that all proposed techniques are more efficient for query performance because they reduce the number of logical reads, I/O cost and CPU cost in Microsoft SQL Server. The proposed way escalates the performance and efficiency of SQL Server Database as well as query results up to multiple times.