0% found this document useful (0 votes)
32 views12 pages

Dbms

Uploaded by

k1fepkgt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
32 views12 pages

Dbms

Uploaded by

k1fepkgt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
o ER model stands for an Entity-Relationship model. It is a high-level data model. This model is used to define the data elements and relationship for a specified system. o It develops a conceptual design for the database. It also develops a very simple and easy to design view of data. o In ER modeling, the database structure is portrayed as a diagram called an entity- relationship diagram. Ex} Table of Content v DML is the DDL is the acronym for acronym for the the data definition data language. manipulation language. DDL is used to create DML is used to database schema and delete, update also define constraints and update data as well in the database. DML commands affect the one or two rows of the DDL commands affect the whole table of the database. table. The DDL language is This language is used to change the used to manage structure of the the data in the database. database. DML is further classified as DDL does not have procedural DML. further classification. and non- proceds DDL has base pdates the rol defined the . of the table. column(attributes) of These rows are the table. called tuples. DMI statement a a a Home Practice Test Series Premium, oe a eo Physical Data Logical Data Independence Independence . It mainly concerned It mainly concern about about the structure or the changing data definition. how the data is stored into the system. It is difficult to retrieve because the data is It is easy to retrieve. . mainly dependent on the logical structure of data. As compared to the As compared to the logical independence it physical independence it is easy to achieve is not easy to achieve physical data logical data independence. independence. Any change at the . The change in the logical physical level, does not ~ . level requires a change require to change at the a oe at the application level. application level. The modifications made The modifications made at the internal level may at the logical level is or may not be needed to significant whenever the improve the logical structure of the performance of the database is to be structure. changed. It is concerned with the It is concerned with the internal schema. conceptual schema. Example: Change in compression Cuannieas Add shdadifc ar Simplicity @, iM @ Data Security . ee Data Integration @. . * @® Data Privacy Data Migration 2. vs, St i ®D Data Concurrency Data Access €)-...... Advantages) ....- @ Data Redundancy Decision Making 8 oof . ®Data Inconsistency Backup & Recovery Go “ oo = ® Low Maintenance @) Data Sharing 7 a . © Multi-Access Support Data Integrity Qo ® End-User Productivity www.tutorialsmate.com Database Management System o Database management system is a software which is used to manage the database. For example: MySQL, Oracle, etc are a very popular commercial database which is used different applications. o DBMS provides an interface to perform various operations like database creation, storing data in it, updating data, creating a table in the database and a lot more. o It provides protection and security to the database. In the case of multiple users, it also maintains data consistency. Constraints in DBMS are the restrictions that are applied to data or operations on the data. This means that constraints allow only a particular kind of data to be inserted in the database or only some particular kind of operations to be performed on the data in the database. Thus, constraints ensure the correctness of data in a Database Management System (DBMS). Now, let us discuss the different types of constraints in DBMS. What is Aggregation ? e Aggregation is a design strategy in which the relationship is modelled between a collection of entities and another relationship. e Simply it is used when we need Express a relationship among other relationships. Aggregation in DBMS University —— Offers —— Course —~—ee ¢ Amultivalued attributed in DBMS(Data Base Management System) is an attribute that can have multiple value for a single intance of an entity. e For example, a person may have multiple phone numbers, so the “Phone Number” attribute for that person would be a multivalued attribute. ENTITY An entity is an object in RDBMS that is used to model and store information LPP eee | NS UL objects of the RDBMS 4 row ora record in 5) the table Ue ATTRIBUTE PAN Mettb ato) t iC te characteristic to define Pata DIoru emus a IRR RRR RRR RRR RRS SEE EE Pe mem EL) Ma ea awe a Bee eee History Of DataBase * Ancient Times: Human beings began to store information very long ago. In the ancient times, elaborate database systems were developed by government offices, libraries, hospitals, and business organizations, and some of the basic principles of these systems are still being used today. © 1970 to 1972: E.F. Codd published an important paper to propose the use of a relational database model, and his ideas changed the way people thought about databases. In his model, the database’s schema, or logical organization, is disconnected from physical information storage, and this became the standard principle for database systems. een Cay Teaco It can be a column or combination of columns which can be qualify as Unique key. A table can have more than one candidate key, but only one candidate key can be primary key. Candidate key is minimal super key from which you cannot remove any fields else it will not be able to uniqule identify the rows. We can say that candidate key is the proper subset of super key. While in a relation, number of candidate keys are less than number of super keys. dddLanguage Candidate key’s attributes can also contain NULL values Candidate Key is a proper subset of a super key. All candidate keys are super keys. Various candidate keys together makes the criteria to select the primary keys. Asuper key is a set or one of more columns to uniquely identify rows in a table. Super key is any combination of columns which uniquely identify a row in the table. In a relation, number of super keys are more than number of candidate keys DMLionanguage Super key’s attributes can contain NULL values ‘Super Key is an attribute (or set of attributes) that is used to uniquely identifies all attributes in a relation. All super keys can't be candidate keys Various super keys together makes the criteria to select the candidate keys Lares alermecre Srmererenvtitanertioruraal,

You might also like