Ramya - Syllabus-& Unit - 1.
Ramya - Syllabus-& Unit - 1.
UNIT-I
Dr.P.Ramya
Associate Professor
Department of Computer Science and Engineering
Database Systems– DBMS Architecture – Data Independence – Data Models - Entity-relationship model, network model,
Relational Model Concepts – Relational Algebra – SQL – Basic Queries – Views – Constraints - Embedded SQL - Database
Design – Functional Dependencies – Normal Forms –1NF – 2NF- 3NF- BCNF - Join Dependencies and Fifth Normal
Form.
Transaction Processing – Properties of Transactions - Serializability – Transaction Support in SQL -Locking Techniques –
Time Stamp Ordering - Recovery Concepts – Shadow Paging – Log Based Recovery – Database Security Issues.
File Operations – Hashing Techniques – Indexing – Single level and Multi-level Indexes – B+ Tree –Static Hashing - Query
Distributed Databases: Architecture – OODBMS – Object-Based Databases - OO Data Model - OO Languages –Object
• REFERENCES:
Redundant data can be present in a file system. In DBMS there is no redundant data.
It doesn’t provide backup and recovery of data if it is It provides backup and recovery of data even if it is
lost. lost.
File systems provide less security in comparison to DBMS has more security mechanisms as compared to
DBMS. file systems.
Only one user can access data at a time. Multiple users can access data at a time.
• Airlines
• Universities
• Railways
• Finance
Database System Applications
• DBMS contains information about a particular enterprise
– Collection of interrelated data
– Set of programs to access the data
– An environment that is both convenient and efficient to use
• Database Applications:
– Banking: all transactions
– Airlines: reservations, schedules
– Universities: registration, grades
– Sales: customers, products, purchases
– Online retailers: order tracking, customized
recommendations
– Manufacturing: production, inventory, orders, supply chain
– Human resources: employee records, salaries, tax
deductions
• Databases touch all aspects of our lives
Why Study Databases??
• A database, data is organized strictly in row and column
format. The rows are called Tuple or Record.
• The data items within one row may belong to different data
types. On the other hand, the columns are often called
Domain or Attribute.
Is to separate the user application and the
physical database
Level of Abstraction
• Abstraction – Hiding the complexity
• Relational Model
• Hierarchical Model
• Network Model
Attributes
Relations
hips
• Advantages
• It is easy to develop relational model using E-R
Model.
• Disadvantages
• It is just used for database design not for
implementation.
Relational Model
• Most widely used model.
• One-to-many relationship
Advantages:
Disadvantages:
• The two objects are connected through a common attribute i.e the Department_id
There are different types of attributes
in DBMS:
• Simple attributes - cannot be divided further (Weight )
• Single Valued attributes – Hold single value for a single entity ( Room_No)
• Rollback: It is used to restore the database to original since the last Commit.
• ROLLBACK − to roll back the changes. SAVEPOINT − creates points within the
groups of transactions in which to ROLLBACK.
• DQL used to retrieve data.
• Each department has multiple instructors (one person is HOD). Here the HOD refers to the
head of department.
• Each department offers multiple courses, each subject is taught by a single instructor.
• Follow the steps given below to draw an Entity Relationship (ER) diagram for a University database
application −
• Department
• Course
• Student
• Instructor
• Head of the Department (HOD) is not an entity set. It is a relationship between the instructor and
department entities.
• Step 2 − Identifying the attributes for the given entities
• Instructor − The relevant attributes are Instructor Name, Room No, and
telephone number.
• Student − The relevant attributes are Student No, Student Name, and date
of birth.
• Step 3 − Identifying the Key attributes
• 1. Storage manager is a program module that provides the interface between the
low-level data stored
• in the database and the application programs and queries submitted to the
system.
implementation:
metadata.
• c. Indices: They provide fast access to data items holding particular values.
• b. Query Processor: It is one of the functional components of DBMS. It translates
understands. It may also attempt to find an equivalent but more efficient form.
• a. DML compiler - It converts DDL statements to a set of tables containing metadata stored in
a data dictionary.
• b. DDL interpreter – It interprets DDL statements and records definitions into data dictionary.
• a. DML compiler - It converts DDL statements to a set of tables containing metadata stored in a
data dictionary.
• b. DDL interpreter – It interprets DDL statements and records definitions into data dictionary.