Download presentation
Presentation is loading. Please wait.
1
Distributed Databases: Review May 2003Yangjun Chen1 Distributed Databases System Architecture Distributed Database Design Semantic Data Control Distributed Transaction Management Distributed Query Processing
2
Distributed Databases: Review May 2003Yangjun Chen2 System Architecture ANSI/SPARC Architecture DBMS Implementation Alternatives Datalogical Architecture Clients/Server Architecture Components of a Multi-DBMS
3
Distributed Databases: Review May 2003Yangjun Chen3
4
Distributed Databases: Review May 2003Yangjun Chen4
5
Distributed Databases: Review May 2003Yangjun Chen5
6
Distributed Databases: Review May 2003Yangjun Chen6
7
Distributed Databases: Review May 2003Yangjun Chen7
8
Distributed Databases: Review May 2003Yangjun Chen8
9
Distributed Databases: Review May 2003Yangjun Chen9
10
Distributed Databases: Review May 2003Yangjun Chen10
11
Distributed Databases: Review May 2003Yangjun Chen11
12
Distributed Databases: Review May 2003Yangjun Chen12
13
Distributed Databases: Review May 2003Yangjun Chen13 Distributed DBMS Design Relation Fragmentation Horizontal, Vertical, Hybrid Correctness of Fragmentation Completeness, Reconstruction, Disjointness Algorithms COM_MIN Al., Bond Energy Al. Fragment Allocation
14
Distributed Databases: Review May 2003Yangjun Chen14
15
Distributed Databases: Review May 2003Yangjun Chen15
16
Distributed Databases: Review May 2003Yangjun Chen16
17
Distributed Databases: Review May 2003Yangjun Chen17
18
Distributed Databases: Review May 2003Yangjun Chen18
19
Distributed Databases: Review May 2003Yangjun Chen19
20
Distributed Databases: Review May 2003Yangjun Chen20 Algorithms for horizontal fragmentation: COM_MIN Algorithm Given a relation and a set of predicates, it will find a complete and minimal set of predicates Horizontal Algorithm Given a complete and minimal set of predicates, it will produce a horizontal fragmentation
21
Distributed Databases: Review May 2003Yangjun Chen21
22
Distributed Databases: Review May 2003Yangjun Chen22
23
Distributed Databases: Review May 2003Yangjun Chen23
24
Distributed Databases: Review May 2003Yangjun Chen24
25
Distributed Databases: Review May 2003Yangjun Chen25
26
Distributed Databases: Review May 2003Yangjun Chen26
27
Distributed Databases: Review May 2003Yangjun Chen27
28
Distributed Databases: Review May 2003Yangjun Chen28
29
Distributed Databases: Review May 2003Yangjun Chen29
30
Distributed Databases: Review May 2003Yangjun Chen30
31
Distributed Databases: Review May 2003Yangjun Chen31
32
Distributed Databases: Review May 2003Yangjun Chen32
33
Distributed Databases: Review May 2003Yangjun Chen33
34
Distributed Databases: Review May 2003Yangjun Chen34
35
Distributed Databases: Review May 2003Yangjun Chen35 Global affinity measure: GAM = aff(A i, A j )*[aff(A i, A j-1 ) + aff(A i, A j+1 ) + aff(A i-1, A j ) + aff(A i+1, A j )] Since the affinity matrix is symmetric, we have GAM = 2 *aff(A i, A j )*[aff(A i, A j-1 ) + aff(A i, A j+1 )] AM = aff(A i, A j )*[aff(A i, A j-1 ) + aff(A i, A j+1 )]
36
Distributed Databases: Review May 2003Yangjun Chen36 Global affinity measure: AM = aff(A i, A j )*[aff(A i, A j-1 ) + aff(A i, A j+1 )] = [aff(A i, A j )*aff(A i, A j-1 ) + aff(A i, A j )*aff(A i, A j+1 )] = [bond(A i, A j-1 ) + bond(A i, A j+1 )], Where bond(A x, A y ) = aff(A z, A x )*aff(A z, A y ).
37
Distributed Databases: Review May 2003Yangjun Chen37 Relation schema: R[A 1, …, A i, …, A j, …, A k-1, A k, …, A n ] Affinity matrix: A 1, …, A i, …, A j, …, A k-1, A k, …, A n … … … … … Clustered affinity matrix: A i1, …, A il, A i, A j, A i(l+3), …, A i(k-1) A i1, …, A il, A i, A k, A j, A i(l+3), …, … ……… …… old new
38
Distributed Databases: Review May 2003Yangjun Chen38 AM old = AM old = [bond(A is, A i(s-1) ) + bond(A is, A j(s+1) )] + bond(A i, A il ) + bond(A i, A j ) + bond(A j, A i ) + bond(A j, A i(l+3) ) + [bond(A is, A i(s-1) ) + bond(A is, A j(s+1) )] AM new = AM new = [bond(A is, A i(s-1) ) + bond(A is, A j(s+1) )] + bond(A i, A il ) + bond(A i, A k ) + bond(A k, A i ) + bond(A k, A j ) + bond(A j, A k ) + bond(A j, A i(l+3) ) + [bond(A is, A i(s-1) ) + bond(A is, A j(s+1) )] AM new AM old = 2* AM new – AM old = 2* bond(A i, A k ) + 2* bond(A j, A k ) – 2* bond(A i, A j )
39
Distributed Databases: Review May 2003Yangjun Chen39
40
Distributed Databases: Review May 2003Yangjun Chen40
41
Distributed Databases: Review May 2003Yangjun Chen41
42
Distributed Databases: Review May 2003Yangjun Chen42
43
Distributed Databases: Review May 2003Yangjun Chen43
44
Distributed Databases: Review May 2003Yangjun Chen44
45
Distributed Databases: Review May 2003Yangjun Chen45
46
Distributed Databases: Review May 2003Yangjun Chen46
47
Distributed Databases: Review May 2003Yangjun Chen47
48
Distributed Databases: Review May 2003Yangjun Chen48
49
Distributed Databases: Review May 2003Yangjun Chen49
50
Distributed Databases: Review May 2003Yangjun Chen50
51
Distributed Databases: Review May 2003Yangjun Chen51 total cost cost for query processing cost for storage cost for data processing cost for transmission cost for data access cost for integrity checking cost for concurrency control update cost retrieval cost
52
Distributed Databases: Review May 2003Yangjun Chen52 Semantic Data Control View Management Data Security Semantic Integrity Control Constraint Specification Language Integrity Enforcement
53
Distributed Databases: Review May 2003Yangjun Chen53
54
Distributed Databases: Review May 2003Yangjun Chen54
55
Distributed Databases: Review May 2003Yangjun Chen55
56
Distributed Databases: Review May 2003Yangjun Chen56
57
Distributed Databases: Review May 2003Yangjun Chen57
58
Distributed Databases: Review May 2003Yangjun Chen58
59
Distributed Databases: Review May 2003Yangjun Chen59
60
Distributed Databases: Review May 2003Yangjun Chen60
61
Distributed Databases: Review May 2003Yangjun Chen61
62
Distributed Databases: Review May 2003Yangjun Chen62 Distributed Query Processing Query Processing Methodology -Query Decomposition -Data Localization -Global Optimization -Local Optimization
63
Distributed Databases: Review May 2003Yangjun Chen63
64
Distributed Databases: Review May 2003Yangjun Chen64
65
Distributed Databases: Review May 2003Yangjun Chen65
66
Distributed Databases: Review May 2003Yangjun Chen66
67
Distributed Databases: Review May 2003Yangjun Chen67
68
Distributed Databases: Review May 2003Yangjun Chen68
69
Distributed Databases: Review May 2003Yangjun Chen69
70
Distributed Databases: Review May 2003Yangjun Chen70
71
Distributed Databases: Review May 2003Yangjun Chen71
72
Distributed Databases: Review May 2003Yangjun Chen72
73
Distributed Databases: Review May 2003Yangjun Chen73
74
Distributed Databases: Review May 2003Yangjun Chen74
75
Distributed Databases: Review May 2003Yangjun Chen75
76
Distributed Databases: Review May 2003Yangjun Chen76
77
Distributed Databases: Review May 2003Yangjun Chen77
78
Distributed Databases: Review May 2003Yangjun Chen78 R* Algorithm SDD-1 Algorithm
79
Distributed Databases: Review May 2003Yangjun Chen79
80
Distributed Databases: Review May 2003Yangjun Chen80
81
Distributed Databases: Review May 2003Yangjun Chen81
82
Distributed Databases: Review May 2003Yangjun Chen82
83
Distributed Databases: Review May 2003Yangjun Chen83
84
Distributed Databases: Review May 2003Yangjun Chen84
85
Distributed Databases: Review May 2003Yangjun Chen85
86
Distributed Databases: Review May 2003Yangjun Chen86
87
Distributed Databases: Review May 2003Yangjun Chen87
88
Distributed Databases: Review May 2003Yangjun Chen88
89
Distributed Databases: Review May 2003Yangjun Chen89
90
Distributed Databases: Review May 2003Yangjun Chen90
91
Distributed Databases: Review May 2003Yangjun Chen91 Distributed Transaction Management Transaction Concepts and Models Distributed Concurrency Control Distributed 2PL Timestamp Ordering Optimistic Concurrency Control Deadlock
92
Distributed Databases: Review May 2003Yangjun Chen92
93
Distributed Databases: Review May 2003Yangjun Chen93
94
Distributed Databases: Review May 2003Yangjun Chen94
95
Distributed Databases: Review May 2003Yangjun Chen95
96
Distributed Databases: Review May 2003Yangjun Chen96
97
Distributed Databases: Review May 2003Yangjun Chen97
98
Distributed Databases: Review May 2003Yangjun Chen98
99
Distributed Databases: Review May 2003Yangjun Chen99
100
Distributed Databases: Review May 2003Yangjun Chen100
101
Distributed Databases: Review May 2003Yangjun Chen101
102
Distributed Databases: Review May 2003Yangjun Chen102
103
Distributed Databases: Review May 2003Yangjun Chen103 Phenomenadescription P1 dirty read (transaction can read data that is not committed) P2nonrepeatable read (transaction can read the same row twice, and it could be different) P3phantom
104
Distributed Databases: Review May 2003Yangjun Chen104 Phenomena occurs? P1P2P3 serializablenonono repeatable readnonoyes read committednoyesyes read uncommittedyes yesyes
105
Distributed Databases: Review May 2003Yangjun Chen105
106
Distributed Databases: Review May 2003Yangjun Chen106
107
Distributed Databases: Review May 2003Yangjun Chen107
108
Distributed Databases: Review May 2003Yangjun Chen108
109
Distributed Databases: Review May 2003Yangjun Chen109
110
Distributed Databases: Review May 2003Yangjun Chen110
111
Distributed Databases: Review May 2003Yangjun Chen111
112
Distributed Databases: Review May 2003Yangjun Chen112
113
Distributed Databases: Review May 2003Yangjun Chen113
114
Distributed Databases: Review May 2003Yangjun Chen114
115
Distributed Databases: Review May 2003Yangjun Chen115
116
Distributed Databases: Review May 2003Yangjun Chen116
117
Distributed Databases: Review May 2003Yangjun Chen117
118
Distributed Databases: Review May 2003Yangjun Chen118
119
Distributed Databases: Review May 2003Yangjun Chen119
120
Distributed Databases: Review May 2003Yangjun Chen120
121
Distributed Databases: Review May 2003Yangjun Chen121
122
Distributed Databases: Review May 2003Yangjun Chen122
123
Distributed Databases: Review May 2003Yangjun Chen123
124
Distributed Databases: Review May 2003Yangjun Chen124
125
Distributed Databases: Review May 2003Yangjun Chen125
126
Distributed Databases: Review May 2003Yangjun Chen126
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.