Data Search Using Hash Join Query and Nested Join Query

Abstract

Abstract In accessing or searching data by using Query or Join on applications that are connected to a database, the usefulness of the implementation of the data and the process time is important to note. There are many ways that a system management database can do in processing and generating answers to a query. All methods will eventually produce the same answer (output) but they would still have different values, such as the time to respond to data. Some queries that are often used for processing data are Hash Join and Nested Join, both queries have different algorithms but produce the same output. A client-based or network-based application was employed to test both algorithms or queries with running time parameters or the time to respond to data. The test was conducted by connecting the number of tables and the number of rows/records. The result of the study is that the query hash join’s speed in response to small amounts of data is better than the large data in the nested join.