Database Systems the Complete Book 2nd Edition Exercise 162

###

Database Systems the Complete Book (2nd Edition)

Exercise 16.2.1:
When it is possible to push a selection to both arguments of a binary operator, we need to decide whether or not to do so. How would the existence of indexes on one of the arguments affect our choice? Consider, for instance, an expression c (RS). Where there is an index on S.

For more clarifications observe this link.
https://www.chegg.com/homework-help/Database-Systems-The-Complete-Book-2nd-edition-chapter-16.2-problem-1E-solution-9780131873254

Solution

If the index on S assists us find tuples that suit the condition C, and then certainly we should push the selection to S. Let the effect of the selection on S be a relation S\', which is a subset of S. Assuming there is no index on R that assists with condition C, then if we push the selection to R as well, we still have to intersect that result with S\'. though, if we do not push the selection to R, then all that leftovers is intersecting R with S\'. presenting also the selection or the intersection on R needs that we read all of R, so we are improved off performing currently the intersection quite than the selection advantage a intersection