techprolog

Data Base Management System

4.7 (253 user ratings)
4.7/5

About Specialization:

Data Base Management System

It is fair to say that databases play a critical role in almost all areas where computers are used, including business, electronic commerce, engineering, medicine, genetics, law, education, and library science. DBMS is a general-purpose software system that facilitates the processes of defining, constructing, manipulating, and sharing databases among various users and applications. Types of DBMS include relational database management systems (RDBMS), which store data in tables with rows and columns, and non-relational or NoSQL databases, which use different data models such as document-oriented, key-value, or graph databases.

Key Features/Course content

  1. Introduction
  2. Database System Applications
  3. Database Systems Vs File Systems
  4. View of Data
    1. Data Abstraction
      1. Physical Level, Conceptual Level, View Level
    2. Instances and Schemas
      1. Physical Schema, Logical Schema
    3. Data Independence
      1. Physical Data Independence, Logical Data Independence
  5. Data Models
    1. The Entity-Relationship Model
    2. Relational Model
    3. Other Data Models
  6. Database Languages
    1. Data-Definition Language
    2. Data-Manipulation Language
  7. Database Users and Administrators
    1. Database Users and User Interfaces
      1. Naïve Users, Application Programmers, Specialized Users
    2. Database Administrator
  8. Transaction Management
    1. Transaction
      1. Atomicity, Consistency, Durability
  9. Database System Structure
    1. Storage Manager
      1. Authorization and integrity manager, Transaction manager, File manager, Buffer manager
      2. Data files, Data dictionary, Indices
    2. The Query Processor
      1. DDL interpreter, DML compiler, Query evaluation engine
  10. Application Architectures
    1. Client, Server
      1. 2-Tier Architecture
      2. 3-Tier Architecture
  1. Beyond ER Design
  2. Entities, Attributes and Entity sets
  3. Relationships and Relationship sets
  4. Additional features of ER Model
  5. Conceptual Design with the ER Model
  6. Conceptual Design for Large enterprises
  7. Relational Model:
    1. Introduction to the Relational Model
      1. Integrity Constraints over Relations
      2. Enforcing Integrity constraints
      3. Querying relational data
    2. Introduction to Views
    3. Destroying /altering Tables and Views.
  1. Overview of the SQL Query Language
  2. SQL Data Definition
  3. Basic Structure of SQL Queries
  4. Set Operations
  5. Null Values
  6. Aggregate Functions
  7. Nested Subqueries
  8. Modification of the Database
  9. Join Expressions
  10. Views
  11. Transactions
  12. Integrity Constraints
  1. Introduction to Schema Refinement
  2. Problems Caused by redundancy
  3. Decompositions Problem related to decomposition
  4. Functional Dependencies
  5. Normal Forms
    1. FIRST, SECOND, THIRD Normal forms
    2. BCNF
  6. Properties of Decompositions
  7. Lossless join
  8. Decomposition
  9. Dependency preserving Decomposition
  10. Schema Refinement in Database Design
    1. Multi valued Dependencies
      1. FOURTH Normal Form
    2. Join Dependencies
      1. FIFTH Normal form.
  1. Transaction Concept
    1. Transaction State
    2. Implementation of Atomicity and Durability Concurrent Executions
    3. Serializability Recoverability
    4. Implementation of Isolation
    5. Testing for Serializability
  2. Concurrency Control
    1. Lock –Based Protocols
    2. Timestamp Based Protocols
    3. Recovery System
    4. Failure Classification
    5. Storage Structure
    6. Recovery and Atomicity
    7. Log Based Recovery
  3. Overview of Storage and Indexing:
    1. File Organization and Indexing
    2. Clustered Indexes, Primary and Secondary Indexes
    3. Index data Structures
      1. Hash Based Indexing
      2. Tree based Indexing
  4. Comparison of File Organizations
  5. Tree Structured Indexing
    1. Intuitions for tree Indexes
    2. Indexed SequentialAccess Methods (ISAM)
  6. B+ Trees:
    1. A Dynamic Index Structure, Search, Insert and Delete.
  7. Hash Based Indexing:
    1. Static Hashing, Extendable hashing, Linear Hashing
    2. Extendible vs. Linear Hashing

Videos

Scroll to Top