Lec 19: Practice Problem on Lossless Join Decomposition | DBMS Tutorials

preview_player
Показать описание

In this video, I have discussed some practice problems on Lossless Join Decomposition with solutions

*******************************************

Connect & Contact Me:

*********************************************

More Playlists:

#dbms #dbmstutorials #normalization #jennyslectures
Рекомендации по теме
Комментарии
Автор

Kudos... For the first time am seeing a lecture in English from North India.. thank you

chandrashekarr
Автор

You are litterally perfect . I have been struggling to understand this topic, I have found this playlist and now everything is crystal clear . You are amazing <3

gulcesafiye
Автор

Just in case if you are confused @20:27. Simple trick said by mam earlier is...
C+ = {A, B, C}
It has all the attributes of R1(A, B, C) which means, C is a super key.
Also, C is a single attribute. So, it is a candidate key, since no proper subsets of C[which are just empty sets] is a super key.

bense_tony
Автор

you deserve some credit ma'am. Everything i learned from you is more than explicit. Thanks!!

ebrimajobe
Автор

Toppee because of your bloopers 😆😆bcoz i started following you after your blooper😆😆

impatientoptimist
Автор

Beautifully explained. thank you. also I love your coat😉

nickmorgan
Автор

At 14:47 we cannot say AB is a candidate key. A candidate key is a mimimal superkey. So A would be the candidate key. AB is a superkey.

rithviksenthil
Автор

Plz make a video related to foreign key and primary key and the way of joining the tables.... ASAP.

souravssg
Автор

The common attribute of both the sub relations must be a super key of either R1 or R2 or both. if someone confuses in SK or CK. Every CK is super key but not all SK is CK. Mam is saying all time CK so plz consider it as SK. bcz in 4th sub-relation AB is not CK. it's SK.

deepakdobhal
Автор

Bhai main commerce se hu pr pdh k a6a lg rha hai 😍😍😍

Russia_wala_Putin
Автор

Thank you so much mam, all your videos are very clear and it helps me to prepare gate/net exam very easily, u have saved my time .thanks a lot

ganeshrams
Автор

Mam please continue your Valuable videos for gate please mam

Attitudeandsigma
Автор

Didi, can you please make a video about "lpp simplex" method to attain optimal solution....

kailashuv
Автор

Pls do on 4nf, 5nf and Multivalued dependency mam

velagabhavyasri
Автор

At 13.55 your are deriving b can derive CDE in which due to at value of b at 1 having different value it can't be derive but if we take 3 in common from (6, 3, 6)than it can became similar soo can we do it that after removing common divider make it similar or not....?

rukaiyadalroti
Автор

The definition shouldn't be for candidate key because at 15:27 we have abc and you termed ab as candidate key, but since a is a superkey, this is not valid. Instead you should change the terms you use, mam

pavankumar
Автор

please add videos on network models and constraints in dbms.

gurjotsingh
Автор

Why aren't you making more videos on other computer science topics as well or on DBMS. At least with your help, we can really increase our knowledge in DBMS.

RishiRaj-zsfh
Автор

Consider the relation R(P, Q, S, T, X, Y, Z, W) with the following functional dependencies.

PQ → X; P → YX; Q → Y; Y → ZW

Consider the decomposition of the relation R into the constituent relations according to the following two decomposition schemes.

D1 : R = [(P, Q, S, T); (P, T, X); (Q, Y); (Y, Z, W)]

D2 : R = [(P, Q, S); (T, X); (Q, Y); (Y, Z, W)]

Which one of the following options is correct?

SureshBabu-ogys
Автор

Is it ok to discard a tuple from a relation formed after decomposing R? Won't it be loss of record. Kindly explain. Thanks.

FINANCIALYOGI