Manupuri Nithinnithinmanupuri.hashnode.dev·Oct 26, 2024DatabaseEngineering1.Nested Join - nested for loop - O (N * N). - easiest to implement - time consuming for large dataset - better with either small datasets or index on join attributes 2.Merge Join - sort them first and compare - O(NlogN) + O(NlogN) - Efficient for la...#DatabaseEngineering