QUERY PERFORMANCE ANALYSIS IN RELATIONAL DATABASES DEPENDING ON THE USE OF THE INDEX

Abstract

А simple relational database was created and time needed for different queries to complete was measured, while using different indexes. The database consisted of 20 tables with the same underlying scheme but with different numbers of randomly generated rows. Subsequently, B-tree and binary indexes on each of them were created. Seven frequently used queries were executed on each table and each type of index and the average execution time was measured. The results of measurements were presented in a 3-layered web application and commented.