Database allocation modeling for optimal design of distributed systems

Jae W. Lee, Doo Kwon Baik

Research output: Contribution to journalArticle

Abstract

By using distributed database systems, many advantages can be obtained such as database management cost, efficiency, and high integrity of systems through allocating fragments to many distributed sites with horizontal/vertical fragmentation of global database schema. To minimize costs, distributed algorithms must be applied so that database fragments are allocated to optimal sites. It is useful to replicate fragments, such as allocating many copies in many sites including load balancing. But there are too many possible combinations of each site and fragment, making it impossible to find a solution in real time, i.e., it is an NP-complete problem. This paper proposes near optimal heuristic algorithms for minimizing cost by defining a cost model based on read and update queries that are requested in many sites. Various factors are applied to the proposed algorithms for sizing efficient network resources that compute database transactions as remote query or update requests for consistency in replicated database systems. For network load balancing, incoming network traffic table is defined in each site. A request transaction from unallocated sites to allocated sites can be accessed properly at any other replicated sites by using the network traffic table. Finally, some experimental results verified the proposed algorithms by comparing actual cases of database allocation.

Original languageEnglish
Pages (from-to)1795-1804
Number of pages10
JournalIEICE Transactions on Information and Systems
VolumeE87-D
Issue number7
Publication statusPublished - 2004 Jul 1

Fingerprint

Resource allocation
Costs
Distributed database systems
Heuristic algorithms
Parallel algorithms
Optimal design
Computational complexity

Keywords

  • Distributed database
  • File allocation model
  • Fragment replication
  • Heuristic algorithm
  • NP-completeness

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Information Systems
  • Software

Cite this

Database allocation modeling for optimal design of distributed systems. / Lee, Jae W.; Baik, Doo Kwon.

In: IEICE Transactions on Information and Systems, Vol. E87-D, No. 7, 01.07.2004, p. 1795-1804.

Research output: Contribution to journalArticle

@article{17dfafdc729741319409ed325e0e843c,
title = "Database allocation modeling for optimal design of distributed systems",
abstract = "By using distributed database systems, many advantages can be obtained such as database management cost, efficiency, and high integrity of systems through allocating fragments to many distributed sites with horizontal/vertical fragmentation of global database schema. To minimize costs, distributed algorithms must be applied so that database fragments are allocated to optimal sites. It is useful to replicate fragments, such as allocating many copies in many sites including load balancing. But there are too many possible combinations of each site and fragment, making it impossible to find a solution in real time, i.e., it is an NP-complete problem. This paper proposes near optimal heuristic algorithms for minimizing cost by defining a cost model based on read and update queries that are requested in many sites. Various factors are applied to the proposed algorithms for sizing efficient network resources that compute database transactions as remote query or update requests for consistency in replicated database systems. For network load balancing, incoming network traffic table is defined in each site. A request transaction from unallocated sites to allocated sites can be accessed properly at any other replicated sites by using the network traffic table. Finally, some experimental results verified the proposed algorithms by comparing actual cases of database allocation.",
keywords = "Distributed database, File allocation model, Fragment replication, Heuristic algorithm, NP-completeness",
author = "Lee, {Jae W.} and Baik, {Doo Kwon}",
year = "2004",
month = "7",
day = "1",
language = "English",
volume = "E87-D",
pages = "1795--1804",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "7",

}

TY - JOUR

T1 - Database allocation modeling for optimal design of distributed systems

AU - Lee, Jae W.

AU - Baik, Doo Kwon

PY - 2004/7/1

Y1 - 2004/7/1

N2 - By using distributed database systems, many advantages can be obtained such as database management cost, efficiency, and high integrity of systems through allocating fragments to many distributed sites with horizontal/vertical fragmentation of global database schema. To minimize costs, distributed algorithms must be applied so that database fragments are allocated to optimal sites. It is useful to replicate fragments, such as allocating many copies in many sites including load balancing. But there are too many possible combinations of each site and fragment, making it impossible to find a solution in real time, i.e., it is an NP-complete problem. This paper proposes near optimal heuristic algorithms for minimizing cost by defining a cost model based on read and update queries that are requested in many sites. Various factors are applied to the proposed algorithms for sizing efficient network resources that compute database transactions as remote query or update requests for consistency in replicated database systems. For network load balancing, incoming network traffic table is defined in each site. A request transaction from unallocated sites to allocated sites can be accessed properly at any other replicated sites by using the network traffic table. Finally, some experimental results verified the proposed algorithms by comparing actual cases of database allocation.

AB - By using distributed database systems, many advantages can be obtained such as database management cost, efficiency, and high integrity of systems through allocating fragments to many distributed sites with horizontal/vertical fragmentation of global database schema. To minimize costs, distributed algorithms must be applied so that database fragments are allocated to optimal sites. It is useful to replicate fragments, such as allocating many copies in many sites including load balancing. But there are too many possible combinations of each site and fragment, making it impossible to find a solution in real time, i.e., it is an NP-complete problem. This paper proposes near optimal heuristic algorithms for minimizing cost by defining a cost model based on read and update queries that are requested in many sites. Various factors are applied to the proposed algorithms for sizing efficient network resources that compute database transactions as remote query or update requests for consistency in replicated database systems. For network load balancing, incoming network traffic table is defined in each site. A request transaction from unallocated sites to allocated sites can be accessed properly at any other replicated sites by using the network traffic table. Finally, some experimental results verified the proposed algorithms by comparing actual cases of database allocation.

KW - Distributed database

KW - File allocation model

KW - Fragment replication

KW - Heuristic algorithm

KW - NP-completeness

UR - http://www.scopus.com/inward/record.url?scp=3142706469&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3142706469&partnerID=8YFLogxK

M3 - Article

VL - E87-D

SP - 1795

EP - 1804

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 7

ER -