Week1 Lecture2modified
Week1 Lecture2modified
Introduction
Distributed DBMS
Background
Distributed DBMS Architecture
Distributed Database Design (Briefly)
Distributed Query Processing (Briefly)
Distributed Transaction Management (Extensive)
Building Distributed Database Systems (RAID)
Mobile Database Systems
Privacy, Trust, and Authentication
Peer to Peer Systems
Page 1.1
File Systems
program 1
data description 1
File 1
program 2
data description 2
program 3
data description 3
Distributed DBMS
File 2
File 3
Page 1.2
Database Management
Application
program 1
(with data
semantics)
Application
program 2
(with data
semantics)
DBMS
description
manipulation
control
database
Application
program 3
(with data
semantics)
Distributed DBMS
Page 1.3
Computer
Networks
integration
distribution
Distributed
Database
Systems
integration
Distributed DBMS
Page 1.4
Distributed Computing
Distributed DBMS
Page 1.5
Distributed Computing
Synonymous terms
multiprocessors/multicomputers
satellite processing
backend processing
Distributed DBMS
Page 1.6
Satellite processing
Distributed DBMS
Page 1.7
Time-shared processing
Time-sharing is the sharing of a computing resource among many users by means of multiprogramming
and multi-tasking. By allowing a large number of users to interact concurrently with a single computer,
time-sharing dramatically lowered the cost of providing computing capability, made it possible for
individuals and organizations to use a computer without owning one, and promoted the interactive use of
computers and the development of new interactive applications. Time-sharing was developed out of the
realization that while any single user was inefficient, a large group of users together were not. This was
due to the pattern of interaction; in most cases users entered bursts of information followed by long
pause, but a group of users working at the same time would mean that the pauses of one user would be
used up by the activity of the others. Given an optimal group size, the overall process could be very
efficient. Similarly, small slices of time spent waiting for disk, tape, or network input could be granted to
other users.
Distributed DBMS
Page 1.8
What is distributed
Distributed DBMS
Processing logic
Functions
Data
Control
Page 1.9
Page 1.10
Distributed DBMS
Page 1.11
Site 4
Distributed DBMS
Site 3
Page 1.12
Site 4
Distributed DBMS
Site 3
Page 1.13
Implicit Assumptions
Distributed DBMS
Page 1.14
Shared-Memory Architecture
P1
Pn
M
D
Page 1.15
Shared-Nothing Architecture
P1
M1
D1
Pn
Mn
Dn
Page 1.16
Applications
Distributed DBMS
Page 1.17
Distributed DBMS
Page 1.18
Transparency
Distributed DBMS
Page 1.19
Example
ASG
EMP
ENO
ENAME
TITLE
E1
E2
E3
E4
E5
E6
E7
E8
J. Doe
M. Smith
A. Lee
J. Miller
B. Casey
L. Chu
R. Davis
J. Jones
Elect. Eng.
Syst. Anal.
Mech. Eng.
Programmer
Syst. Anal.
Elect. Eng.
Mech. Eng.
Syst. Anal.
ENO PNO
PROJ
Distributed DBMS
E1
E2
E2
E3
E3
E4
E5
E6
E7
E7
E8
P1
P1
P2
P3
P4
P2
P2
P4
P3
P5
P3
RESP
Manager
Analyst
Analyst
Consultant
Engineer
Programmer
Manager
Manager
Engineer
Engineer
Manager
DUR
12
24
6
10
48
18
24
48
36
23
40
PAY
PNO
PNAME
BUDGET
TITLE
SAL
P1
P2
P3
P4
Instrumentation
Database Develop.
CAD/CAM
Maintenance
150000
135000
250000
310000
Elect. Eng.
Syst. Anal.
Mech. Eng.
Programmer
40000
34000
27000
24000
Page 1.20
Transparent Access
SELECT
FROM
WHERE
AND
AND
ENAME,SAL
EMP,ASG,PAY
DUR > 12
EMP.ENO = ASG.ENO
PAY.TITLE = EMP.TITLE
Tokyo
Paris
Boston
Communication
Network
Boston projects
Boston employees
Boston assignments
New
York
Boston projects
New York employees
New York projects
New York assignments
Distributed DBMS
Paris projects
Paris employees
Paris assignments
Boston employees
Montreal
Montreal projects
Paris projects
New York projects
with budget > 200000
Montreal employees
Montreal assignments
Page 1.21