database

Aroknew thenor Je pointol) Hrochine mavion a calke Mruturian haphovel for marwere fuwasn manowlation contron these data is hatred as 6. en the other Aund definer the data and its structure. (b) 2 pointe and Databuse Management Systems. are some of the (non) commereial 3 points. (c) in a relation there might be more than one set of attnbutes whose values are diferent for each tuple within the rebtion, and minimum in the sense that the set does not contain any rodondant attributes for unique identification purposes. These sets of attributes are called - Lrphes is selected to be the rebation. The rest are called of a relation is implemented by constraint in 5QL, of the constraint in 50L. d) relations since. and 3 points equire "sorting", and combine two implementation/execution does not requires "sorting". (is much faster) than 2 points