You are on page 1of 3
Gesee Es Y Relation Data Model Uses 0 Collection of Tables +0 webresent boty Data and the Relabongups among those data. > Each Table han muti pie Columns and ead Column has onique Name. “Tubes Swe _{fetaten) > MWe Data is avranged ina Rekution Udhich Ju aan ‘Debsesented in a“ \Wo Dneniona) Table. => The Data cas insested into the Table in the fos oy topes C Roos) » A Tapes fosmed by one Os mexe than Ene Piterbules Table in th es Q.d00 ( compete sa) 0002 Mektab 29 4 4 Ptibites ase SLD, SName. Shige, Sciass — Diéibules axe Used on basic buuldong blocks ‘Wn the foemater og NOsioug exbsession frat ose Wed +o desige Meorngrul ‘Qoaation as YoutiD Computer Science Lectures By Er. Deepak Sas 7 These canbe rumbes of Toples in thetable( Relation), WY) but all the tuple Contains Axed ar ind Same Mitdibutes Wit Nagging Nahusas- > A Relation is tebse sented by a Table, PTuble is teboesentad by a Row Ro Aintibute cu websecented by @ Column Gj the Table. Piitébude name's the Name @) the Colomn &3 S49, Same! Aitsibude Values Contains the Value fox the Co\omn Wn the Row. > Consewaint (Set o4 Rules ond Binitatione fee Constwatkts ase abbied to the table ond Pom the Logical Schema. (Ae We Know the age oa Deefar| 800 +> Age Pesson Gnnst de Byard & = x itt Py Same. Constant] 7 To Select a barticutar Ras| Tube frm Tabre|Relation ue - Ure Awoloutes| Coloinns name usi¥h the hap og Uniqus Value Or Fed Gy} an Pitiniouten > We field Ulich are Ugur from Ottes fields are aed Os abdleyesitucs haips im Searching fant. = a ee ee Pitctbutle wath every 24 | M [8 Uniout Retde. Ooio| ey | 38 1M ss [0020] defor | Si_| M Hi Salo} yori | te \ 299 |fobu) | 52 | M_ iu [oers|pecay) 29 | Mea eC Tube} Computer Science Lectures By Er. Deepak G-SexEe —7 BY the Relational Maebra Shesations ~~ Ure Select, Thtessection, Product Onion JON, Dwison, MERGE Can also be beofosmed on the Relatisn Dasa Medof a op REMC Relational Data Model) are JaeLitated (sits the hudp 0) diferent Conditronad Exbsessions , Vatious Key Aiterbutes J P- Aekined Constsaints ete, Dota Integsity is mast ained by procese ite Nowmalzati: = — Descsipton oF Data in-teams °4 Ths Model is cated a Schema _ Schema fos Relatisn Speafies us name , name Cach feta 4 Student (Sid t Thtegge , S.Name : Stag , Sbegin sting, ere ) YoutiiD Computer Science Lectures By Er. Deepak

You might also like