Scribd
Upload
1 views

BTech Database Course Topics

DATABASE

Uploaded by

sujithkumar.s2022
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

BTech Database Course Topics

DATABASE

Uploaded by

sujithkumar.s2022
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

BTech Database Course Topics

1. Normalization: First, Second, and Third Normal Forms

Normalization is a process of organizing data in a database to reduce redundancy and improve data

integrity.

The first three normal forms are crucial for designing relational databases:

- First Normal Form (1NF): Ensures each table column contains atomic values and eliminates

repeating groups.

- Second Normal Form (2NF): Ensures every non-prime attribute is fully functionally dependent on

the primary key.

- Third Normal Form (3NF): Ensures no transitive dependencies, meaning non-prime attributes are

dependent only on the primary key.

2. Boyce-Codd Normal Form (BCNF), Multivalued Dependency, and Fourth Normal Form

- BCNF: A stronger version of the third normal form, ensuring no redundancy due to functional

dependencies.

- Multivalued Dependency: Occurs when one attribute in a table uniquely determines another set of

attributes. Fourth Normal Form eliminates these issues.

3. Join Dependency and Fifth Normal Form

- Fifth Normal Form (5NF): Eliminates redundancy due to join dependencies, ensuring no

information is lost when tables are decomposed.

4. Physical Database Design and Query Processing

Physical database design focuses on storage aspects like indexing, partitioning, and ensuring

efficient query processing. Query processing refers to the steps involved in executing a query,
including parsing, optimization, and execution.

5. File Organization and Indexing

- Single-level Indexing: Involves creating a single index on a database column for faster lookup.

- Multi-level Indexing: A hierarchical index structure that provides efficient access.

- B+ Tree Indexing: A balanced tree structure commonly used for databases to maintain sorted data

for efficient retrieval.

- Hashing Techniques:

- Static Hashing: Uses a fixed number of buckets to store data.

- Dynamic Hashing: Allows for dynamic resizing of buckets as data grows.

6. Relational Algebra and SQL Queries

Relational Algebra is a formal system for manipulating relations in a database. It consists of several

operations such as SELECT, PROJECT, and JOIN.

- Translating SQL Queries into Relational Algebra: SQL queries can be mapped into relational

algebra expressions, facilitating efficient query processing.

7. Query Processing and Optimization

- Algebraic Query Optimization: Rewriting queries using algebraic rules to reduce cost.

- Heuristic Query Optimization: Using heuristic rules like pushing SELECT operations as early as

possible.

- Join Query Optimization: Optimizing joins using methods like indexing and hashing.

8. Tuple Relational Calculus

Tuple Relational Calculus is a non-procedural query language that specifies what data to retrieve

without defining how to retrieve it.


9. Transaction Processing and Recovery

- ACID Properties: Transactions should have Atomicity, Consistency, Isolation, and Durability

properties.

- Transaction States: A transaction can be in several states such as active, partially committed,

committed, and aborted.

- Serializability: Refers to the correct execution of concurrent transactions in a database.

You might also like