1 1 vote How to solve this? Databases + – Niharika 1 991 views answer comment Share Follow Print See all 7 Comments 7 7 Comments reply Shubhanshu commented Nov 20, 2017 reply Follow flag C ?? 2 2 replyShare Shubhanshu commented Nov 20, 2017 reply Follow flag But anu how you will write the aTrc for i and ii when we dont know what is the path length.?? 0 0 replyShare Anu007 commented Nov 20, 2017 reply Follow flag yes only iii will possible. 0 0 replyShare Niharika 1 commented Nov 20, 2017 reply Follow flag how can u explain?? 0 0 replyShare Shubhanshu commented Nov 20, 2017 reply Follow flag One quick way to answer this question is: For designing TRX FOR i and ii you cant predict the path length and since you dont know the path length ypu cant also predict that how many instances of the relation you need, and since you dont know about number of instances you need so it is not possible to design its TRC. Whereas in iii you require only 3 instances of relation. So this one is possible. 0 0 replyShare arch commented Nov 22, 2017 reply Follow flag why not second possible? cycle also like triangle. 0 0 replyShare joshi_nitish commented Nov 22, 2017 reply Follow flag but in 2nd you dont know length of cycle, as in triangle you know length =3 0 0 replyShare Please log in or register to add a comment.
