권호기사보기
| 기사명 | 저자명 | 페이지 | 원문 | 기사목차 |
|---|
| 대표형(전거형, Authority) | 생물정보 | 이형(異形, Variant) | 소속 | 직위 | 직업 | 활동분야 | 주기 | 서지 | |
|---|---|---|---|---|---|---|---|---|---|
| 연구/단체명을 입력해주세요. | |||||||||
|
|
|
|
|
|
* 주제를 선택하시면 검색 상세로 이동합니다.
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
감사의 글
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
*표시는 필수 입력사항입니다.
| 전화번호 |
|---|
| 기사명 | 저자명 | 페이지 | 원문 | 기사목차 |
|---|
| 번호 | 발행일자 | 권호명 | 제본정보 | 자료실 | 원문 | 신청 페이지 |
|---|
도서위치안내: / 서가번호:
우편복사 목록담기를 완료하였습니다.
*표시는 필수 입력사항입니다.
저장 되었습니다.