Scribd
Upload
3K views

Database Concepts Class 12 Computer Science

A database is a collection of related information organized in a way that allows for easy access, modification, and maintenance of data. A database management system (DBMS) is software that can create and manage databases, allowing users to store, manage, update, retrieve, and query data. The relational data model represents a database as a collection of tables that contain rows and columns. Tables have unique names and represent relations, while rows represent tuples (records) and columns represent attributes. Keys like primary keys and foreign keys establish relationships between tables and uniquely identify tuples.

Uploaded by

Shaku Joshi
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3K views

Database Concepts Class 12 Computer Science

A database is a collection of related information organized in a way that allows for easy access, modification, and maintenance of data. A database management system (DBMS) is software that can create and manage databases, allowing users to store, manage, update, retrieve, and query data. The relational data model represents a database as a collection of tables that contain rows and columns. Tables have unique names and represent relations, while rows represent tuples (records) and columns represent attributes. Keys like primary keys and foreign keys establish relationships between tables and uniquely identify tuples.

Uploaded by

Shaku Joshi
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

DATABASE CONCEPTS

WHAT IS A DATABASE?

DATABASE IS A COLLECTION OF
RELATED INFORMATION THAT IS
ORGANIZED IN SUCH A WAY THAT
SUPPORTS FOR EASY ACCESS,
MODIFY, AND MAINTAIN DATA.
WHAT IS A DATABASE MANAGEMENT SYSTEM

• A DATABASE MANAGEMENT SYSTEM


(DBMS) OR DATABASE SYSTEM IS A
SOFTWARE THAT CAN BE USED TO
CREATE AND MANAGE DATABASES. DBMS
LETS USERS TO CREATE A DATABASE,
STORE, MANAGE, UPDATE/MODIFY AND
RETRIEVE DATA FROM THAT DATABASE
BY USERS OR APPLICATION PROGRAMS.
• SOME EXAMPLES OF DBMS INCLUDE
MYSQL, ORACLE, POSTGRESQL, SQL
SERVER, MICROSOFT ACCESS, MONGODB.
FEATURES OF A GOOD DBMS
• PROVIDES EASE OF ACCESS TO DATA: THE DBMS SERVES AS AN INTERFACE BETWEEN
THE DATABASE AND END USERS OR APPLICATION PROGRAMS. RETRIEVING DATA FROM A
DATABASE THROUGH SPECIAL TYPE OF COMMANDS IS CALLED QUERYING THE
DATABASE. IN ADDITION, USERS CAN MODIFY THE STRUCTURE OF THE DATABASE
ITSELF THROUGH A DBMS
• REDUCES DATA REDUNDANCY: REDUNDANCY MEANS SAME DATA ARE DUPLICATED IN
DIFFERENT PLACES. REDUNDANCY LEADS TO EXCESS STORAGE USE AND MAY CAUSE
DATA INCONSISTENCY ALSO. A GOOD DATABASE REDUCES REDUNDANCY.
• REDUCES DATA INCONSISTENCY: DATA INCONSISTENCY OCCURS WHEN SAME DATA
MAINTAINED IN DIFFERENT PLACES DO NOT MATCH. A GOOD DATABASE HAS FEATURES
TO AVOID INCONSISTENCY.
• FACILITATES CONTROLLED DATA SHARING: A DATABASE SYSTEM HIDES CERTAIN
DETAILS ABOUT HOW DATA ARE ACTUALLY STORED AND MAINTAINED. THUS, IT
PROVIDES USERS WITH AN ABSTRACT VIEW OF THE DATA. A DATABASE SYSTEM HAS A
SET OF PROGRAMS THROUGH WHICH USERS OR OTHER PROGRAMS CAN ACCESS,
RELATIONAL DATA MODEL

IN THE RELATIONAL DATA MODEL,


