View
234
Download
4
Category
Tags:
Preview:
Citation preview
May 2003 Yangjun Chen 1
Distributed Databases: Review
Distributed Databases
System
Architecture
Distr ibu ted D
at ab aseD
esign
Sem
antic Data
Control
Distributed T
ransactionM
anagement
Distributed Q
ueryP
rocessing
May 2003 Yangjun Chen 2
Distributed Databases: Review
System Architecture
ANSI/SPARC Architecture
DBMS Implementation Alternatives
Datalogical Architecture
Clients/Server Architecture
Components of a Multi-DBMS
May 2003 Yangjun Chen 3
Distributed Databases: Review
May 2003 Yangjun Chen 4
Distributed Databases: Review
May 2003 Yangjun Chen 5
Distributed Databases: Review
May 2003 Yangjun Chen 6
Distributed Databases: Review
May 2003 Yangjun Chen 7
Distributed Databases: Review
May 2003 Yangjun Chen 8
Distributed Databases: Review
May 2003 Yangjun Chen 9
Distributed Databases: Review
May 2003 Yangjun Chen 10
Distributed Databases: Review
May 2003 Yangjun Chen 11
Distributed Databases: Review
May 2003 Yangjun Chen 12
Distributed Databases: Review
May 2003 Yangjun Chen 13
Distributed Databases: Review
Distributed DBMS Design
Relation Fragmentation
Horizontal, Vertical, Hybrid
Correctness of Fragmentation
Completeness, Reconstruction, Disjointness
AlgorithmsCOM_MIN Al. , Bond Energy Al.
Fragment Allocation
May 2003 Yangjun Chen 14
Distributed Databases: Review
May 2003 Yangjun Chen 15
Distributed Databases: Review
May 2003 Yangjun Chen 16
Distributed Databases: Review
May 2003 Yangjun Chen 17
Distributed Databases: Review
May 2003 Yangjun Chen 18
Distributed Databases: Review
May 2003 Yangjun Chen 19
Distributed Databases: Review
May 2003 Yangjun Chen 20
Distributed Databases: Review
Algorithms for horizontal fragmentation:
COM_MIN AlgorithmGiven a relation and a set of predicates, it will find acomplete and minimal set of predicates
Horizontal AlgorithmGiven a complete and minimal set of predicates, it willproduce a horizontal fragmentation
May 2003 Yangjun Chen 21
Distributed Databases: Review
May 2003 Yangjun Chen 22
Distributed Databases: Review
May 2003 Yangjun Chen 23
Distributed Databases: Review
May 2003 Yangjun Chen 24
Distributed Databases: Review
May 2003 Yangjun Chen 25
Distributed Databases: Review
May 2003 Yangjun Chen 26
Distributed Databases: Review
May 2003 Yangjun Chen 27
Distributed Databases: Review
May 2003 Yangjun Chen 28
Distributed Databases: Review
May 2003 Yangjun Chen 29
Distributed Databases: Review
May 2003 Yangjun Chen 30
Distributed Databases: Review
May 2003 Yangjun Chen 31
Distributed Databases: Review
May 2003 Yangjun Chen 32
Distributed Databases: Review
May 2003 Yangjun Chen 33
Distributed Databases: Review
May 2003 Yangjun Chen 34
Distributed Databases: Review
May 2003 Yangjun Chen 35
Distributed Databases: Review
Global affinity measure:
GAM = aff(Ai, Aj)*[aff(Ai, Aj-1) + aff(Ai, Aj+1) +
aff(Ai-1, Aj) + aff(Ai+1, Aj)]
Since the affinity matrix is symmetric, we have
GAM = 2 * aff(Ai, Aj)*[aff(Ai, Aj-1) + aff(Ai, Aj+1 )]
AM = aff(Ai, Aj)*[aff(Ai, Aj-1) + aff(Ai, Aj+1 )]
1i 1j
1i 1j
1i 1j
May 2003 Yangjun Chen 36
Distributed Databases: Review
Global affinity measure:
AM = aff(Ai, Aj)*[aff(Ai, Aj-1) + aff(Ai, Aj+1)]
= [aff(Ai, Aj)*aff(Ai, Aj-1) + aff(Ai, Aj)*aff(Ai, Aj+1)]
= [ aff(Ai, Aj)*aff(Ai, Aj-1) + aff(Ai, Aj)*aff(Ai, Aj+1)]
= [bond(Ai, Aj-1) + bond(Ai, Aj+1)],
Where bond(Ax, Ay) = aff(Az, Ax)*aff(Az, Ay).
ni 1
1i 1i
nj 1
nz 1
nj 1
nj 1
nj 1
ni 1
May 2003 Yangjun Chen 37
Distributed Databases: Review
Relation schema:
R[A1, …, Ai, …, Aj, …, Ak-1, Ak, …, An]
Affinity matrix:
A1, …, Ai, …, Aj, …, Ak-1, Ak, …, An
…… … …… … …… ……
Clustered affinity matrix:
Ai1, …, Ail, Ai , Aj, Ai(l+3), …, Ai(k-1) Ai1, …, Ail, Ai , Ak , Aj, Ai(l+3), …,
…… …… …… …… …… ……
oldold newnew
May 2003 Yangjun Chen 38
Distributed Databases: Review
AMAMoldold = = [bond(Ais, Ai(s-1)) + bond(Ais, Aj(s+1))] + bond(Ai, Ail) + bond(Ai, Aj) + bond(Aj, Ai) + bond(Aj, Ai(l+3)) + [bond(Ais, Ai(s-1)) + bond(Ais, Aj(s+1))]
AMAMnewnew = = [bond(Ais, Ai(s-1)) + bond(Ais, Aj(s+1))] + bond(Ai, Ail) + bond(Ai, Ak) + bond(Ak, Ai) + bond(Ak, Aj) + bond(Aj, Ak) + bond(Aj, Ai(l+3)) + [bond(Ais, Ai(s-1)) + bond(Ais, Aj(s+1))]
AMAMnewnew – AMAMold old = = 2* 2* bond(Ai, Ak) + 2* bond(Aj, Ak) – 2* bond(Ai, Aj)
ls 1
13
kls
ls 1
13
kls
May 2003 Yangjun Chen 39
Distributed Databases: Review
May 2003 Yangjun Chen 40
Distributed Databases: Review
May 2003 Yangjun Chen 41
Distributed Databases: Review
May 2003 Yangjun Chen 42
Distributed Databases: Review
May 2003 Yangjun Chen 43
Distributed Databases: Review
May 2003 Yangjun Chen 44
Distributed Databases: Review
May 2003 Yangjun Chen 45
Distributed Databases: Review
May 2003 Yangjun Chen 46
Distributed Databases: Review
May 2003 Yangjun Chen 47
Distributed Databases: Review
May 2003 Yangjun Chen 48
Distributed Databases: Review
May 2003 Yangjun Chen 49
Distributed Databases: Review
May 2003 Yangjun Chen 50
Distributed Databases: Review
May 2003 Yangjun Chen 51
Distributed Databases: Review
total cost
cost for query processing cost for storage
cost for data processing cost for transmission
cost fordata access
cost forintegritychecking
cost forconcurrencycontrol
update cost retrieval cost
May 2003 Yangjun Chen 52
Distributed Databases: Review
Semantic Data Control
View Management
Data Security
Semantic Integrity Control
Constraint Specification Language
Integrity Enforcement
May 2003 Yangjun Chen 53
Distributed Databases: Review
May 2003 Yangjun Chen 54
Distributed Databases: Review
May 2003 Yangjun Chen 55
Distributed Databases: Review
May 2003 Yangjun Chen 56
Distributed Databases: Review
May 2003 Yangjun Chen 57
Distributed Databases: Review
May 2003 Yangjun Chen 58
Distributed Databases: Review
May 2003 Yangjun Chen 59
Distributed Databases: Review
May 2003 Yangjun Chen 60
Distributed Databases: Review
May 2003 Yangjun Chen 61
Distributed Databases: Review
May 2003 Yangjun Chen 62
Distributed Databases: Review
Distributed Query Processing
Query Processing Methodology
- Query Decomposition
- Data Localization
- Global Optimization
- Local Optimization
May 2003 Yangjun Chen 63
Distributed Databases: Review
May 2003 Yangjun Chen 64
Distributed Databases: Review
May 2003 Yangjun Chen 65
Distributed Databases: Review
May 2003 Yangjun Chen 66
Distributed Databases: Review
May 2003 Yangjun Chen 67
Distributed Databases: Review
May 2003 Yangjun Chen 68
Distributed Databases: Review
May 2003 Yangjun Chen 69
Distributed Databases: Review
May 2003 Yangjun Chen 70
Distributed Databases: Review
May 2003 Yangjun Chen 71
Distributed Databases: Review
May 2003 Yangjun Chen 72
Distributed Databases: Review
May 2003 Yangjun Chen 73
Distributed Databases: Review
May 2003 Yangjun Chen 74
Distributed Databases: Review
May 2003 Yangjun Chen 75
Distributed Databases: Review
May 2003 Yangjun Chen 76
Distributed Databases: Review
May 2003 Yangjun Chen 77
Distributed Databases: Review
May 2003 Yangjun Chen 78
Distributed Databases: Review
R* Algorithm
SDD-1 Algorithm
May 2003 Yangjun Chen 79
Distributed Databases: Review
May 2003 Yangjun Chen 80
Distributed Databases: Review
May 2003 Yangjun Chen 81
Distributed Databases: Review
May 2003 Yangjun Chen 82
Distributed Databases: Review
May 2003 Yangjun Chen 83
Distributed Databases: Review
May 2003 Yangjun Chen 84
Distributed Databases: Review
May 2003 Yangjun Chen 85
Distributed Databases: Review
May 2003 Yangjun Chen 86
Distributed Databases: Review
May 2003 Yangjun Chen 87
Distributed Databases: Review
May 2003 Yangjun Chen 88
Distributed Databases: Review
May 2003 Yangjun Chen 89
Distributed Databases: Review
May 2003 Yangjun Chen 90
Distributed Databases: Review
May 2003 Yangjun Chen 91
Distributed Databases: Review
Distributed Transaction Management
Transaction Concepts and Models
Distributed Concurrency Control
Distributed 2PL
Timestamp Ordering
Optimistic Concurrency Control
Deadlock
May 2003 Yangjun Chen 92
Distributed Databases: Review
May 2003 Yangjun Chen 93
Distributed Databases: Review
May 2003 Yangjun Chen 94
Distributed Databases: Review
May 2003 Yangjun Chen 95
Distributed Databases: Review
May 2003 Yangjun Chen 96
Distributed Databases: Review
May 2003 Yangjun Chen 97
Distributed Databases: Review
May 2003 Yangjun Chen 98
Distributed Databases: Review
May 2003 Yangjun Chen 99
Distributed Databases: Review
May 2003 Yangjun Chen 100
Distributed Databases: Review
May 2003 Yangjun Chen 101
Distributed Databases: Review
May 2003 Yangjun Chen 102
Distributed Databases: Review
May 2003 Yangjun Chen 103
Distributed Databases: Review
Phenomena description
P1 dirty read (transaction can read data that is not committed)
P2 nonrepeatable read(transaction can read the same row twice, and it could be different)
P3 phantom
May 2003 Yangjun Chen 104
Distributed Databases: Review
Phenomena occurs?
P1 P2 P3
serializable no no no
repeatable read no no yes
read committed no yes yes
read uncommitted yes yes yes
May 2003 Yangjun Chen 105
Distributed Databases: Review
May 2003 Yangjun Chen 106
Distributed Databases: Review
May 2003 Yangjun Chen 107
Distributed Databases: Review
May 2003 Yangjun Chen 108
Distributed Databases: Review
May 2003 Yangjun Chen 109
Distributed Databases: Review
May 2003 Yangjun Chen 110
Distributed Databases: Review
May 2003 Yangjun Chen 111
Distributed Databases: Review
May 2003 Yangjun Chen 112
Distributed Databases: Review
May 2003 Yangjun Chen 113
Distributed Databases: Review
May 2003 Yangjun Chen 114
Distributed Databases: Review
May 2003 Yangjun Chen 115
Distributed Databases: Review
May 2003 Yangjun Chen 116
Distributed Databases: Review
May 2003 Yangjun Chen 117
Distributed Databases: Review
May 2003 Yangjun Chen 118
Distributed Databases: Review
May 2003 Yangjun Chen 119
Distributed Databases: Review
May 2003 Yangjun Chen 120
Distributed Databases: Review
May 2003 Yangjun Chen 121
Distributed Databases: Review
May 2003 Yangjun Chen 122
Distributed Databases: Review
May 2003 Yangjun Chen 123
Distributed Databases: Review
May 2003 Yangjun Chen 124
Distributed Databases: Review
May 2003 Yangjun Chen 125
Distributed Databases: Review
May 2003 Yangjun Chen 126
Distributed Databases: Review
Recommended