• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2248-2255
• /
• 1998

The property of connectivity between DBMS and application system developed in java is very important under the distributed object environments with heterogeneous systems. In these days, mostly used JDBC 3-tier model, which supports the connectivity, has two problems: the one is the restricted connectivity needed for the Java applet as application programs and the other is the additional efforts to design and implemtnt in linking any application program with the middleware from being deficit of standard protocol. In order to solve these problems, we have worked on Enlarging the properties of JDBC 3 tier model by applying CORBA distributed object environments. Thus, the enlarged 3-tier model has an ORB-JDBC sub protocol for the client sub-protocol and a middleware whose property is supported by CORBA.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.586-593
• /
• 2009

As most of the data configuration at distributed environment has a tree structure following the hierarchical classification, relative data retrieve is limited. Among these data, the data stored in a database has a problem in integration and efficient retrieve. Accordingly, we suggest the system that uses XMDR for distributed database integration and links XMDR to TopicMap for efficient retrieve of knowledge expressed hierarchically. We proposes a plan for efficient integration retrieve through using the XMDR which is composed of Meta Semantic Ontology, Instance Semantic Ontology and meta location, solves data heterogeneity and metadata heterogeneity problem and integrates them, and replaces the occurrence of the TopicMap with the Meta Location of the XMDR, which expresses the resource location of TopicMap by linking Meta Semantic Ontology and Instance Semantic Ontology of XMDR to the TopicMap.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.459-464
• /
• 2005

The online game system could be largely divided into two parts: servers and clients. Clients accesses to a game server and analyzes the packets transmitted from a server. A game server manages users information and database. U a game server allows a new client to access the server to execute a game, it should accept the access request of the new client maintaining the online connection of the existing users. In this paper, we compare Process method and Thread method within the multiple jobs process methods of a server. Then we propose an asymmetric distributed multi server architecture that is adequate to asymmetric distributed architecture that is widely applied to most game servers. The proposed asymmetric distributed multi server architecture includes login server, game server, communication server and database server to perform its own feature independently. Comparing its other architectures, it shows better performance economically and technically. Especially it improves the stability and expandability of a server.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.11a
• /
• pp.43-50
• /
• 2003

시뮬레이션의 궁극적인 목표인 분산 시뮬레이션은 Virtual Simulation과 Constructive Simulation 이외에 Live Simulation이 동시에 참여하여 동일한 환경 내에서 상호작용 하는 것을 추구하고 있다. 따라서 서로 다른 목적과 기술로 제작된 시뮬레이션은 통합된 환경 내에서 사실적으로 상호작용 해야만 할 것이다. 통합 환경(Synthetic Environment)은 시각적 영상을 표현하기 위한 Visual Database 이상의 의미를 내포하고 있다. 상호운용성(Interoperability)은 타 Model 및 Simulation에서 부터 제공되는 기능을 사용하거나 기능을 제공할 수 있는 유용성(Availability)을 뜻하기 때문에 표준화된 통합 환경의 사용 및 교환을 요구한다. 1980년대 중반, 미 국방성은 Image Generator 제작 회사마다 독자적인 데이터베이스 포맷을 사용함으로 인해 시뮬레이터 데이터베이스의 중복성이 야기되고 있다는 것을 지적하고 통합 환경 데이터 교환 문제를 해결하기 위한 최초의 관련 연구를 수행하였다. Virtual Simulation에서 막대한 비용이 소모되는 시뮬레이터 데이터베이스의 제작 및 유지 보수에 들어가는 이중적인 비용 절감에 대한 관심은 최근 SEDRIS에 이르러 표준 교환에 대한 명세의 필요성이 보다 구체화되어 지구상에 존재하는 각종 주변 환경을 기술하기 위한 통합 환경표현 및 교환의 표준화가 진행되고 있다. 국내에서는 문화콘텐츠진흥원, 한국게임산업개발원, 한국전자통신연구원, 국방과학연구소, 서울대, 아주대, 세종대 등을 중심으로 연구가 진행 중이며, 그중 세종대학교는 SEDRIS 데이터로 사용될 원본 데이터의 충실도와 신뢰도를 향상시킬 수 있는 방법을 연구하고 있다. SEDRIS는 그 응용가능성이 무궁무진하여 향후 인공적인 가상환경을 대표하는 용어로 사용될 것이며, 공개된 표준을 통한 소스 데이터의 공유로 상호운용성을 위한 초석을 제공하여 궁극적으로는 비용 절감 효과가 있을 것으로 전망된다.

