[go: up one dir, main page]
Scribd
Upload
3 views3 pages

dbms-2.1 answer

The document contrasts file processing systems, which offer simpler data management but lack integrity and concurrent access, with database processing systems that utilize tables and relationships for complex data management. It outlines basic relational algebra operations, defines entities, relationships, and attributes in ER models, and explains the advantages of BCNF over 3NF. Additionally, it discusses transaction properties, hash-based indexing, components of a query processor, distributed databases, encryption, and challenges of using encrypted systems.

Uploaded by

jebas5294
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
3 views3 pages

dbms-2.1 answer

The document contrasts file processing systems, which offer simpler data management but lack integrity and concurrent access, with database processing systems that utilize tables and relationships for complex data management. It outlines basic relational algebra operations, defines entities, relationships, and attributes in ER models, and explains the advantages of BCNF over 3NF. Additionally, it discusses transaction properties, hash-based indexing, components of a query processor, distributed databases, encryption, and challenges of using encrypted systems.

Uploaded by

jebas5294
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1.Differentiate File processing system and Database processing system?

File processing system :File systems store data in files sing systems . File systems offer
simpler data management but lack features like data integrity, concurrent access, and
efficient query.

database processing systems: database systems use tables and relationships. Database
systems provide more robust features for large, complex data management.

2. 2.List out some relational algebra operation?

Basic Relational Algebra Operations:


Selection (σ): Filters rows based on a specified condition.
Projection (π): Retrieves specific columns (attributes) from a relation.
Union (∪): Combines rows from two relations, eliminating duplicates.
Set Difference (-): Returns rows that are in the first relation but not in the second.
Cartesian Product (X): Combines every row of one relation with every row of another.
Rename (ρ): Changes the schema of a relation (name of the relation or its attributes).
3.Define Entity,Relationship and Attribute in ER Model?

Entities:Entities represent objects or concepts in the real world that are relevant to the database.

Attributes:Attributes are the characteristics or properties that describe an entity.


Relationships:Relationships define how entities are connected or related to each other.
4.Why BCNF is prefferd over in 3NF?

BCNF is preferred over 3NF because it's a stricter form of normalization, leading to fewer
anomalies and better data integrity. While 3NF eliminates transitive dependencies, BCNF
ensures that every non-trivial functional dependency's determinant is a superkey.

This stricter rule eliminates more redundancies and anomalies, such as update, insertion, and
deletion anomalies, that might still exist in a table in 3NF.

5.List the properties of transaction?

1. Atomicity: A transaction is treated as a single, indivisible unit. Either all operations within the
transaction are completed successfully, or none of them are. If any part of the transaction fails,
the entire transaction is rolled back, ensuring that no partial updates are applied to the database.

Consistency: A transaction must bring the database from one consistent state to another. This
means that all database constraints and rules are maintained before and after the transaction. For
example, a transaction transferring money between two accounts must ensure that the total
amount of money remains the same before and after the transaction

Isolation: Transactions should be isolated from each other, meaning that the execution of one
transaction should not be affected by the execution of another transaction, and vice versa. This
ensures that each transaction sees the database in its initial state before any other transaction
begins, preventing data corruption or inconsistencies due to concurrent access. ction.

Durability: Once a transaction is committed, its changes are permanently saved in the database
and will survive system crashes or failures. This ensures that the database remains consistent and
reliable even in the face of unexpected events.

6.What is hash based indexing?

Hash-based indexing is a database indexing technique that uses a hash function to map each
value of the indexed column to a "bucket" where related rows are stored. This method is highly
efficient for exact match queries, making it ideal for situations where you need to quickly find
rows based on specific key values.

7.List three components of query processor?

Three main components of a query processor are the parser, the optimizer, and the executor. The
parser translates the SQL query into an internal format, the optimizer generates an efficient
execution plan, and the executor executes the plan against the database.

● Parser:
This component analyzes the SQL query, checks for syntax errors, and translates it into an
internal representation suitable for processing.
● Optimizer:
The optimizer analyzes the internal representation of the query and generates a query execution
plan that specifies how to retrieve the data efficiently. This involves choosing the best order for
joins, selecting appropriate access paths (like indexes), and optimizing other aspects of query
execution.
● Executor:
This component carries out the actual execution of the query based on the plan generated by the
optimizer. It interacts with the storage manager to retrieve data from the database and performs
any necessary operations (like filtering, sorting, and aggregation) to produce the final result.

8.Define distributed databases?

A distributed database is a database system where data is stored and managed across multiple,
interconnected sites, typically connected through a network. This allows for data to be physically
located in different geographical locations or across different servers, while appearing as a
single, unified database to users.

9.Define encryption with an example?

Encryption is the process of converting readable data into an unreadable format (ciphertext)
using a specific algorithm and key. This process protects data from unauthorized access, making
it secure and confidential. A simple example is the Caesar cipher, where each letter is shifted by
a certain number in the alphabet. For instance, "HELLO" becomes "JKNNQ" when shifted by 2.

10.What are the challenges faced when an using encrypted system?

Using encrypted systems presents several challenges, primarily centered around key
management, compatibility, performance, and the potential for vulnerabilities. Key management,
especially in large organizations, can be complex, requiring robust systems to handle generation,
storage, distribution, and revocation. Compatibility issues can arise with older systems and
applications, and encryption can also impact performance, adding latency and resource
overhead. Furthermore, encryption is only as secure as the keys, and vulnerabilities in key
management, implementation, or algorithms can lead to breaches.

You might also like