UHCL 25a Graduate Database Course - Lossless Decomposition

This video corresponds to the unit 5 notes for a graduate database (dbms) course taught by Dr. Gary D. Boetticher at the University of Houston - Clear Lake (UHCL). The theme is relational database theory. This video focuses on how to determine whether a decomposition is lossless.

[@iProRobin]

Wow your videos are lit fam.

[@gabrielmorcote4264]

This guy is saving me the day of for my databases exam. You're the best! Your explanations make perfect sense the first time through.

[@carloangelo6]

The fast forwarding during writing keeps my mind from flying to outer space thank you sir!

[@ImAltair1]

12 years later and this playlist is saving me on my databases exam. You're a legend!

[@vaibsvaibhav6723]

The transition was amazing!!! :) Excellent tutorial!

[@Max-my6rk]

a professor saves my life... tears...

[@otakuqueen6393]

thank you so much. I'm taking this course as an undergraduate online during this summer and your videos are a Godsend for students who don't get actual lectures and have to learn so much in 6 weeks on their own.

[@donevheino9105]

The best set of lectures on the subject ever. Keep going like that!

[@pauliewalnuts6734]

haha the cnc news break this man is the best !!

[@jonesrz]

You seem like a good man and your videos on normalization are excellent. Thank you for being kind enough to provide these.

[@sarakaczynska1323]

Your videos helped me a lot when studying for my databases exam. Great explanation! Thank you

[@freyasaha4559]

Looked everywhere for the last 2 minute comment you provided. Thanks!! Effortlessly taught.

[@jlparise]

Thank you so much for this video. I am taking a graduate level databases course at another university and this is exactly what I needed. I spent hours reading our course book and they never showed anything this clear. I finally learned how to check for lossless decompositions and understand why it maters.

[@fakename4168]

This saved me for my databases final! My professor did not teach this with the tables. Thank you so much!

[@alrgr680]

Your videos are simply terrific, I managed to understand it all in no time at all. I am very gratefull for your help fellow.

[@CowboyRocksteady]

thank you for that mid-roll update sting!! studying is hard and i needed that laugh

[@ukamath]

Discussed it with Dr Boetticher and the key is to start with Minimal cover. If we started with minimal cover D->BC would be D->B and D->C. And then there would be no "non determinism", so always start with minimal cover.

[@Skeimag]

slow and steady explanation, great!

[@tuanhunghtdh]

Actually, i hate the sound at the begining of this movie!

[@vigneshsaikrishnamallya5777]

yea ...zzzhaa.. zzhaa .. zzhaa...

[@aalawneh]

Great videos. Thank you Dr. Gary!

[@raghavdevgon5124]

The editing on the video is so cool !
Fantastic explanation :)
Thanks a lot

[@1000Shreyan]

Thank u so much sir.... that was the easiest explanation i found on the internet

[@yuping466]

R1^R2=(BCD)^(ACE)=C, C+ ->ACE, ACE is the key of R2, therefore lossless.

[@orglassman6311]

10 minute videos = good idea

[@slimshadybball]

@4:25 I had to pause and like, great move gary

[@AA-fe1zl]

Why is this man so amazing

[@prem6494]

Question 2: please help me....
Consider relation R = (ABCDEF), with F: {AB  C, C  A, AC  D, D  AB}.
(a) Is R in BCNF? Explain.
b) Apply the lossless-join decomposition algorithm discussed in the class, decompose R into a set of BCNF relations. Show steps of this decomposition and clearly indicate the result.

[@dinoa10034]

You are an amazing professor. Thank you so much for your help

[@JacksMacintosh]

Proper legend. thanks man.

[@kushalbohra]

I really appreciate your lectures alot...Keep going sir...!

[@blazept567]

Thank you very very much. Exam on 9 hours from now!

[@arnabroy693]

Awesome tutorial Sir..
Thanks a lot..

[@guidovndr]

aha fantastic interruption at 4.34 :D thanks a lot for the video!

[@sameermkulkarni]

can someone explain me with this example -
R=(A,B,C,D,E,F) into R1(A,B,C,D), R2(C,D,E), and R3(A,E,F).
Find whether the decomposition is a lossless decomposition, if the following set F of functional dependencies holds.
F={AB->CDEF; B->C; D->E; E->F}

