본문 바로가기 주메뉴 바로가기
국회도서관 홈으로 정보검색 소장정보 검색

목차보기

title page

Abstract

Contents

1. Introduction 13

1.1. Background and purpose of research 13

1.2. Organization and content of thesis 17

2. Related works 19

2.1. Distributed database system 19

2.2. Research works regarding database allocation 23

2.3. Classification of research area in design of distributed database systems 29

3. Design of distributed database systems 32

3.1. Conceptual modeling of distributed database 32

3.2. Database fragmentation design 35

3.3. The allocation of fragments 39

4. Distributed database allocation model 41

4.1. Definition of cost components 41

4.2. Allocation cost model 47

4.3. Total incoming network traffic in each site for load balancing 55

5. Heuristic algorithms for minimizing allocation cost 60

5.1. Minimizing database management cost : algorithm-MDMC 61

5.2. Minimizing network facility resources cost : algorithm-MNRC 70

5.3. Integrating algorithm-MDMC and algorithm-MNRC 76

5.4. Total incoming network traffic in each site for load balancing : algorithm-TINT 80

6. Allocation experimental results 84

6.1. Allocation case study 85

6.2. Experiments for allocation 102

7. Conclusion 106

References 108

[Appendix] experimental results of the database allocation program applying the proposed algorithms 115

감사의 글

List of Table

Table 2-1. Problem Classification in distributed database systems 30

Table 3-1. Application requirements for distributed database allocation 40

Table 4-1. Cost components for database management at sites 47

Table 4-2. Cost components for network facility resources at sites 51

Table 4-3. Total incoming network traffics at allocated sites 56

Table 5-1. Cost components when a fragment is allocated at jth site 63

Table 5-2. Network traffic change whenever a fragment is allocated in each site one by one 72

Table 6-1. Matrix for fragments processed by transactions 86

Table 6-2. Matrix for transactions occurring in sites 86

Table 6-3. Matrix for fragments processed in sites 87

Table 6-4. Initial allocation cost and allocation order sorted by the cost 88

Table 6-5. Management cost when allocating fragment in each site by allocation order 89

Table 6-6. Network facility resources cost when allocating fragment by allocation order 92

Table 6-7. Total cost and near optimal allocation considering management/network cost 92

Table 6-8. Allocation results with our proposed algorithms and optimal results with actual cases 97

Table 6-9. Incoming network traffic matrix for load balancing 99

Table 6-10. Adjusted incoming network traffic matrix for load balancing 101

Table 6-11. Experiments for total allocation cost using the proposed algorithms : O(mn²) 104

Table 6-12. Experiments for total allocation cost of all cases in real world:(2n-1)m(이미지참조) 105

List of Figure

Figure 2-1. Physically distributed database on a network 20

Figure 3-1. A reference model for distributed database schemas 33

Figure 3-2. Horizontal fragmentation 36

Figure 3-3. Vertical fragmentation 38

Figure 6-1. Database management cost by allocation order 94

Figure 6-2. Network facility resources cost by allocation order 95

Figure 6-3. Total allocation cost by allocation order 96

Figure A-1. The proposed database allocation program 115

Figure A-2. Create matrices with fragments and transaction 116

Figure A-3. Create matrices with transaction and sites 117

Figure A-4. Create matrices with fragments and sites 118

Figure A-5. Initial allocation costs and the allocation order 119

Figure A-6. Database management costs by the proposed allocation order 120

Figure A-7. Network facility resources cost 121

Figure A-8. Total cost and optimal allocation results 122

Figure A-9. Determine optimal sites applying the proposed algorithms 123

Figure A-10. Incoming network traffic Table 124

Figure A-11. Comparison with all possible allocation in real world 125