• Title/Summary/Keyword: Replicated Database

Search Result 28, Processing Time 0.025 seconds

Replica Update Propagation Method for Cost Optimization of Request Forwarding in the Grid Database (그리드 데이터베이스에서 전송비용 최적화를 위한 복제본 갱신 전파 기법)

  • Jang, Yong-Il;Baek, Sung-Ha;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.11
    • /
    • pp.1410-1420
    • /
    • 2006
  • In this paper, a replica update propagation method for cost optimization of request forwarding in the Grid database is proposed,. In the Grid database, the data is replicated for performance and availability. In the case of data update, update information is forwarded to the neighbor nodes to synchronize with the others replicated data. There are two kinds of update propagation method that are the query based scheme and the log based scheme. And, only one of them is commonly used. But, because of dynamically changing environment through property of update query and processing condition, strategies that using one propagation method increases transmission cost in dynamic environment. In the proposed method, the three classes are defined from two cost models of query and log based scheme. And, cost functions and update propagation method is designed to select optimized update propagation scheme from these three classes. This paper shows a proposed method has an optimized performance through minimum transmission cost in dynamic processing environment.

  • PDF

An Integrated Repository System with the Change Detection Functionality for XML Documents (XML 문서 변경 탐지 기능을 갖는 통합 리파지토리 시스템)

  • Park, Seong-Jin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.10
    • /
    • pp.2696-2707
    • /
    • 2009
  • Although, a number of DBMS vendors are scrambling to extend their products to handle XML, there is a need for a lightweight, DBMS and platform-independent XML repository as well. In this paper, we describe such an XML integrated repository system, that solves the following functions : generating relational schema from XML DTDs for storage of XML documents, importing data from XML documents into relational tables, creating XML documents according to a XMLQL(XML Query Language) from data extracted from a database and synchronizing the replicated XML documents. In the XML repository systems, the efficient change detection techniques for XML documents is required to maintain the consistency of replicated XML data because the same data in the repository can be replicated between so many different XML documents. In this paper, we propose a message digest based change detection technique to maintain the consistency of replicated data between client XML documents and a XML data in XML repository systems.

A Load Balancing Method Using Mesh Network Structure in the Grid Database (그리드 데이터베이스에서 메쉬 연결구조를 이용한 부하 분산)

  • Lee, Soon-Jo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.5
    • /
    • pp.97-104
    • /
    • 2010
  • In this paper, mesh network structure is applied to solve the load balancing problems in the Grid database. Data of the Grid database is replicated to several node for enhanced performance. Therefore, load balancing for user's query is selected node that evaluated workload in it. Existing researches are using passive load balancing method that selected another node after then node overflowed workload. It is inefficient to be applied to Gird database that has a number of node and user's queries almost changes dynamically. The proposed method connected each node which includes the same data through mesh network structure. When user's query occurs, it select node that has the lowest workload. The performance evaluation shows that proposed method performs better than the existing methods.

Multilevel Security Management for Global Transactions

  • Jeong, Hyun-Cheol
    • Proceedings of the IEEK Conference
    • /
    • 2000.07b
    • /
    • pp.735-738
    • /
    • 2000
  • The most important issue in database security is correct concurrency control under the restrictive security policy. The goal of secure transaction management is to keep security and provide many concurrent users with the high availability of database. In this paper, we consider the security environment of multidatabase system with replicated data. The read-from relationship in the existed serializability is improper in security environment. So, we define new read-from relationship and propose new secure 1-copy quasi-seriailzability by utilizing this relationship and display some examples. This security environment requires both the existed local autonomy and the security autonomy as newly defined restriction. To solve covert channel problem is the most difficult issue in developing secure scheduling scheme. The proposed secure 1-copy quasi-serializability is very proper for global transactions in that this serializability not violates security autonomy and prevents covert channel between global transactions.

  • PDF

Transaction Management Using Update Protocol in Fully Replicated Databases (완전중복 데이터베이스에서 갱신 규약을 적용한 거래 관리)

  • Choe, Hui-Yeong;Hwang, Bu-Hyeon
    • The KIPS Transactions:PartD
    • /
    • v.9D no.1
    • /
    • pp.11-20
    • /
    • 2002
  • We propose a new concurrency control algorithm for enhancing the degree of parallelism of the transactions in fully replicated databases designed to improve the availability and the reliability. The update transactions can be logically decomposed of a read-only transaction and a write-only transaction. In our algorithm, a set of read operations of an update transaction is treated as a read-only transaction and the read-only transaction reads data items in the site to which it is submitted. And a set of write operations of the update transaction is treated as a write-only transaction and it is submitted to all corresponding sites after the update transaction has been completed. By using the proposed update protocol, all write-only transactions can execute at all sites atomically. The proposed algorithm can have transactions execute concurrently at the site to which they are submitted and, after the completion of each transaction, the update protocol is performed for updating their data items and checking their serializability. Therefore, the degree of parallelism of the transactions can be improved. Especially, if the probability of conflict among transactions is low, we can expect the higher degree of their parallelism.

