copy of parallel database systems

T

echn

ical S

emin

ar P

rese

ntat

ion

AMRITA MISHRA CS200198086 1

Parallel Database Systems

PARALLEL DATABASE PARALLEL DATABASE SYSTEMSSYSTEMS

Under the guidance of :

Mr. Anisur Rahman

T

echn

ical S

emin

ar P

rese

ntat

ion



INTRODUCTIONA parallel database system (PDBS) is a DBMS implemented on a parallel computer which is made of a number of nodes (processors and memories) connected by a fast network within a cabinet.

It strives to exploit modern multiprocessor architectures using software-oriented solutions for data management.

T

echn

ical S

emin

ar P

rese

ntat

ion



OBJECTIVEProblems of conventional DBMS

- high disk access time.

- very large databases cant be supportedwithin a single system.

PDBS is the only viable solution for increasing the I/O bandwidth through parallelism & for storing huge databases in a single system.

T

echn

ical S

emin

ar P

rese

ntat

ion



ADVANTAGES OF PDBS High Performance – Increased throughput

(inter-query parallelism) & decreased response time (intra-query parallelism).

High Availability – Using data replication.

Extensibility – Linear scaleup and Linear speedup.

T

echn

ical S

emin

ar P

rese

ntat

ion



PARALLEL DBMS ARCHITECTURE

Shared Memory Advantages – Simplicity, Load Balancing. Problems – Cost, Limited Extensibility, Low

Availability.

T

echn

ical S

emin

ar P

rese

ntat

ion



Shared Disk Advantages – Cost, Extensibility, Load Balancing,

Availability.Problems – Higher Complexity, Potential Coherence

Problems.

T

echn

ical S

emin

ar P

rese

ntat

ion



Shared NothingAdvantages – Cost, Extensibility, Availability.Problems – Complex, Addition of new nodes requires

reorganizing the database.

T

echn

ical S

emin

ar P

rese

ntat

ion



PARALLEL DBMS TECHNIQUESDATA ALLOCATION – Methods that spread the database across the system’s disks to ensure efficient parallel I/O. Partitioning (Fragmentation) – 3 strategies # Round Robin – i th tuple to partition (i mod n)

for n partitions. # Hashing – Apply hash function to some attribute to give partition no. # Range Partitioning – Distribute tuples based

on value(ranges) of some attribute.

T

echn

ical S

emin

ar P

rese

ntat

ion



elUSES OF DATA FRAGMENTATION Maximize system performance.

Minimize response time (through intra-queryparallelism).

Maximize throughput (through inter-queryparallelism).

Problems: Skewed data distributions lead tonon-uniform partitioning & hurt load balancing.

T

echn

ical S

emin

ar P

rese

ntat

ion



QUERY PARALLELISM Inter query parallelism – parallel execution of multiple queries generated by concurrent transactions.

Intra query parallelism – Two kinds:#Inter-operator – Executing several operators of

the query tree on several processors in parallel.#Intra-operator – Same operator is executed by

many processors, each one working on a subset of the data.

T

echn

ical S

emin

ar P

rese

ntat

ion



PARALLEL ALGORITHMS

T

echn

ical S

emin

ar P

rese

ntat

ion



T

echn

ical S

emin

ar P

rese

ntat

ion



PARALLEL JOIN EXAMPLE

Insert into C Select * from A , B where A.x = B.y ;

T

echn

ical S

emin

ar P

rese

ntat

ion



T

echn

ical S

emin

ar P

rese

ntat

ion



CONCLUSIONThe availability of fast microprocessors &

small inexpensive disks is an ideal platform for parallel database systems.

Employing data partitioning, intra-operator parallelism etc., converting an existing DBMS into a highly parallel one is relatively straightforward.

Tech

nica

l Sem

inar

Pre

sent

atio

nat

iona

l Ins

titut

e of

Scie

nce

& Te

chno

logy

AMRITA MISHRA CS200198086


17

THANK YOU!!!

copy of parallel database systems

Documents