Infinity Batch

Infinity Batch
Infinity Batch
Infinity Batch
Infinity Batch
Infinity Batch
DBMS
• Data is a collection of facts, such as numbers, words, measurements,
observations or just descriptions of things.
• A database is a collection of related data which represents some aspect of
the real world.
• Database Management System (DBMS) is a software for storing and
retrieving users' data while considering appropriate security measures.
Infinity Batch
DBMS according to GATE (7 to 9 Marks)
➢Key Concepts and Functional Dependency( 1 marks)
➢Normalization(2 marks)
➢Transaction and Serializability(2 marks)
➢Hashing and Indexing( 1 marks or 2 marks)
➢SQL ( 2 marks)
➢Relational Algebra ( 2 marks)
➢Tuple Relational Calculus ( 2 marks)
➢E-R Diagram ( 1 marks)
Infinity Batch
➢Key Concepts and Functional Dependency( 1 marks)
➢Definition of Keys and Attributes Participating in Keys
➢Functional Dependencies
➢Types of Functional Dependency
➢Rules of Functional Dependencies
➢Attribute Closure
➢How to find Candidate keys?
➢How to find Super Keys?
➢Minimal Cover
➢Problem Caused by redundancy
➢ Equivalence set of Functional Dependency
Infinity Batch
➢Normalization(2 marks)
➢Problem with Unnormalized Data Base
➢Normalization
➢1NF
➢2NF
➢3NF
➢BCNF
➢4NF
➢Multivalued Dependencies
➢Decomposition
➢Lossy
➢Lossless
➢Dependency Preserving
➢Dependency Not Preserving
➢2NF, 3NF, BCNF Decomposition
Infinity Batch
➢Transaction and Serializability(2 marks)
➢Introduction
➢Transaction State Chart
➢ACID Properties
➢Schedule
➢Serial
➢Concurrent
➢Serializability
➢Conflict Serializability
➢View Serializability
➢Types of Failures
➢Recoverable/irrecoverable/cascade less/strict schedules
➢Locking Protocol
➢2PL(S2PL/R2PL/C2PL)
➢Deadlock Avoidance(wait and die/ wound and wait)
➢Time Stamp Protocol
➢Thomas Write Rule
➢Multiple Granularity Protocol
Infinity Batch
➢SQL ( 2 marks)
➢Introduction
➢Basic SQL Queries
➢Nested Queries
➢Corelated Subqueries
➢Set Operations
➢Aggregate Functions
➢Group By and Having Clauses
➢Null Values
Infinity Batch
➢Relational Algebra ( 2 marks)
➢Introduction
➢Selection and Projection
➢Set Operations
➢The Rename Operations
➢Joins
➢Division
➢TRC
➢DRC
Infinity Batch
➢Hashing and Indexing( 1 marks or 2 marks)
➢Hashing
➢Hash Collision
➢Collision resolving techniques
➢File Organization
➢Indexing
➢Multilevel Indexig
➢B/B+ tree
Infinity Batch
➢E-R Diagram ( 1 marks)
➢Database Design
➢Entity, Attributes, Relationship, Entity Set
➢Relationship set
➢Constraints
➢ER diagram to Table
➢Minimization of ER Diagram
➢Weak entity set
➢Specialization and Generalization
➢Aggregation
➢Ternary and N-ary Relationship
Infinity Batch
Infinity Batch
rollno name cno cname grade
1 Raj 1 DBMS A
1 Raj 2 OS B
2 Rahul 1 DBMS B
3 Rahul 2 OS A
Infinity Batch
Infinity Batch
Infinity Batch
Infinity Batch
Infinity Batch