Algorithms, Database, Distributed Systems, Join, Data Processing.
the outer table, we must do a sequential scan to check for a match in the inner table. We can avoid sequential scans by using an index to find inner table matches. Use an existing index for the join. INDEX NESTED LOOP JOIN The previous algorithms perform poorly because has to do a sequential scan