RAS Outer relation Inner relation foreach tuple r in R do 7 foreach tuple s in S where n == s; do add to result vo u s to look for 2 Scan S to look for matches 1 page lot of work! This scheme is very computationally expensive because each tuple of the relation R must be compared with each tuple of the relation S. This strategy incurs substantial disk access. Design a more efficient join algorithm, in which each tuple of relation R needs to be compared with only a small subset of the Stuples