DATABASE IS REPRESENTED AS
COLLECTION OF RELATED TABLES.
EACH TABLE IS TERMED AS RELATION
AND HAS ITS UNIQUE NAME IN THE
RELATIONAL DATA MODEL. TABLES
ARE FORMED BY USING ROWS AND
COLUMNS. A ROW (HORIZONTAL
SUBSET) OF A TABLE REPRESENTS A
TUPLE OR RECORD, WHILE COLUMN
(VERTICAL SUBSET) OF A TABLE
REPRESENTS AN ATTRIBUTE.
TERMS RELATED TO RELATIONAL DATA
MODEL
• RELATION: IN A RELATIONAL DATABASE, A RELATION MEANS A 'TABLE', IN WHICH DATA
ARE ORGANIZED IN THE FORM OF ROWS AND COLUMNS. THEREFORE, IN DATABASE,
RELATIONS ARE EQUIVALENT TO TABLES.
• ATTRIBUTE: CHARACTERISTIC OR PARAMETERS FOR WHICH DATA ARE TO BE STORED IN
A RELATION. SIMPLY STATED, THE COLUMNS OF A RELATION ARE THE ATTRIBUTES
WHICH ARE ALSO REFERRED AS FIELDS.
• TUPLE: EACH ROW OF DATA IN A RELATION (TABLE) IS CALLED A TUPLE. IN A TABLE
WITH N COLUMNS, A TUPLE IS A RELATIONSHIP BETWEEN THE N RELATED VALUES
• DOMAIN: IT IS A SET OF VALUES FROM WHICH AN ATTRIBUTE CAN TAKE A VALUE IN
EACH ROW.
• DEGREE: THE NUMBER OF ATTRIBUTES IN A RELATION IS CALLED THE DEGREE OF THE
RELATION.
• CARDINALITY: THE NUMBER OF TUPLES IN A RELATION IS CALLED THE CARDINALITY
THREE IMPORTANT PROPERTIES OF A
RELATION
PROPERTY 1: IMPOSES FOLLOWING RULES ON AN ATTRIBUTE OF THE RELATION.
• EACH ATTRIBUTE IN A RELATION HAS A UNIQUE NAME.
• SEQUENCE OF ATTRIBUTES IN A RELATION IS IMMATERIAL.
PROPERTY 2: GOVERNS FOLLOWING RULES ON A TUPLE OF A RELATION.
• EACH TUPLE IN A RELATION IS DISTINCT.
• SEQUENCE OF TUPLES IN A RELATION IS IMMATERIAL. THE TUPLES ARE NOT CONSIDERED TO BE ORDERED, EVEN
THOUGH THEY APPEAR TO BE IN TABULAR FORM.
PROPERTY 3: IMPOSES FOLLOWING RULES ON THE STATE OF A RELATION.
• ALL DATA VALUES IN AN ATTRIBUTE MUST BE FROM THE SAME DOMAIN ( OR SAME DATA TYPE).
• EACH DATA VALUE ASSOCIATED WITH AN ATTRIBUTE MUST BE ATOMIC (CANNOT BE FURTHER DIVISIBLE INTO
MEANINGFUL SUBPARTS).
• NO ATTRIBUTE CAN HAVE MANY DATA VALUES IN ONE TUPLE.
• A SPECIAL VALUE “NULL” IS USED TO REPRESENT VALUES THAT ARE UNKNOWN OR NON-APPLICABLE TO CERTAIN
ATTRIBUTES.
KEYS IN A RELATIONAL DATABASE

RELATIONAL DATA MODEL IMPOSES


SOME RESTRICTIONS OR
CONSTRAINTS ON THE VALUES OF THE
ATTRIBUTES AND HOW THE CONTENTS
OF ONE RELATION BE REFERRED
THROUGH ANOTHER RELATION. THESE
RESTRICTIONS ARE SPECIFIED AT THE
TIME OF DEFINING THE DATABASE
THROUGH DIFFERENT TYPES OF KEYS
KEYS IN A RELATIONAL DATABASE

• PRIMARY KEY: AN ATTRIBUTE OR


SET OF ATTRIBUTES THAT
UNIQUELY IDENTIFIES A TUPLE
WITHIN A RELATION IS CALLED
PRIMARY KEY.
KEYS IN A RELATIONAL DATABASE

• COMPOSITE PRIMARY KEY: IF NO


SINGLE ATTRIBUTE IN A RELATION
IS ABLE TO UNIQUELY DISTINGUISH
THE TUPLES, THEN MORE THAN ONE
ATTRIBUTES ARE TAKEN TOGETHER
AS PRIMARY KEY. SUCH A PRIMARY
KEY CONSISTING OF MORE THAN
ONE ATTRIBUTE IS CALLED
COMPOSITE PRIMARY KEY.
KEYS IN A RELATIONAL DATABASE

• CANDIDATE KEY: CANDIDATE KEYS


ARE SET OF ATTRIBUTES IN THE
RELATION THAT ARE ELIGIBLE TO
ACT AS A PRIMARY KEY.
• ALTERNATE KEY: OUT OF THE
CANDIDATE KEYS, AFTER SELECTING
A KEY AS PRIMARY KEY, THE
REMAINING KEYS ARE CALLED
ALTERNATE KEY.
KEYS IN A RELATIONAL DATABASE
• FOREIGN KEY: A FOREIGN KEY IS AN
ATTRIBUTE WHOSE VALUE IS DERIVED
FROM THE PRIMARY KEY OF ANOTHER
RELATION. A FOREIGN KEY IS USED TO
REPRESENT THE RELATIONSHIP BETWEEN
TWO RELATIONS.
• ANY ATTRIBUTE OF A RELATION
(REFERENCING), WHICH IS USED TO REFER
CONTENTS FROM ANOTHER (REFERENCED)
RELATION, BECOMES FOREIGN KEY IF IT
REFERS TO THE PRIMARY KEY OF
REFERENCED RELATION
• THE REFERENCING RELATION IS CALLED
FOREIGN RELATION. THE RELATION IN
WHICH THE REFERENCED PRIMARY KEY IS
THANK YOU

You might also like