• 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.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.313-320
• /
• 2003

This paper design and implements a synchronized agent mechanism that be able to synchronize SFT (Slow Frequency Transaction) data among e-business processes in distributed environment. This synchronized agent system is adopted to use mobile agent to guarantee the interoperability of the distributed processes and to solve some problems at the client/server architecture and proposes a policy to synchronize data of e-business processes on the any platforms of distributed heterogeneous systems. The proposed synchronization policy is based on the time-stamp transaction with the system priority on the unicasting transportation.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3456-3468
• /
• 1999

Most of previous parallel join algorithms assume a database partition system(DPS), where each database partition is owned by a single processing node. While the DPS is novel in the sense that it can interconnect a large number of nodes and support a geographically distributed environment, it may suffer from poor facility for load balancing and system availability compared to the database sharing system(DSS). In this paper, we propose a dynamic load balancing strategy by exploiting the characteristics of the DSS, and then extend the conventional hash join algorithms to the DSS by using the dynamic load balancing strategy. With simulation studies under a wide variety of system configurations and database workloads, we analyze the effects of the dynamic load balancing strategy and differences in the performances of hash join algorithms in the DSS.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.93-106
• /
• 2006

A Grid Database is a database management system to process effectively and use the distributed data in a grid computing environment. Spatial data is more important than other general data according to the local characteristics and requires a large storage. The grid database can be used as the optimal system for the management of the spatial data. However, contrary to the conventional distributed database systems, the Grid Database which guarantees the local autonomy has a possibility not to provide an effective system, or it is impossible to use a centralized management environment. In order to allow flexible responses to a dynamically changing environment, it is required to use effectively reorganized method. In this paper, hierarchical reorganization method is presented for dynamic reorganization in a grid database. When the reorganization is conducted, an organizer is created to collect the information of databases. In addition, the organizer which is constructed by the hierarchical structure supports information communication and reorganization, and then it allows the support of regional reorganization operation and effective balance control. The performance assessment of the proposed method shows that the processing capacity is increased after the reorganization.

• The Journal of Korean Association of Computer Education
• /
• v.5 no.3
• /
• pp.11-18
• /
• 2002

It is important to maintain the integrity of the personal information stored duplicately in DBs on the internet sites and to reduce the inconvenience of the user's. So it is useful to develop the integrated-DB supporting the independence of the S/W. In this paper, we investigate the defect of the membership management system on the internet site. Based on the result, we model the personal information management system to manage the membership efficiently, and implement the integrated personal information management system, called IPIMS.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.196-198
• /
• 2002

클러스터링 데이터베이스는 높은 가용성과 확장성을 갖으며, 예상치 못한 클라이언트 질의의 증가나 질의 패턴의 변경에 따른 작업부하의 편중에 효율적으로 대처할 수 있는 구조이다. 특히 온라인 확장 기법은 트랜잭션 처리를 중지하지 않고 새로운 노드를 클러스터에 추가하여 데이터를 재구성함으로써 임의의 노드에 질의가 집중되는 문제를 해결할 수 있다. 정적으로 구성된 시스템만으로는 두 대 이상의 서버에 작업량이 집중될 경우 재배치 시 서버 간의 데이터 이동의 반복 현상이 발생되며. 이로 인해 네트웍의 부하와 함께 실시간 트랜적션의 처리에 있어서 응답 시간이 지연되는 문제점이 발생한다. 따라서 본 논문에서는 데이터 이동의 반복 현상을 해결하기 위해 클러스터링 데이터베이스에서 온라인 확장을 고려한 CSB+ 트리 색인의 온라인 재구성 기법을 제안한다. 제안된 기법은 온라인 확장을 통한 동구 노드의 확장으로 데이터 이동의 반복을 막고 새롭게 추가된 노드를 통해 빠르고 효율적인 데이터의 분산을 수행한다 또한 각 시스템의 내부를 CS$B^{+}$ 트리로 구성하여 데이터의 재주성시에도 실시간 트랜잭션에 대한 빠른 응답 시간을 보장한다.