What makes for a good algorithm compatibility complexity humor correctness efficiency?
1 answer:
You might be interested in
Answer:
Check the explanation
Explanation:
Step 1: identify the entitles
From the statement given, the given entitles are artists, albums, tracks and played.
Step 2: identify the relationships
- One artist can make many albums
- One album can contain many tracks
- One track can be played many times.
Conversely, each play is associated with one track, a track is on one album, and an album is by one artist.
Step 3: identify the key attributes
The only strong entity in the database would be the “artist”, which has an attribute of artist ID so as to uniquely identifies it
Each album entity is uniquely identified by its album combined with the artist ID of the corresponding artist entity.
A track entity is similarly uniquely identified by its track ID combined with the related album ID and artist ID attributes.
The played entity is uniquely identified by a combination of its played time, and the related track ID attributes.
Step 4: identify other relevant attributes:
The attributes are straight forward; artist, albums, and track have names as well as identifiers to uniquely identify each entity. The track entity has a time attribute to solve the duration and the played entity has a timestamp to store when the track was played.
Step 5: Draw a complete ER diagram
The diagram explaining this question can be seen in the attached image below:
