Earticle

현재 위치 Home

A New Data Re-Allocation Model for Distributed Database Systems

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJDTA) 바로가기
  • 간행물
    International Journal of Database Theory and Application 바로가기
  • 통권
    Vol.5 No.2 (2012.06)바로가기
  • 페이지
    pp.45-60
  • 저자
    Hassan I. Abdalla
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A207847

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
An efficient functionality of any distributed database system “DDBS” is highly dependent on its proper design in terms of the adopted fragmentation and allocation methods. However, an optimal fragmentation and allocation design techniques could be very complex and requires good experiences and knowledge to reach. Fragmentation of a large, global databases are performed by dividing the database relations horizontally, vertically or as a combination of both. In order to enable distributed database systems to work efficiently, these fragments have to be allocated across the available sites in such a way that reduces communication cost i.e. to minimize the total volume of data transmitted during queries execution over sites. This paper presents a new data re-allocation model for replicated and non-replicated constrained DDBSs by bringing a change to data access pattern. This approach assumes that the distribution of fragments over network sites was initially performed according to a properly forecasted set of query frequency values that could be employed over sites. Our model takes sites constraints into account in the re-allocation phase. It proposes an efficient plan to re-allocate data fragments across sites based on communication and update cost values for each fragment individually. The re-allocation process will be performed by selecting the maximal update cost value for each fragment and making the re-allocation accordingly. Experimental results confirmed that the proposed technique will effectively contribute in solving fragments re-allocation problem in a dynamic distributed relational databases environment.

목차

Abstract
 1. Introduction
 2. Problem Statement And Information Requirements
  2.1 Problem Description and Notations
  2.2 Information Requirements
 3. The Proposed Model and Cost Functions
  3.1 The Proposed Model
  3.2 Fragments Priority (FP)
  3.3 Cost Functions
 4. The Proposed Algorithm
 5. Experimental Results
  5.1 Initial Allocation
  5.2 Re-Allocation Process
 6. Performance Evaluation
 7. Conclusions
 Acknowledgment
 References

키워드

distributed database fragment allocation heuristic algorithm redistribution algorithm

저자

  • Hassan I. Abdalla [ Department of Computer Science, College of Computer & Information Sciences, King Saud University ]

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJDTA) [Science & Engineering Research Support Center, Republic of Korea(IJDTA)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Database Theory and Application
  • 간기
    격월간
  • pISSN
    2005-4270
  • 수록기간
    2008~2016
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Database Theory and Application Vol.5 No.2

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장