Question 652 marksHard
A database has three filters. Each filter returns a set of records: , and .
(i) Tests show that , and . Prove that .
(ii) Suppose instead that , and . Prove that , and show by an example that need not equal .
Confirming your payment
Competency-Based Questions (CBQ) · Question 65 of 80
A database has three filters. Each filter returns a set of records: , and .
(i) Tests show that , and . Prove that .
(ii) Suppose instead that , and . Prove that , and show by an example that need not equal .
(i) From and : if , then , so . Hence . Together with , this gives .
Now and . So and , which gives . Hence .
(ii) and together give , because two sets are equal when each is a subset of the other.
Nothing forces . For example, take and . Then , and all hold, but and , so . The chain closes back only between and , so only those two are forced to be equal.