Scribd
Upload
17 views3 pages

3 RD Unit Partioning

hkh

Uploaded by

sobiyaparasuraman
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
17 views3 pages

3 RD Unit Partioning

hkh

Uploaded by

sobiyaparasuraman
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.

Vertical Partitioning

Vertical partitioning involves dividing a database table into smaller tables based on columns.
Each partition contains a subset of the columns of the original table, which can optimize
performance and storage. For example, if you have a user table with many columns, you
could create separate tables for user contact information, preferences, and activities. This can
improve query performance, especially if certain columns are accessed more frequently than
others.

2. Normalization

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


improve data integrity. The main goals of normalization are to eliminate duplicate data,
ensure data dependencies are logical, and simplify the database structure. This is achieved
through a series of normal forms (NF), such as:

 First Normal Form (1NF): Ensures that each column contains atomic values, and
each record is unique.
 Second Normal Form (2NF): Builds on 1NF by ensuring that all non-key attributes
are fully functionally dependent on the primary key.
 Third Normal Form (3NF): Further refines the structure by removing transitive
dependencies, ensuring that non-key attributes are not dependent on other non-key
attributes.

3. Row Splitting

Row splitting is a technique used to break down large rows in a database table into smaller,
more manageable pieces. This is particularly useful when dealing with large blobs of data
(e.g., images or large text fields) that can be stored separately, reducing the size of the main
table and improving performance. It can also help with loading and processing times for large
datasets.

4. Horizontal Partitioning

Horizontal partitioning involves dividing a table into smaller tables based on rows. Each
partition holds a subset of the rows from the original table, often based on a specific criteria
(e.g., range of values in a column). For example, you might partition a sales table by year,
with each partition containing data for a specific year. This can improve query performance
by allowing the database to scan only relevant partitions, making it faster to retrieve data.

Summary

These partitioning and normalization strategies are vital for managing large datasets,
optimizing performance, and ensuring data integrity in relational databases. By using vertical
and horizontal partitioning along with normalization techniques, databases can be structured
in a way that maximizes efficiency and minimizes redundancy.
A partitioning strategy in database management refers to the method used to divide a large
database table into smaller, more manageable pieces. This can improve performance,
manageability, and scalability. Here are some common partitioning strategies:

1. Vertical Partitioning

 Definition: Divides a table into smaller tables by columns.


 Use Case: Useful when certain columns are accessed more frequently than others,
allowing for optimized query performance.
 Example: Separating a user table into separate tables for user profile, preferences, and
activity logs.

2. Horizontal Partitioning

 Definition: Divides a table into smaller tables by rows.


 Use Case: Effective for managing large datasets where specific criteria can segment
data, such as date ranges or geographic regions.
 Example: A sales table partitioned by year, where each partition contains sales
records for a specific year.

3. Range Partitioning

 Definition: A subtype of horizontal partitioning that divides data based on specified


ranges of values.
 Use Case: Suitable for datasets where records can be logically grouped by ranges,
such as dates.
 Example: Partitioning a table by date, with each partition containing records for a
specific month.

4. List Partitioning

 Definition: Divides data into partitions based on a predefined list of values.


 Use Case: Useful when certain rows can be distinctly categorized by specific values.
 Example: A product table partitioned by categories like electronics, clothing, and
groceries.

5. Hash Partitioning

 Definition: Distributes rows across partitions based on a hash function applied to a


specific column.
 Use Case: Effective for evenly distributing data across partitions, reducing hotspots in
data access.
 Example: A customer table partitioned based on the hash value of the customer ID.

6. Composite Partitioning

 Definition: Combines multiple partitioning methods, such as horizontal and vertical


partitioning.
 Use Case: Useful for complex datasets that benefit from multi-level organization.
 Example: A sales table that is horizontally partitioned by year and vertically
partitioned by region.

Benefits of Partitioning

 Improved Performance: Queries can be executed faster by targeting specific


partitions rather than scanning entire tables.
 Enhanced Manageability: Smaller partitions are easier to maintain, back up, and
restore.
 Scalability: Allows for more manageable growth of data by adding new partitions as
needed.
 Better Resource Utilization: Reduces contention and improves concurrency by
allowing different partitions to be accessed simultaneously.

Conclusion

Choosing the right partitioning strategy depends on the specific use case, access patterns, and
data characteristics. By implementing an appropriate partitioning strategy, you can
significantly enhance the performance and manageability of a database system.

4o mini

You might also like