How we can implement relationships when designing tables, Database Management System

Assignment Help:

You want to implement following relationships when designing tables. How would you do it?

a.) One-to-one

b.) One-to-many

c.) Many-to-many

a.) One-to-One relationship - can be implemented as a single table and seldom as two tables with foreign and primary key relationships.

b.) One-to-Many relationships - by splitting data into 2 tables with foreign key and primary key relationships.

c.) Many-to-Many - by using a junction table with keys from both tables forming composite primary key of junction table.

 

 


Related Discussions:- How we can implement relationships when designing tables

Define relations in tables and define primary keys, Consider the subsequent...

Consider the subsequent relations along with keys underlined Street (name, location, city) House (number, street_name) Lives (name, house_number) Define the above relations

How we can implement relationships when designing tables, You want to imple...

You want to implement following relationships when designing tables. How would you do it? a.) One-to-one b.) One-to-many c.) Many-to-many a.) One-to-One relationship -

Define outer union operation of the relational algebra, Define outer union ...

Define outer union operation of the relational algebra. Compute the outer union for the relations R and S given below. Outer Join - If there are any values in one tabl

Define shadow paging, Define shadow paging. An alternative to log-based...

Define shadow paging. An alternative to log-based crash recovery method is shadow paging. This technique requires fewer disk accesses than do the log-based methods.

What is de-normalization, What is De-normalization? De-normalization is...

What is De-normalization? De-normalization is the method of attempting to optimize the performance of a database by adding redundant data. It is sometimes essential because cur

Define and differentiate among ordered indexing and hashing, Define and dif...

Define and differentiate between ordered indexing and hashing. Ans: Ordered indexing: To gain fast random access to records in a file, we can make of an index structure. Every

Log, what is the need of a log in dbms

what is the need of a log in dbms

Join operation, The JOIN operation is applied on two relations. When we wan...

The JOIN operation is applied on two relations. When we want to choose related tuples from two given relation join is used. The join operation need that both the joined relations m

Hashing techniques, folding method and mid square method using visual basic...

folding method and mid square method using visual basic

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