Optimization of joins using random record generation method
G. Hemalatha, K. Thanuskodi
Abstract
G. Hemalatha, K. Thanuskodi
Abstract
Joins are statements that retrieve data from more than one table. A Join is characterized by multiple tables in the FROM clause, and the relationship between the tables is defined through the existence of a Join condition in the WHERE clause. In the case of Very large databases and highly normalized databases frequency of Join queries are high. To perform the Join Query much efficiently, the Join Method the optimizer selects are very vital. Nested Loop Join, Hash Join and Merge Sort Join are primary Join methods available to join tables. When the size of the result set is less than 10,000 the optimizer will perform Nested Loop join. But Nested loop Join steals must of the system resources. In Nested loop Join each record from the outer table will be compared with the inner table to find out a match. This paper proposes a Random Record Join method in which a random record will be picked from the inner table to find a match with the outer table. This method reduces the number of iteration required to Join the table. To perform the Random Record join the optimizer requires statistics of the table. The no. of records containing the distinct Join key attributes value should be maintained by the data dictionary.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Joins are statements that retrieve data from more than one table. A Join is characterized by multiple tables in the FROM clause, and the relationship between the tables is defined through the existence of a Join condition in the WHERE clause. In the case of Very large databases and highly normalized databases frequency of Join queries are high. To perform the Join Query much efficiently, the Join Method the optimizer selects are very vital. Nested Loop Join, Hash Join and Merge Sort Join are primary Join methods available to join tables. When the size of the result set is less than 10,000 the optimizer will perform Nested Loop join. But Nested loop Join steals must of the system resources. In Nested loop Join each record from the outer table will be compared with the inner table to find out a match. This paper proposes a Random Record Join method in which a random record will be picked from the inner table to find a match with the outer table. This method reduces the number of iteration required to Join the table. To perform the Random Record join the optimizer requires statistics of the table. The no. of records containing the distinct Join key attributes value should be maintained by the data dictionary.
Key concepts: Join (topology), Hash join, Joins, Nested loop join, Sort-merge join, Computer science, Table (database), Database