[@SuperGojeto]

THanks a lot.It helped me to understand decomposition.

[@cristiandlr]

Great video! Do you know where can I find demonstration of the Chase Algorithm for lossless join?

[@steven9492]

damn gary nearly gave me a heart attack with the intro

[@munsteraner5855]

Hello Dr., is there any transcript with a proof to this method? Thanks!

[@riddhigupta1048]

One word describes you.... Incredible

[@SummersMori]

Explained this way simpler than my prof

[@vitali450]

thank you ser! Do you have a video about query optimization...?
very helpfull!!

[@jona4385]

Thank you so much!

[@danieldilger3920]

Very helpful. This is a demonstration of the Chase algorithm, right? Or is that algorithm something different?

[@thomasalflen8860]

Thanks a lot for this video!

[@hasancanterzi1349]

Thank you. I have a homework about it. it is very usefull for me.

[@tjroxxy]

thank you Sir

[@prem6494]

hi sir need help..... please see the following question....
. Consider R= (ABCDEG), F = {BACD, CD BE, A D, E  B}.
(a) Is R in 3NF? Explain.
(b) Use the lossless-join, dependency preserving algorithm introduced in the class to decompose R into a set of 3NF relations. Show your work of all steps. If decomposition cannot be done, explain why.

[@bavidlynx3409]

Answer is a dick

[@VishwaProtimBanerjee]

Thanks a lot...the video really helped me out.... :)

[@nerosonic]

thanks a lot, gary

[@Finnngers]

Hi, just wondering how you determine the sub schemas to begin with? Why are they R1(BCD) and R2(ACE). Cheers for the videos!

[@jasonbikeracer1]

It's usually whatever is the primary key. If this is a database of students and C is the Student ID Number (A = course, B= grade etc.) then C both tables because when you do a natural join of R1 and R2 you would get the original table back.

[@bksukriti4322]

thanks sir,very nicely explained

[@ritadrikc90]

Yahhh.. That's Awesome!!!! Thanks Boss...

[@mohdza220]

You're welcome. And this DID help! :D

[@giancosta8771]

If we get a whole row of distinguishable variables does this also mean that all of the functional dependencies have been preserved??

[@GaryBoetticher]

Hi Gian,
No, it means that it is lossless.
Best wishes,
Dr. B.

[@giancosta8771]

GaryBoetticher Ok thank you! Could you suggest any videos/resources that explain how to check if a decomposition also preserves all functional dependencies?

[@giancosta8771]

Gian Costa nevermind! Looks like you have a video about that. Thanks:)

[@NyamdavaaAyush]

thank you, it helps me so much

[@sunoharachan3820]

I noticed that all your right hand side dependencies only contain one attribute, if it contains more than one do we decompose them so that it only contains one attribute?

[@garyboetticher9193]

+Sunohara Chan I would recommend finding a minimal cover before determining whether it is lossless.

[@MrFixBroken]

Thank you!

[@Anuja3991]

Thank you so much

[@rahulkhandelwal8781]

Sir you are awesome :D.

[@talananiyiyaya8912]

Why is this a graduate course yet I'm learning this stuff in my undergrad?

[@hoshanggunner]

Dream to work under him for my PhD.

[@vishalranjan]

Thanx a lot sir

[@animesh411]

thank u sir ...

[@andreschavez4463]

thanks Garebear

[@Diaboluce]

what a god

[@joydip22]

thnx alot

[@kaushikmukherjee5556]

thank you sir :)

[@prang1702]

thanks a lot :)

[@fromthesanitarium]

hahahai love his sense of humar :D .. thank you sir :D

[@jonesrz]

A very verbose way of explaining something so simple.

[@BossManTee]

What the fuck was that CNC update tho LMAO

[@hak4fak]

LMAO 4:30 jesus such awesome much wow

[@sopwafel]

I like your videos but I hate the subject. Will be happy when I can forget about all of this. All universities use different names for things (never heard about distinguished variables) and looking those up is confusing and takes a bunch of time.

[@kylemurray3294]

ahh intro too louddd

[@LuciaSilva-ek3qr]

Thank you so much!

[@nhoenderop]

Thank you so much