Unit 1 Database system applications Introduction to DBMS:1.1 Introduction to Database System Applications ' } Q.1 Define database management systems. BS [INTU : Part A, Nov.-17, Marks 4) OR What is database management system? Why we need to use it ? ES [SNTU: Part A, May-19, Marks 2) Ans.: * Definition : A database management system (DBMS) is collection of interrelated data and various programs that are used to handle the data. * The primary goal of DBMS is to Provide a way to store and retrieve the Tequired information from the database in convenient and efficent manner. ¢ For Managing the data in the database two important tasks are conducted - © Define the structure for storage of information. © Provide mechanism for manipulation of information. In addition, the database systems must ensure the safety of information siored.INTRODUCTION TO DBMS: What is data? * Data is nothing but facts and statistics stored or free flowing over a network, generally it's raw and unprocessed, ‘* Data becomes information when it is processed, turning it into something meaningful. © What is database: The database is a collection of inter-related data which is used to retrieve, insert and delete the data efficiently. * It is also used to organize the data in the form of a table, schema, views, and reports, ete. © Using the database, you can easily retrieve, insert, and delete the information. © For example: The college Database organizes the data about the admin, staff, students and faculty ete,Applications of DBMS:=> Frpphedi yen’ "gry per: penne st Applicatioits ') Pceoursticg a au Mf ig | ( me rede) 9) Man churning ‘\ 8) Super! meen 3) Ranking ) E Ge ohne iy 4) Univensities \f ye ; hes in iy og f ; “ines tiie Siptens 0 r AM 6 ag Tele Commun fader i aga ) Jena A bers abe. wed fi ent infennesdion _eanploygees Soe hind pariah we dh terafi dls Ah Me We ) ronda Gn orp ig cholo orc bree’ re bens in acting d bate Bad 3) Bankig & Bc | Basie, 2 dent ba i infomrestion attourrts ond Yeang acd “ory portoneny anki aeeligiigs othe, Bi) 1S _Dsed Wii, if\ a \ \ 4) Univensities P_ The DBMS are. Osed fn ENIVOsrUes, atm rn eg o on ricchton, CounCe. se gistreciror , ond acteurting. » ‘on ; 6 Reseswverdion Syste = Je aintines | qotlevoy ~ Aifalcgieblen eke Abel debabae,, Is sed 4p mpinin “Abe, resenndion ard Shedube 7 y hho, oi | cfs, keeping mecends eb the Gils bioree | q X a ‘ ence _gengnadiiy © rromthly, bills, malo teuniog, Deen Gn prepaid Catling Gund $, ond Stay 14 ixfodirn — leche akoud Gmiauniedian nedeconks he — OBMS, ame bed, © | i hy) Ry) yy i } ‘ bi By ' |DATABASE APPLICATIONS - DBMS: © Applications where we use Database Management Systems are: «Telecom: There is a database to keeps track of the information regarding calls made, network usage, customer details etc. a DATABASE MANAGEMENT SYSTEMS Page 7 Ne © Industry: Where it is a manufacturing unit, warehouse or distribution centre, each one needs a database to keep the records of ins and outs ‘© Banking System: For storing customer info, tracking day to day credit and debit transactions, generating bank statements etc. © Sal : To store customer information, production information and invoice details. © Airlines: To travel though airlines, we make early reservations; this reservation information along with flight schedule is stored in database. © Education sector: Database systems are frequently used in schools and colleges to store and retrieve the data regarding student details, staff details, course details, exam details, payroll data, attendance details, fees details etc.=> dpeotictensits 4 oBMst- characterstics: Repre. reserdeadion dee eae Sonne. cS oO a), C0) NER ites Onpees, Pea ia a) System recurrent | d-' nbin reckon a 3) Repmeserdtig ped del by mutt! ple view 'S ’ rs Sech ord easy Aenplemedukiah Yorious Operation Suen as Beer icet tion and updater. s) ee prota As deta, ae Sore vedecttic pusreo se 6) Th HepTELnys uae leita bebcueen retends and data a eee ;Characteristics of DBMS © Data stored into Tables: Data is never directly stored into the database. Data is stored into tables, created inside the database. Reduced Redundancy: In the modern world hard dri sare very cheap, but earlier when hard drives were too expensive, unnecessary repetition of data in database was a big problem, But DBMS follows Normalisation which divides the data in such a way that repetition is minimum. * Data Consistency: On Live data, ic. data that is being continuosly updated and added, maint ing the consistency of data can become a challenge. But DBMS handles it all by itself. ‘© Support Multiple user and Concurrent Access: DBMS allows multiple users to work on it(update. i data consistency. ert, delete data) at the same time and still manages to maintain the DATABASE MANAGEMENT SYSTEMS Page 8 © Query Language: DBMS provides users with a simple Query language, using which data can be easily fetched, inserted, deleted and updated in a database.J oems | Tere Us re ia as the rreaasunes ves is no! duplitetHen ihe in dutet bexte, se, +) ca ay Yb i, 4) Dems atlenas 4b velo the, 44s heh dt tn. reantined -Fonrct aia 3) Dade, be, tatobed to sonal ; fon , Convinien And, eb ftelend: Use Me i 4 Thda, Gn be, atesed esthtcterthy uy \ Sinn phe Qyeasy Neha Nah if ig 8 ai) The. dodcy. ictegntty Gn oe. “feinbntd Thadr | rneans “re. Constronty Case, ¢ be. applies on coda to be int Some oe “ay Gn be applied, 7 iG the.) DBMS . ables, beccasoest ciceat 4s multiple Usens by vsing tye Syochents on ) The Benin eolicies, cos be applied te Dea 4p! ollow, tre. Us) to gecess ‘only desired apeotty 106+ “Hes dedaaud Sete > Disedvactages rar vd Wid Begs pr atl COMM te i ') Comoprex ‘yee 8) Homdosae ord leno Coste | oa > 3) Duran pool el cage eine wil 4) ei vB, ; ‘*, : aAdvantages of DBMS * Controls database redundancy; It can control data redundancy because it stores all the data in one single database file and that recorded data is placed in the database. Data sharing: In DBMS, the authorized users of an organization can share the data among multiple users. © Easily Maintenance: It can be easily maintainable due to the centralized nature of the database system. Reduce time: It reduces development time and maintenance need. ‘Backup: It provides backup and recovery subsystems which create automatic backup of data from hardware and software failures and restores the data if required. «multiple user interface: It provides different types of user interfaces like graphical user interfaces, application program interfaces Disadvantages of DBMS © Cost of Hardware and Software: It requires a high speed of data processor and large memory size to run DBMS software. © Size: It occupies a large space of disks and large memory to run them efficiently. * Complexity: Database system creates additional complexity and requirements. © Higher impact of failure: Failure is highly impacted the database because in most of the organization, all the data stored in a single database and if the database is damaged due to electric failure or database corruption then the data may be lost forever.Historical perspective od DBMS:ee ‘ # ass AAG O's HR : rete Anes antne, sed fin chide | Storage ay "The poyrodt sernen Coene. qucbarrebee ° Data Could be | Input org purched Gand ma ‘Decks | ard oudpadt to 'pnictens i Le , Deda, 8G progres : ‘pene. -leraced Ley ahs mye ‘3 Oy poortrCetan | onden. 1! Ri 1460s ~ 1904 * Bt A “S wiblespneid Uke of ue" Siske Ask could be, — Omtesed wn jest tens ce paid “Second > High perforant. bud physical: chrrogé ob;~ heend disk leads to preblen. weak f— Ads t 4 - Lape its te ee de ane, | houses ere used ae) +t anoo's AoForoht eG pe Wi ptotlctbin ps fe oes veal , ers | Pe den 9 \ ')File system versus DBMS:OC sone eee Ls Fhe § stern! versus | m% oie | 4 =) Eile syste S- Ta conten’ daigs, ot Wo Stored ; to tile, eycten | _y File, Sete | in. ol metrod ty ety: “He very uu) Ce ‘bes stth a, haved ‘dicle On OER ie. if ston ) alps! eet lee betel “tebe and, alps ig the “hes / Lakes) peal alt Si ht ha asttky dithered igi Such ak mp3, tp ebe. chy tHe ae ase obs nouped into divectdniel I sanity S mt eo de influences A ob? dda), to 7 hastch ‘disk ded EX7 ze ar ape a Seotagy “te “eet Eilat e ie DENS iy f4 Sere Iga Sort bunt “Used a stom, ont Z _pegpin 6 [rebnidve. | a's btty i, a, swine! alse 3 pop taie ley oe at Secunty reese ee ae > THis, inghude. arene be pregpe A oY call q nel to A te dedeiots cle mh sol ier orate bes i, M, 1 Ui ee “a da * g dist a i i é fa X £ hg Aah : ‘ Lye Ms . Phenences x ‘ TS : 5 4 fg oa i 76.4 $ 3 f =eo A | SY collecac. to chen | > OS sed 40 te a | Omani. dhe -MNbes » glowtc in a rood disks ts the Corp ’ dated date. $8 pmesess Sewn poeesicg. as rob 3G efPic end ounch, one Nye 32. if ley ’ User s data DNG presence, ol. Heder) des} a! poe ei . 0 tone T eff 1 1ene oe The “tp le’ qo provides “he dlethane ys + DBMS: grees, on absbratt tect hides ma io ak He” code" pepyeden!. ei. ie | ' plohin ond pera ype faty ty protect afte. ender te me syste bert sue O\ geod % re rae choise fh Ww 4 Ba al q y rs chan Hf ~ 3D The) ite, syslenn, . Crash, He reer ewe | doe Ink reue 9. And DBS pre ae | Ges mec hanisin “he kn fom eypter ag : | | Lathe Pe : BBs ed ta HE, ) a te / oohich * lenge “Gdotem Gobich | | {) Totenaeledk, wa ere 14, aS a 5, | ) | &, chap te des hed——— lS 3 Died one agpoth 4 4 cele ab \ Pa y tes ae ) / Hy 1, 0 ee Cie ) Dedg, nedordasey! - ptt, Seidl duplica ion b& doa on tT diflesest pn mera Create... ae | and Abed’ -f might awe, diPexeed fo rene, ame, charces tech Gore, | ofobin 3 1 ray appear repacied! ly in sa ath i od ces places | 3) feat intensistenty *. Doda. trend Aebarss Lohen yond ne ies dy Garre, citar pay, 1° Me recdbcbeck Fen example: ¢ ¢ Peue address & ae ployee may be nelleoted i) ore. ted and 10 rest ee. “ae fv “othe! deperibned. 8 OND 3) Defiant 1A ite sing ~ We Gover ite. Syste det nok abkw loeb fo ete debe | wo eh Aicient- ase | ba u the sider! Data ‘este duh a 7 rt * dened in te cated 2 ee oi cs thin ox ‘specified pang cig arc, ot | Cornet Ren erod | ye 9 Concenmiend: Altes digtac ted! Fare a . | execution, Beaty Ve. dsesn update. ié Sinubtzne ous fy, a Sé&h a (as date ¥' (j ) ke Synebmoniged. <Se cash sto. Piles an the dabal & ceria bas Systers sired Nogphtcthon! peng) in—le. eh ase. va : added in, din od hoe reanren, jase bs Ligcotes", Fai hoes rrouy “eve Decwse. chidalose. AUD Toseland alate. ortth penal ae grobless 7 Ever) olen | e ack cMaceea aa‘What is dbms? DBMS File System DBMS is a collection of data. In DBMS, the user is not required to the procedures. File system is collection of data. In this system, the user has to write the procedures for managing the database, Searching data is easy in Doms Searching is difficul File System Dbmns is structured data Files are unstructured data No data redundancy in Doms Data redundancy is there in file system Memory utilisation well in dbms Memory utilisation poor in file system No data inconsistency in dbms Inconsistency in file system ——[]———————————————— Page 6 DATABASE MANAGEMENT SYSTEMS DBMS gives an abstract view of data that hides the details. File system provides the detail of the data representation and storage of data, DBMS provides a crash recovery mechanism, i.e., DBMS protects the user from the system failure, File system doesn't have a erash mechani it the system crashes while entering some data, then the content of the file will lost, DBMS provides a good protection mechanism. It is very difficult to protect a file under the file system, DBMS contains a wide variety of sophisticated techniques to store and retrieve the data, File system can't efficiently store and retrieve the data, DBMS takes care of Concurrent access of data Using some form of locking. In the File system, concurrent access has many problems like redirecting the file while other deleting some information or updating some information. A DBMS is software that allows creation, definition and manipulation of database, allowing users to store, process and analyse data easily. * DBMS provides us with an interface or a tool, to perform various operations like et ing database, storing data in it, updating data, creating tables in the database and a lot more, * DBMS also provides protection and security to the databases. © Italso maintains data consistency in case of multiple users. Here are some examples of popular DBMS used these days: * MySql © Oracle * SQLServer * IBM DB2Data models:S SS lll tt (ts Daf, Models Oe pak Medelz— Data mModd & a Gillection a Concepts “ uctune Bd > Dold Model addresses the Struchie of ne a or Paina Gy S path modd defines How tke lostel Siruchae o Database % modeled, procested and Types of Dekh Medes : = in Hiarddical Dale model: 1 . . . ok =D Medi . a nepert ak wide ) Hierarchical model: & objed onented Dela + Entity - Relationciip Dale Model YWirerckiol Dale Medd: It toa Dal made fn which the data fk organized ints tree The Struchine vepresents infovrnation Usin = child TRlakinstip. Steuchute . Each pahent Can have many dildrent bet cork clSld bas only ome parent. Advantage: dl M, It Suf ik Shaving. 4. ot li Delibate Costs Y, Dale. Independence %G- Database Integrity . It support one t Many reladinchip Crem) Dis- Advantages : Gen lex Implementation Difficult te Manage ~ Struchral dependency Gt deea't Suppert Many %G Many “Yelationstip fiDat, Models Q@ Nebwerk Data tedel: ry the Nehwark Medel, parents can have Sevete/ USldrevs and a diild Can have many parent Tetrds- | D> Retr are physically linked thvouh pointers. | 5 tn Net Dekibate terminalesy a velationciip % called a Set. between a pareuk and a dld. > A Sk represents one te many velationstip ' Advantages : YL Dele Aecas flentbile ly Dis Aelvonbag 4 C Siruchsal dependency M. Complex tenplemoatation Mb Sapper Sire debabate. 2)Network model:2 Dafa Models ° 3. Relational Dela Model? In fhe Relabjenal Medel tke dala ts maintained in the form of tablet. => tabla Gntein yous and Glumas. ; > pai ‘n & tobles Ts elated Hrough Cemmen Columns and nol brroush pointer: eas 3)relational model: ie Gtruchsel Indepenclonce x Zasia Dolrbase design, Fmplementatien » management and Use. Dis -Ad vantages + ST requiver latge Hordwere cmd System Sebfwere overhead Coutse> Caach Hebte, Contanes wetond » e+ er “type and seach meteoric hype: dle Res ‘* Hyed. naisonfa 18 hes ery oF), ate > Geeh reg) de tke, “fable 1S Cen lech “iple econ ond ech pahuracs oh ‘We able ¥y Friatn ied ya room ay ,(4): Ee E-R(Eetly rebbienshio) ‘ackdelt — > The clerd a mock) —thet Consistirg t seh Ol erdrtieg ond eb ae batons! pS anon ae Auge S Glled endity ~ Retains PHO Entity. Ain endity LS an obec (mM ce Ahtny Sit as PL PETS Re on a plate. in bee which eee yisees informacionrdmilouk ’~ “This deerite Ake pmo perte si, of an’ erdity) | a eL*- studed? yy op edi ky i ae Ncun€ et opin 3 olne ocho te ' 4 Relationship’. Ad astoiein re, ogni z) cued redabienship * ~ Skucen and clog ae enti 4 Sib a IN is a thi onghip & G4 dee 1 ae Sees. cast | Eorbr soht. he. Se ch ete &, a MER skype. Is, called, edity set: ae Rell ship sete “The. 3 ‘peechonalf i 4 Sarre. er (5; Codled Rehabiorship 5 sh | P te onde Nl mniy sneha med ayers Pk ited. i | Sheass sea cts ! ander “fv a "fl qn ety sh Qhombus/} . | us ens bol Dieunon &> ) MEN “a Sety a | Unks ehity se 4g otribbuds ond end & se , elation ship | — Lane . ST nse AT ne+ black based dads rebl —} The, object oniended, largecgs J Mee Cy | ay, | rey Leremicg lhe dorninand- in Sob tear : ; be des ‘ objec ‘Loned cedtet rrecel. aT bolect Lo¥s cate rook (oe jobines olojer! Amiented fe abd? S oodrth selstte rol) dort model,Level of abstraction in DBMS:oe ify ‘, ; i a | a” were mee Lewes ok Pee {Oa . ee a pABOY ip | > Levels. a cba iy { | i eo : yf aa yn bse Dade ee hined me IVS ah " i er a bala’ a amount keh afosy pes: the. | Veysters land siding” Background cts | 3 “Thee. Ame Senevon)! Veueds ‘A alogllacdtee 4 “Thee! os be OSen baer oe TR 3 ttl ca) bape ’ 3 vany. te ¢ . fy) Yiea Tease) © By ge We : i) physics! deve ® e qe 4 A , tn * Ws > THis. WS the Biel, heuead " 4 x : > “TALS Jexe} desen thes haa Holly “ig dda or ‘Stoned | jee 4Tats Nerd dois cnn Soa Jes ‘ol deh Stnuckures 4 “a f > #re- Ab -the phyglaat Dewvl the seta Student, employee, ¢ Coume Gan ‘Betf des as bce dh Conse cudie, ony ip Methy dadabate, syslens, hidé,. lex) sere dobnit s fro dih, Clea aa che 2) Logeal Jevens 7 OY ay a we i STIs is peck higher Devel, phigh » devine Ake ooh dada Ve eed ‘a4 yi est e DThis Lewel als desenties the 7ebk asnang: The dede «| | 3s “ > Tres hegiced Vese) thus Beit sa! ee dota ae, in rns ofp ber), number, g seberti vcly Simple Sita eka 3) vices Bevel ‘a = This tg highest bevel at abstteclaft at f testmibes onty peort ot- thes attics olf be >The vitw Seved, Gn providel the dares i, Ondy part: oo the. cadetlocises, (te a] " +> This Dene) Keds yn sing iD - ‘akesnetian cot “he Seti. 1 i >This System a mu oye ,| 7 | Qeved ey teed Nj ‘ Leeds | a abslrach ore an DBMS yy ni ry ¥ loah, 2 Yr agro™ _ Views vidios b-- et Ay i ico) netData Abstraction in DBMS Database systems are made-up of complex data structures. To ease the user interaction with database, the developers hide internal irrelevant details from users. This process of hiding irrelevant details from user is called data abstraction. View 2 view2 | -- Viewn logical level Physical level ‘Three Levels of data abstraction We have three levels of abstraction: Physical level: This is the lowest level of data abstraction. It describes how data is actually stored in database. You can get the complex data structure details at this level. Logical level: Thi ‘what data is stored in database, is the middle level of 3-level data abstraction architecture. It describes ‘View level: Highest level of data abstraction. This level describes the user interaction with database system,Data independence:Deda Tndependence | [Delk Andependence %& an Impertent feats % DBMS: AS ZL allows changing the Snuehue 5 the database ia making ~y chang ‘y tke Applicotion PIAgYaMs that Use The delabase- >The abilkily to modify a ma defirstter tn one level wibjout ef fecti She ini Qn tke ext “Lisbon oe %& led pala inde nee. 0° me iid > Debi. Indepemalence t Us te Keep dala Separated from all prgras thar rnake. use of UP. Tre of Dele Independence 2-04, Physical Dake Independence tested Date Tnclependence - “1. plysteal Ot Independence :- physical peli Independence f the abtlily to change the Internal Schema without effrecting ceptual Gr) exXtetra Schema of Aakibate. Pig STE independence ff erly te adnieve ab Competed te loge deta Indeperlence- Examples !- Any dp the Following changes %r physical scaihcal scan Gall nak effeck tke Contaptua) Schema. A Use % Kew Storage device Uke Hetddisk or magnetic tape --- de. J: Suithing te different dab Structhe- 4, changing the aces metiods . G. changing the loution 4, datibase. x: Drive E- Drive. ¥. logheal Dele Independence t- veal Dele Trdepenclance ts the ability ts clange tke Gnce ‘seh si . we physical ccheta oF applicdin programe. “s meg heme usikouk cprecting lie Tak Indepodence Ti mare cliffrail te achieve Thy The physical defn Indepunctence. Exams: Rwy of The Fallosingg change, ee Coneepual &el will net es ay 4 rw nud dala shan ty det bate. Xo chinae. Grthetnte thet Kernel Shuma. yp daletion dp existing cata atom Ron : he,| 1.6 Data Independence | Q47 What is data independence ? Discuss three tier schema architecture of data independence. US [INTU : Part B, Nov-17, Marks 8, Part A, May-17, Marks 3] OR What is data independence ? Why it is essential ? BSP [INTU : Part A, Nov.-15,18, Marks 4) Ans.: e Definition : Data independence is an ability by which one can change the data at one level without affecting the data at another level. Here level can be physical, conceptual or external. + Data independence is one of the. important characteristics of database management system. « By this property, the structure of the database or the values stored in the database can be easily modified by without changing the application programs. « There are two types of data independence. Conceptual level ° Fig. Q.17.1 Data independence 1. Physical Independence : © This is a kind of data independence which allows the modification of physical schema without requiring any change to the conceptual schema. ee© For example - If there is any change in memory size of database server then it will not affect the logical structure of any data object. 2. Logical independence : o This is a Kind of data independence which allows the modification of conceptual schema without requiring any change to the external schema. © For example - Any change in the table structure such as addition or deletion of some column does not affect user views. © By these data independence the time and cost acquired by changes in any one level can be reduced and abstract view of data can de provided to the user.Introduction to database design: Database design and ER diagrams:Sere iat he canines: ee Lite cd a bs 5 Paka wala as tt, | 3. Dadar. Desi ho 5 ae 3 ee eine, ¥! ond ER degen ey | Pe ; ‘ae ll ‘4 (IR \adole! 2s ne beac here! 7 : [Scheme Posies | nemens |, cubeloate ead | saan PEE ONL TOO , i 4 ih Aa By ol appticbin 4 f Serum ast sept tpn isc Tn, this Step | tt iS necessary tp diets alot Ps need es he. igtemed in. the, cbt loa he, i a step 2 ~ Conteptuad dotabare. ' clin’ - , ts ‘f ato +th’s $ which BQ-nrered is bu | OER me is high leveled iroock.| ond ip ee dedalase, dexigh | : step 2° ee catokase. deSight=! 4) ) pe ; : f A en this SER ite "abcd ER reat fs a lonwn ty grhocdicrul ‘deeibatc ant MAN A Ty | sep uy Eckeera anetinemntat 36) mle ay Ty ths | end pyle dpe ee id p sh fh aa debate ue fF A | Hes one Capa hs IS xetined th co “ J | te,slep 6 -applicabton are | Secuyrly | design) A oe 6 ® : uf , esiqn. medhede log! es hil We, mposite. attnibale, Hy upped mn i 9 ellipse. ard) thete, Hee yi Et Am ch a ip i ae OQ multivalued altsiack | t_ have mone. thon’ ore. ville ae is) GS double ellipse f ee ee ee 4 ued fir) Ly Be | A i ‘Ce id) (ror? ) tas Cr ah iH ies ae a i’ “Ena i WAT A of Mi 5 (3) hb nly An asin gh Can) be denived fromm other se Ynousn as “Denived sett & be ‘i ei By Ee Ee loe. nepreseded | by ity bi) tay : ue Oo pensen age. ckanges Oven oY . ee be. denied —Proen curerthen br beck AG ie birth wp wit A ae if PY : Ae a: a 5ER model © ER model stands for an Entity-Relationship model I is high-level data model. This ‘model is used to define the data elements and relationship for a specified system. © Itdevelops a conceptual design for the database. It also develops a very simple and easy to design view of data © InER modeling, the database structure is portrayed as a diagram called an entity relationship diagram. For example, Suppose we design a school database. In this database, the student will be an entity with attributes like address, name, id, age, etc. The address can be another entity with city, street name, pin code, ete and there will bea relationship between them. attributes DATABASE MANAGEMENT SYSTEMS Page 29 address student Component of ER Diagram Auribute Relation JX key Attribute onetoone |— compositeattribute | onetomany [— Muteivatued Attribute Many toone |— Derived attribute I— Many to many 1. Entity Aneentity may be any object, class, person or place. In the ER diagram, an entity can be represented as rectangles, ‘DATABASE MANAGEMENT SYSTEMSConsider an organization as an example- manager, product, employee, department etc. can be taken as an entity. Employee works Department for, a. Weak Entity ‘Anemtty that depends on another entity called a weak entity. The weak entity doesn't contain any key attribute ofits own. The weak entity is represented by a double rectangle, Loan Installment 2. Autribute ‘The attribute is used to describe the property of an entity. Eclipse is used to represent an attribute, For example, id, age, contact number, name, etc. can be attributes of a student. a. Key Attribute is used to represent the m: of an entity. It represents a The key atribut primary key. The key atribute is represented by an ellipse with the text underlined. —— DATABASE MANAGEMENT SYSTEMS