Scribd
Upload
6 views17 pages

S Harding

Uploaded by

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

S Harding

Uploaded by

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

SHARDING AND H BASE

SHARDING
Shard means “a small part of a whole”. Hence sharding means dividing
larger part into smaller parts.
In DBMS, Sharding is a type of DataBase Partitioning in which a large
databse is divided or partitioned into smaller data also known as Shards.
These shards are not only smaller but also faster and easily manageable.
3

SHARDING
Sharding is a method for distributing a single dataset across
multiple databases, which can then be stored on multiple machines.
This allows for larger datasets to be split in smaller chunks and
stored in multiple data nodes, increasing the total storage capacity
of the system.
TYPES OF SCALING 4

• VERTICAL SCALING
• HORIZONTAL SCALING
VERTICAL SCALING

» When new resources are added in the existing system to meet the
expectation, it is known as vertical scaling.
» Vertical scaling is based on the idea of adding more power(CPU,
RAM) to existing systems, basically adding more resources.
» Vertical scaling is not only easy but also cheaper than Horizontal
Scaling. It also requires less time to be fixed.
HORIZONTAL SCALING

» When new server racks are added in the existing system to meet the
higher expectation, it is known as horizontal scaling.
» Horizontal scaling is based on the idea of adding more machines into
our pool of resources.
» Horizontal scaling is difficult and also costlier than Vertical Scaling. It
also requires more time to be fixed.
NEED FOR SHARDING 8

Consider a very large database whose sharding has not been done. For example, let’s take a
DataBase of a college in which all the student’s record (present and past) in the whole college
are maintained in a single database. So, it would contain very very large number of data, say
100, 000 records.

Now when we need to find a student from this Database, each time around 100, 000
transactions has to be done to find the student, which is very very costly.

Now consider the same college students records, divided into smaller data shards based on
years. Now each data shard will have around 1000-5000 students records only. So not only
the database became much more manageable, but also the transaction cost of each time also
reduces by a huge factor, which is achieved by Sharding.
FEATURE OF SHARDING 9

• Sharding makes the Database smaller


• Sharding makes the Database faster
• Sharding makes the Database much more easily
manageable
• Sharding can be a complex operation sometimes
• Sharding reduces the transaction cost of the Database
10
11

H BASE
H BASE 12

» HBase is a distributed column-oriented database built on top of the


Hadoop file system. It is an open-source project and is horizontally
scalable.
» HBase is a data model that is similar to Google’s big table designed to
provide quick random access to huge amounts of structured data. It
leverages the fault tolerance provided by the Hadoop File System
(HDFS).
» It is a part of the Hadoop ecosystem that provides random real-time
read/write access to data in the Hadoop File System.
13
STORAGE MECHANISM IN HBASE 14

• Table is a collection of rows.


• Row is a collection of column families.
• Column family is a collection of columns.
• Column is a collection of key value pairs.
15
FEATURE OF HBASE 16

• HBase is linearly scalable.


• It has automatic failure support.
• It provides consistent read and writes.
• It integrates with Hadoop, both as a source and a destination.
• It has easy java API for client.
• It provides data replication across clusters.
17

“
THANK YOU!!!

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy