1. Every relationship in an E-R diagram must translate to an individual relation in the relational model. 
2. Given an SQL query, there are often multiple ways of writing it in relational algebra.
3. For any relation, it is possible to construct two separate unclustered indexes on different keys. 
4. Given a relation that is not in BCNF there is always a unique decomposition into relations that are in BCNF. 
5. B+ trees can include duplicate keys.

Answer rating: 100% (QA)

Lets examine each of the claims you made 1 Every relationship in an ER diagram must translate to an ... View the full answer