Scribd
Upload
3 views4 pages

Ass 3

The document explains the logical view of data, emphasizing its organization and relationships rather than physical storage. It details the relational database model, types of keys, integrity rules, and components of the relational model, along with relational set operators. Additionally, it discusses the data dictionary, system catalog, relationships in databases, and the importance of minimizing data redundancy through normalization.

Uploaded by

saktyurdmursan
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 views4 pages

Ass 3

The document explains the logical view of data, emphasizing its organization and relationships rather than physical storage. It details the relational database model, types of keys, integrity rules, and components of the relational model, along with relational set operators. Additionally, it discusses the data dictionary, system catalog, relationships in databases, and the importance of minimizing data redundancy through normalization.

Uploaded by

saktyurdmursan
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/ 4

Justine D.

Ligon
2B-BSIT

1. What is Logical View of Data?

The logical view of data refers to how data is perceived by users rather than how it is physically
stored. It focuses on the organization and relationships of data in a structured manner without
concern for physical storage or access methods.

2. Relational Database Model Offering Logical View of Data

The Relational Database Model provides a logical view of data by organizing it into tables
(relations) with rows (tuples) and columns (attributes). It enables users to interact with data using
Structured Query Language (SQL) while abstracting physical storage details. The relational
model supports:

 Data integrity through constraints


 Data manipulation via relational algebra and SQL
 Logical independence, allowing changes in the physical schema
without affecting user applications

3. What is a Key?

A key is an attribute or a set of attributes used to uniquely identify records (tuples) in a table
(relation). Keys enforce uniqueness and help in establishing relationships between tables.

4. Different Types of Keys

 Primary Key: A unique identifier for a record in a table (e.g.,


Student_ID in a Student table).
 Foreign Key: An attribute that refers to the primary key in another
table, establishing relationships.
 Candidate Key: A set of attributes that could be chosen as the
primary key.
 Super Key: A set of attributes that uniquely identifies a row but may
include extra attributes beyond the minimum requirement.
 Composite Key: A key consisting of multiple attributes used to
uniquely identify a record.
 Alternate Key: A candidate key that is not chosen as the primary key.
 Surrogate Key: A system-generated key, often used when no natural
primary key exists.

5. What are Integrity Rules?

Integrity rules ensure accuracy, consistency, and validity of data in a database. The two
primary integrity rules are:

 Entity Integrity: Every table must have a primary key, and it cannot
contain NULL values.
 Referential Integrity: A foreign key in one table must match an
existing primary key in another table, or be NULL.

6. Basic Components of the Relational Model

 Relation (Table): The fundamental structure storing data.


 Tuple (Row): A single record in a table.
 Attribute (Column): A characteristic or property of an entity.
 Domain: The set of possible values for an attribute.
 Primary Key: A unique identifier for a tuple.
 Foreign Key: A reference to a primary key in another table.

7. Relational Set Operators

 SELECT (σ): Extracts rows based on conditions.


 PROJECT (π): Extracts specific columns from a table.
 UNION (∪): Combines records from two tables, removing duplicates.
 INTERSECT (∩): Returns common records between two tables.
 DIFFERENCE (-): Retrieves records present in one table but not in
another.
 JOIN (⨝): Merges two tables based on a related column.
 CARTESIAN PRODUCT (×): Returns all possible combinations of
tuples from two tables.
8. The Data Dictionary and the System Catalog

 Data Dictionary: A collection of metadata that describes database


objects, including tables, columns, data types, constraints, and
relationships.
 System Catalog: A database-managed structure storing schema
information, including table structures, indexes, views, and constraints.

9. Difference Between Data Dictionary and System Catalog

 Data Dictionary: Stores definitions and metadata about database


structures, constraints, and relationships. It is often managed manually
or by a database administrator.
 System Catalog: A database-driven repository containing the actual
system-level metadata used by the database management system
(DBMS) to enforce constraints and optimize queries.

10. Relationship in the Relational Database

 One-to-One (1:1): Each record in Table A is related to one record in


Table B.
 One-to-Many (1:M): A record in Table A can be associated with
multiple records in Table B (e.g., a customer with multiple orders).
 Many-to-Many (M:N): Multiple records in Table A relate to multiple
records in Table B, typically resolved using a junction table.

11. Data Redundancy Revisited

Data redundancy refers to storing duplicate data across multiple locations or tables, leading
to:

 Increased storage costs


 Data inconsistency issues
 Complications in updating or deleting records
12. Data Redundancy in the Relational Data Model

In the relational model, data redundancy is minimized using normalization, which:

 Organizes data into multiple related tables


 Eliminates duplicate data
 Uses foreign keys to establish relationships between tables
 Improves data integrity and efficiency

You might also like