Posted On: Feb 22, 2018
There are lots of ways in order to improve the performance of a graph. It should be ensured that components are used in restrain amount in a specific phase. The optimum value of the highest Core values should be used in order to sort and join the component. Make sure that short components are used in a limited number. Try to use sorted join components in fewer numbers and try to replace these with the hash join or in-memory join if required and if it is possible. Make use of sorted joins if two inputs are large or else make use of hash join. Only those files which are required should restrict in sort and reformat and join components.
Never Miss an Articles from us.
Difference between Partition With Key and Round Robin Partition Partition With Key: Partition With Key is often also referred to as Hash Partition. This technology of partitioning is taken into use w...