ANALYSIS OF QUERY PROCESS FOR TABLES COMBINATIONS IN THE PARALLEL ROWS OF DBMS
The article deals with the time formulas of query for tables combinations in the parallel rows of DBMS. The model includes time parameter of executing short logical operation of the algorithm (SLOA), which helps to make calibration of the model on experimental results. Computing experiments are presented in the article. The following parameters were varied: volume of the database site, search condition selectivity, number of sorted records, power of grouping attribute. It should be noted that DBMS is preferred by operating relatively low volume of data.
Keywords: DBMS, SQL, tables combination request, query execution time estimate.
