Behavioral patterns of various JOIN techniques on large databases

This paper focused on various challenges occurred during processing of join operation in query optimization. Producing the query result in less execution time, reducing communication cost when data is distributed among different sites, preventing data loss during join operation, eliminating duplicate data during data transfer, reducing the amount of data to be transferred using data compression techniques - are some of the challenges occurred during join operation of the query. Paper suggests four join algorithms such as SEMI-join, BLOOM-join, PERF-join and DERF-join to address these problems. The behavior and performance of these algorithms is checked with four different types of queries such as Star, Clique, Circular and Chain query. Experimental results are carried out with benchmark queries to compare the performance of algorithms on large TPC-H database.