AVALULELEELLELULLEUULUGLUULUL eee [DBMS Bara] Data is tne raw mareviod that can be processed for any computing Maching. Example + Employee name, Produut name, Studentname, Marks of the student, any number, Image. (ERROMMARGE] 1 1s te data thar nas been converted Into More useful ox fatertigable form e9- yeport card sheet. + Hang We need Informarton 2] {1}. To galn Knowledge about the Surroundings. 2): To Keep tne system upto gare. 3): To KnowW about tne yules and yeguiatton of the society - ATvi Kup [Rne@e89e2] Human mind purposefully oxgantce +ne Ynformatton and evatuate tt to Produce Knowledge eg 238 1S @ data and Maris of ctudent 1s Information and tre nayawork reyufre to gor maris Ys Knowledge . Fa Based Heuristic Based i). [Four Based tte Knowledge gein from Fundamentat £ snxougn experlmenrs * x [Heuristic Based t-] TF ts yne Knowledge of good prautce And good judgement IKE hypothesis. Aue KUMAR CLInKEDIN)GELLLLEGLELELULLULLULLULLELLELLEUGS D. Dara ts tne yavo fact. a}. Tt is not significant to aq bustness. 3}. Data are Atomic level ptece OF Tnformation, Ul. pata doesnot nelp 1 aeeiston maring. 8]: Examples t- Product name, Name of Student, TNFORMATION tht ts tne processed Form of dara, 2}. Tr 1s the Stgniefeant to a bustnesc. 3)- It ts @ conectton of data. u). Tt hap tn decision mayeing 5]: Example t- Report Card Sheet. ATUL uma (LINKEDIN) - TELEYRAM - NOTES GALLERY: [Daranacey] The yelated Information when placed in an Organised form makes q darabase or an organised collewton of yelated Information ts Known as_daraba se. Examplet Dictionary , Telephone divectory , Mobile conraut. Operation Perform on Database 1). “Thsertton 2). updarfon 3). Deterion YJ. Reerive BJ. Sorting piererence b/W Computerised dargbase and Manuat dofabace, TyaalHonal File System * File syctem ts tne mernod of pees of three level Aychftecture o¥ Sparc 3 es] The objective fs to Seperate eath u sere vieto of the dara from qhe Wary the databace is phystcarly yepresented- “There are Several yeasons. 1): The Infernal structure of tht dofabase thould be uneffecred while changes to the phy steak aspeus oF StOrage. 2). The DBA Should be able fo change the conceptual strucrure oF the databace voithour affeurtng afl other UseYe a Centemat tase Totem leet 9 ole \eetl eestteed amar port Of tht database thot ls yelayent to each users. Tc level fnculares tne ucers from the dotalis of Coneptuol and pw Ynremne level. ATUL OMAR CLIMIKEDIAD.bdbied u VUVELELELLELULULULUUTULLLELLE 71. [Cenceptuad ievel/ toate level ¥ | 4435 level deseyfbe what Sarg }s stored Into the databace And the yelartonsNlp among, Hua data. Tt vepresents @): AN ane entities, aftyibures and there yelatton ships b). Tht constraints on tre dara °) Security and Integrity }n formation . 3) [Anteral tevel] Forage teaver] Tete tna pnycteat yePresentarion of the database On tnt computers THis level describe hoW the dara fs ctoved In tha darabase- It covers the data stvuurure and File organtcatfon used ro Hore thi dara on Since An user and appiications rely on tne qualigbttity of tne DBMS, thre Failure of Any Component can bring operation to q nalt. B).[Cosk OF DBMS J] tH: cost of DBMS various Agni geant depending on the environment and Functionality provided, There 16 alco ane yecurrent annua maintenanw cost. . Smat! system . Relattvely cheap. . Few Files: yj. Files are Atles. 5). Simple Data Inconsistency occur when tne parent node is delete thot yvesult in the delerton OF tne child node- wastage OF storage space Complex to destan - : Absence of structural Independenty. giuc KumeAe (LisKEDIN)- TEcegRni]- NOTES GALCER G Por One to many—> One to one #4 many to many Cunicev at).WOVUVOLUUOUULLULUUUT LULL eddie eeeey Th Ys based on Graph Structure. Tr consist oF coileuton oF yecords, wihith ave conneuwed fo each omer by IInics. Advantage D- Tr fs easy to design than the Hfevarcnial Model 2) Data access Te easy tn the nerworls model- Disaavantages?- 1): Tt ts Comptex to design than @ yotationod model: 2): EFFicency are less than tne yorarional Model 3). Absenu of structure Independency. 3). (Relatfonea meget =] Relartonal mouel store dara In form of tables. Empicy ee eEme-id leme- Name | Svary. Department. Ks \ A 20,000 4 Der ta | same. | 2 ® 30,000 ‘Domain |-_& Sates 3 Yo, 000 gS =" marering | 4 Da: 50,000 Tupte variabie. Tapie 9 Relarfon Tupie > vows Ceach Row of dota). Att dures > Column. (each column tn the tuple) Domain ~ Set of permitted values Taples variable Any Wolue of a Tuple Degree — No. oF Column tn @ gelation > = in emp. Cayatinallty No. of yows tn a relatton Ctupies), Aru KUMAR CLINKEDIN) «SVUUULLLLLULLELLLLEUULUULL Let eee Dara Vianagey [use REQLEST —} Afoara Manager fife manager DISK MANAGER (Se DaTagase Ceecogps) * Th Relational Model Many LO many velartonship can be easily Implemented. * Tt fc useful for yvepresenting most of the yea world Objecr and yelationship among them. * Relarionad mode! does net malnrain pnystca corineufon among yetords. Dara ts Ovganized logically In tra ferme of vows at Able. and columns and stored Yn Pan airite (iinabin)- Dara modetiing using ER Models? = Enterprise + object goeut Wnich Mnformatton fs to be conecred — Entity - T+ Ps the name, ening etc, These are pu dara — Atriburesi ChavauersHe OF entity OR Para clements J” Dera Feld 1)-[efngie Value Athtbutest-] those artribure which contain a Lingle Vowue. for example t Age, Salary etc. 2). (MorVelued A trribules?=] thar contaln more tan ont vatue oF a singte entry» fox example !- Phone no. ATUL KomAg CLINKEDIN) .| WUVUULLULLULELELELLLLUULUULU UU deey %)-[Compostte Attribute t-] Those atfyinure ysnlth can be further iulded. for exaynpte + name Flyst name Lastname, Dore of Birth etc. 4): [Stmpie “or Atomic artribures =] those attribure phich can Not be Further Aluideds for example - Age. 8)- [Btored Attyiburers] Artyfputes which can not be derived from another attyibure. Dare of Birth. 6)- [ull watue t= Empry- Corleutton of enttty thar share ime same attribute. ent Name Employee _s page Sa lary_ Entity Tyee Name Entity sere Employee =__s Age Salary m. Representarton multtvalue Representarton of derlved ottribure ei nturfon of Represe e_CLINICEDIN). Key: attrtburs[Key arryibure 3 Key attyibure are those artribure vonicn Ts uniquely fdenttfy the record. + [Weak Entity tyr In “Those entity type In whch no Key attyibutes ts present « + [Strong Entity tyret] Those Entity type wirich consist oF Key attyibures - Example of weak Entity tee! [Dependent Aruc Kumar (LINKEDIN) TELEGKAM-HOTES CALLER Domaln of the Atmibutes i] Ser of possible Values. TS fdn poo Rarattonsnte Repreentation of QRerattonship enHHes Rerarlonsnie tyre :- © [Exposes [<> _—frenamere | egree OF velartonsrip tyre -| How much entity are Inuolved nN a yelarlonship. 1): [Binary tee] > 2 entity ave relared: 2) > % entity are relared. Evamplie i Bema UVVELLLULLOULULLULELLLUULI ddd dd dddd([ReleReRERIPICOMSTVANUTERTO Par ticiparton constraints, (D— cardinality yario fctparton _Constralnts] Tora Partfefeatton Parte) fartielpotton 1). rorot Participation] Tn tora fartidparton every entity Pn me empty Set must be depend on another extiry - fr Ps also Known as existence cterendency. Th €-@ Stagram tt 15 represented as Q double tine connecting tne Participaring entity tyre to tne yeliarfonsrlp. 2)-[Fartiai fartictrarion] farttad particlparton some entitles in the entity set are depend upon another entity. Bebartment Partial , i Toray Parttetparion pacientes @ @ (araina Va] carsinattry aie “ay binary xelarvonschip specitter tna no. OF yelartonshle Instance tnor an enrtty can participate In q yelarton ser. Relotioncnip exists are i- One 40 One @ Cz!) One +0 Many —> (itn) Many to one (Nt 1) Many 40 many — CNN) WUVUVUUVOLULELLLLELULEUULULiLdeceesExample .- aint t [Emetoyee kk SS Department mM ae n Employee Work Projects Discytminaror + [aentifving Relatfonmnte =] We Know -thata weak entity +ype does nave @ Key artribure, So what we do te yelate such entity type WIth some other entity tyre. The iieak entity type relate to another entity tyre In cernbination with some of thelr artribures walue. ite coll tris orner entity tyre the Identifying or tne owner entity type and yecall the yelationchip type thar yelares te ite owner the Identifying yelattonsnie. gent Fytn een bn le tng Ent eee AS age WHVOVELELOLELELELELULLLLLULELECceedWVVVVBELVOLLLLDELELLELULLELULUULLLL ECE! Q@ mioxe an E-R diagram fos tne Company database wiltn the Foitowing descrtprten. The Company fs Organised Into departments - Each department has a unlque name and unique nor. A departmont May nave severa focarions. ® A department Controls q nO of projets, Eacn of wich has a untque name, unique no. and q Single location. 2) A CS) ute crore each employee name, Joua Security NO. Qddress and Lalary an employee t¢ a5519n to One department bur moy worl on Seuerad Projets, WIN are not necessvily Cente! by the Jame department. wwe wianr to Keep traus ef ime dependena of each employee far incuvanw purposes. Censtrur ER diagram for teacher Studént database . Ke ATUL Koma ( LINKEDIAI).