Distributed Databases-Database System Principles-Lecture Slides, Slides of Principles of Database Management

Prof. Gunjan Chauhan delivered this lecture at Alliance University for Principles of Database Management course. Its main points are: Database, System, Principles, Distributed, DBMS, Advantages, Modularity, Fault, Tolerance, Sharing, Data, Issues

Typology: Slides

2011/2012

Uploaded on 07/15/2012

saibal
saibal 🇮🇳

32 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
11/30/2011
1
CS 245 Notes 12 1
CS 245: Database System
Principles
Notes 12: Distributed Databases
Hector Garcia-Molina
CS 245 Notes 12 2
Distributed Databases
data
DBMS
data
DBMS
data
DBMS
data
DBMS
Distributed Database System
CS 245 Notes 12 3
Advantages of a DDBS
•Modularity
Fault Tolerance
High Performance
Data Sharing
Low Cost Components
CS 245 Notes 12 4
Issues
Data Distribution
Exploiting Parallelism
Concurrency and Recovery
Heterogeneity
CS 245 Notes 12 5
Parallelism: Pipelining
•Example:
–T
1SELECT *
FROM A WHERE cond
–T
2JOIN T1and B
AB
(with index)
select join
CS 245 Notes 12 6
Parallelism: Concurrent Operations
Example: SELECT * FROM A WHERE cond
Awhere
A.x < 10
select select
Awhere
10 A.x < 20
select
Awhere
20 A.x
merge data location is
important...
docsity.com
pf3

Partial preview of the text

Download Distributed Databases-Database System Principles-Lecture Slides and more Slides Principles of Database Management in PDF only on Docsity!

CS 245 Notes 12 1

CS 245: Database System

Principles

Notes 12: Distributed Databases

Hector Garcia-Molina

CS 245 Notes 12 2

Distributed Databases

data

DBMS

data

DBMS

data

DBMS

data

DBMS

Distributed Database System

CS 245 Notes 12 3

Advantages of a DDBS

  • Modularity
  • Fault Tolerance
  • High Performance
  • Data Sharing
  • Low Cost Components

CS 245 Notes 12 4

Issues

  • Data Distribution
  • Exploiting Parallelism
  • Concurrency and Recovery
  • Heterogeneity

CS 245 Notes 12 5

Parallelism: Pipelining

  • Example:
    • T 1  SELECT * FROM A WHERE cond
    • T 2  JOIN T 1 and B

A (^) (with index)B

select (^) join

CS 245 Notes 12 6

Parallelism: Concurrent Operations

  • Example: SELECT * FROM A WHERE cond

A where A.x < 10

select (^) select

A where 10  A.x < 20

select

A where 20  A.x

merge data location isimportant...

CS 245 Notes 12 7

Join Processing

  • Example: JOIN A, B over attribute X

A 1 A 2 B 1 B 2

A.x < 10 (^) A.x  10 B.x < 10 (^) B.x  10

join strategy

CS 245 Notes 12 8

Join Processing

  • Example: JOIN A, B over attribute X

A 1 A 2 B 1 B 2

A.z < 10 (^) A.z  10 B.z < 10 (^) B.z  10

join strategy

CS 245 Notes 12 9

Concurrency & Recovery

  • Two Phase Commit

ATM

Bank Mainframe

CS 245 Notes 12 10

2PC: ATM Withdrawl

  • Mainframe is coordinator
  • Phase 1: ATM checks if money available; mainframe checks if account has funds (money and funds are “reserved”)
  • Phase 2: ATM releases funds; mainframe debits account

CS 245 Notes 12 11

Replicated Data Mangement

  • Key to fault-tolerance, durability
  • Illustrates transaction processing issues
  • Various concurrency control/recovery algorithms available

CS 245 Notes 12 12

Primary Copy Algorithm

  • Updates run at primary site
  • Backups repeat writes; backups allow “out-of-date” reads Primary Site A 3 B 8 C 4 D 25

Backup Site 1 A 3 B 8 C 4 D 25

Backup Site 2 A 3 B 8 C 4 D 25

5 6

9 7 T1: A:5; C: T2: B:9; C: 7 propagate in order

5 6

9 7

5 6