Performance Evaluation of System Catalog Management Schemes for Distributed XML Repository Systems at the Query Compilation Time (분산 XML 저장 시스템에서 질의 컴파일 시 시스템 카탈로그 관리 기법의 성능 평가)

  • Jang, Gun-Up;Hong, Eui-Kyeong
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.2
    • /
    • pp.178-190
    • /
    • 2009
  • XML is recommended by W3C(World Wide Web) and widely accepted as a standard markup language for expression and sharing data. Recently, increasing the use and the amount of XML documents, there is required that easy methods for accessing XML documents at anytime and anywhere, therefore, the distributed XML repository systems is developed. For this, distributed XML repository systems is necessary to research catalog management schemes. In this paper, we design distributed XML database model considering CPU costs, I/O costs, concurrency control, two-phase commits a protocol, queuing delay and so on. And we implement a simulator in order to execute performance evaluation centralized catalog method, fully replicated catalog method, and partitioned catalog method using reasonably setting up environments.

  • PDF

An Analysis of Replication Enhancement for a High Availability Cluster

  • Park, Sehoon;Jung, Im Y.;Eom, Heonsang;Yeom, Heon Y.
    • Journal of Information Processing Systems
    • /
    • v.9 no.2
    • /
    • pp.205-216
    • /
    • 2013
  • In this paper, we analyze a technique for building a high-availability (HA) cluster system. We propose what we have termed the 'Selective Replication Manager (SRM),' which improves the throughput performance and reduces the latency of disk devices by means of a Distributed Replicated Block Device (DRBD), which is integrated in the recent Linux Kernel (version 2.6.33 or higher) and that still provides HA and failover capabilities. The proposed technique can be applied to any disk replication and database system with little customization and with a reasonably low performance overhead. We demonstrate that this approach using SRM increases the disk replication speed and reduces latency by 17% and 7%, respectively, as compared to the existing DRBD solution. This approach represents a good effort to increase HA with a minimum amount of risk and cost in terms of commodity hardware.

Study of a GIS Based Land Use/Cover Change Model in Laos

  • Wada, Y.;Rajan, K.S.;Shibasaki, R.
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.266-268
    • /
    • 2003
  • This is based on the AGENT-LUC model framework. Luangprabang Province has the largest percentage of shifting cultivation area in Laos PDR. The model simulates the spatial and temporal patterns of the shifting cultivation in the study area, using a GIS database while the total area of shifting cultivation is controlled by supply and demand balance of food. The model simulation period is from 1990 to 1999, at a spatial resolution of 500m. The results are evaluated using statistical data and remote sensing images. Through the validation, it is concluded that the trends simulated agrees to that of statistical data and the spatial and temporal patterns are also replicated satisfactorily.

  • PDF

A Strategy using Updatable Message for Retaining the Cache Consistency in the Mobile Computing Environment (이동 컴퓨팅 환경에서 갱신가능 메시지를 이용한 캐쉬 일과성 유지 정책)

  • Park, Seong-Bae;Hwang, Bu-Hyun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1694-1705
    • /
    • 1997
  • In the future mobile computing environment, it will be generalized that a mobile host with portable Laptop of Palmtop accesses to database through wireless communication channel. For solving the problems which are caused from low bandwidth of wireless communication, mobile hosts cache the datum used frequently on them. Thus the mobile hosts must always retain the cache consistency for the correctness of the cached datum. the cache consistency is mainly affected from the unrestricted host mobility and the disconnection of the communication between mobile hosts and mobile support station. In this situation, the strategy to retain efficiently cache consistency is required. In this paper, we propose a strategy using updatable message for retaining the cache consistency, in the mobile computing environment, with replicated database supporting 2 phase commit protocol. This strategy makes use of a updatable message to resolve the cache consistency problem, since mobile host crosses the boundary of cell. In using of this updatable, it find out and cache only the update data of missing invalidation message. As a result, the proposed strategy utilizes network bandwidth efficiently because it is not need to delete all the cached datum with any datum change.

  • PDF

Identification and Phylogeny of the Human Endogenous Retrovirus HERV-W LTR Family in Human Brain cDNA Library and Xq21.3 Region

  • KIM, HEUI-SOO;TIMOTHY J. CRO
    • Journal of Microbiology and Biotechnology
    • /
    • v.12 no.3
    • /
    • pp.508-513
    • /
    • 2002
  • Human endogenous retroviral long terminal repeats (LTRs) have been found to be coexpressed with sequences of genes located nearby. It has been suggested that the LTR elements have contributed to the structural change or genetic variation of human genome connected to various diseases. The HERV-W family has been identified in the cerebrospinal fluids and brains of individuals with schizophrenia. Using a cDNA library derived from a human brain, the HERV-W LTR elements were examined and five new LTR elements were identified. These elements were examined using a YAC clone panel from the Xq21.3 region linked to psychosis that was replicated on the Y chromosome after the separation of the chimpanzee and human lineages. Fourteen elements of the HERV-W LTR were identified in that region. Those LTR elements showed a high degree of sequence similarity ($91.8-99.5\%$) with previously reported HERV-W LTR. A phylogenetic tree obtained from the neighbor-joining method revealed that new HERV-W LTR elements were closely related to the AXt000960, AF072504, and AF072506 from the GenBank database. The data indicates that several copy numbers of the HERV-W LTR elements exist on the Xq21.3 region and are also expressed in the human brain. These LTR elements need to be further investigated as potential leads to neuropsychiatric diseases.