Database management, computer science, Basic Computer Science

Assignment Help:
Suppose you are designing a database for an art museum that owns a large volume of works of art. Each work of art is described by a unique item code, a title, a type, and a size. The size is further composed of height, width, and weight. A work of art is developed by an artist, but the artist for some works is unknown. An artist is described by a unique artist ID, a name, a date of birth, and possibly a date of death. Data are maintained about an artist only if that artist has works currently owned by the museum. At any point in time, a work of art is either on display at the museum, held in storage, away from the museum as part of a traveling show, or on loan to another gallery. If on display at the museum, a work of art is also described by its location within the museum. A traveling show is described by a unique show ID, the city in which the show is currently appearing, and the start and end dates of the show. Many of the museum works may be part of a given show, and only active shows with at least one museum work of art are to be represented in the database. Finally, another gallery is described by a unique gallery ID, its name, and its city. The museum wants to retain a complete history of lending for each work of art to other galleries, and, for each time a work is lent, the museum wants to know the date the work was lent and the date on which it was returned. Drawing manually (but neatly, in pencil), try to construct an E-R diagram for this database.

Related Discussions:- Database management, computer science

Microwave transmission, Microwave Transmission: Using space as transmi...

Microwave Transmission: Using space as transmission medium, microwave emanates from an origination point on earth, such as telephone exchange, where many individual messages h

Describe FCFS Scheduling algorithm ?, FCFS algorithm also known as: • Firs...

FCFS algorithm also known as: • First-In-First-Out (FIFO) • Run-Until-Done • Run-to-Completion • Possibly, First-Come-First-Served algorithm is the easiest scheduling algorithm i

Fuction to delete a record in phone book in c, function to delete a telepho...

function to delete a telephone book record in c programing using struct and objects...?

Explain the different methods of encryption technique, Problem When a d...

Problem When a data is sent across the network it is encrypted and arranged in a way that even if there is a diversion in the flow of data should not leak the data. At the rece

Diskless workstations, Diskless workstations:    Most people assume th...

Diskless workstations:    Most people assume that the operating system is stored on a disk that is connected directly to the computer, but this is not necessarily true. If the

Random reading and writing and Closing a fcb file, The 21H function and the...

The 21H function and the 22H function of the 21H interruption are the ones in charge of realizing the random readings and writings in that order. The random register number and the

Adding macros to ms word 2010 for a particular format, Project Setting up ...

Project Setting up Microsoft Word 2010 to automatically handle as much as possible of the NDSU Graduate School requirements for a disquisition. Accessible from the Graduate Schoo

Operating systems, Consider the state transition diagram of Figure 3.9b. Su...

Consider the state transition diagram of Figure 3.9b. Suppose that it is time for the OS to dispatch a process and that there are processes in both the Ready state and the Ready/Su

Discuss the advantages and disadvantages of printed indexes, QUESTION 1 ...

QUESTION 1 Discuss the advantages and disadvantages of printed indexes. QUESTION 2 (i) The Library of Congress Subject Headings List and the Sears Subject Headings List

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd