Entity Relationship Diagrams: These two problems are giving me a hard time, an e

Question

Entity Relationship Diagrams:

These two problems are giving me a hard time, an explaination would be nice.

Consider an Entity-Relationship diagram consisting of two entity sets E1 and E2 connected by a binary relationship set R. Suppose that R has a single attribute A. Under what conditions can attribute A be moved to become an attribute of entity set E1 instead of an attribute of relationship set R, without introducing inefficiency or normalities. Consider the following relational database schema: Write a query in relational algebra to find the names of all graduate students who are neither an RA nor a TA.

Explanation / Answer

select * form student where name status="grad" neither RA nor TA.

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.