Scribd
Upload
2 views

dbms_mid2

Uploaded by

darkendusk07
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

dbms_mid2

Uploaded by

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

1.Explain about functional dependency?

Functional dependency is a fundamental concept in relational


database design and normalization. It describes a relationship between attributes (columns) in a relational
database table. In simple terms, a functional dependency occurs when the value of one attribute (or a
combination of attributes) uniquely determines the value of another attribute.

2. What is schema refinement?

Schema refinement refers to the process of improving the design of a database schema to ensure it is efficient,
consistent, and free from data anomalies. It involves restructuring the database schema to better align with
principles of normalization, reduce redundancy, and enhance data integrity.

3.Explain the problems due to redundancy?

Redundancy in a database occurs when the same data is stored in multiple places. While it may seem harmless
initially, redundancy often leads to several problems that can impact the efficiency, consistency, and integrity of
the database.

4.What is Decomposition ?

Decomposition in DBMS refers to the process of breaking a larger, more complex database schema into two or
more smaller, simpler, and well-structured schemas while preserving the original data and its dependencies.
Decomposition is commonly applied during normalization to eliminate redundancy, avoid anomalies, and
ensure data consistency.

5.Define Multi valued dependencies and join dependency?


A multi-valued dependency is a type of dependency in a relational database where one attribute in a table
determines multiple independent values of another attribute, regardless of other attributes in the table.

MODULE-4

1.What is locking Protocol?

A locking protocol is a set of rules used in database systems to manage concurrent transactions and ensure data
consistency and isolation. Locking protocols are fundamental to concurrency control mechanisms, as they
prevent race conditions

2.What is transaction? Explain the properties of transaction.

A transaction in a Database Management System (DBMS) is a logical unit of work that performs a sequence of
operations to access or modify the database. These operations are treated as a single, indivisible unit
The properties of transaction are A-atomicity,C-consistency,I-isolation,D-durability.

3.Write about Log based recovery?

Log-based recovery is a method used in Database Management Systems (DBMS) to ensure the database
remains consistent and can be restored to a correct state after system failures, such as crashes or power
outages.

4.Explain about Serializability?


In DBMS, serializability is a key concept in concurrency control, ensuring the correctness of concurrent
transaction execution. It determines whether the outcome of executing multiple transactions concurrently is
equivalent to some serial (one-after-another) execution of the same transactions.

5. Explain about Schedules?


A schedule is the sequence in which the operations (read, write, commit, abort) of multiple transactions are
executed. Schedules are essential to understand how concurrent transactions interact with the database and
how their execution impacts consistency and correctness.

MODULE-5
1.What is primary and secondary indexing?
Primary Indexing refers to an index that is created on a primary key or unique identifier of the table, ensuring
that the indexed column has a unique value for every record. The primary index is typically used to improve the
speed of queries that involve primary keys.
Secondary Indexing refers to an index that is created on a non-primary key column or any column that is not
part of the table's primary key. Secondary indexes allow faster retrieval of records based on non-unique or non-
primary key fields. Multiple secondary indexes can be created on a table for different columns.

2.What are the features of B+ trees?


 Balanced: All leaf nodes are at the same level.
 Sorted: Keys are stored in sorted order.
 Internal Nodes: Only store keys, which are used to guide the search.
 Leaf Nodes: Store actual data and are linked for sequential access.

3. Explain difference between indexing and hashing?


Indexing:
The primary purpose of indexing is to speed up search operations.
Indexes allow for faster access to records by storing a structured reference to the data.
An index a tree-based or B+ tree structure.
Hashing:
Hashing is used to map data to fixed-size values (hash codes) using a hash function.
A hash function is used to calculate the hash value.
Hashing does not maintain any order of the data.

4. What is an index on a file of records? Why is it needed?.


An index on a file of records is a data structure that is used to improve the speed of searching, retrieving, and
updating records in a file or database table.
Indexes are essential because they provide significant performance improvements for various database and file
operations. They are needed for fast search and retrieval and efficient for range queries.

5. Define Types of Indexing


Indexing is a technique used to speed up the retrieval of records from a database. There are various types of
indexes:
1.single level index
2.multi level index
3. clustered index
4.non-clustered index
5.hash index

You might also like