• The KIPS Transactions:PartD
• /
• v.10D no.6
• /
• pp.935-948
• /
• 2003

An online scaling method adds new nodes to the shared-nothing database cluster and makes tables be reorganized while the system is running. The objective is to share the workload with many nodes and increase the capacity of cluster systems. The existing online scaling method, however, has two problems. One is the degradation of response time and transactions throughput due to the additional overheads of data transfer and replica's condidtency. The other is and inefficient recovery mechanism in which the overall scaling transaction is aborted by a fault. These problems deteriorate the availability of shared-nothing database cluster. To avoid the additional overheads throughout the scaling period, our scalingmethod consists of twophases : a parallel data transfer phase and a combination phase. The parallel data transferred datausing reduces the size of data transfer by dividing the data into the number of replicas. The combination phase combines the transferred datausing resources of spare nodes. Also, our method reduces the possibility of failure throughout the scaling period and improves the availability of the database cluster.

• Journal of Korea Spatial Information System Society
• /
• v.2 no.1 s.3
• /
• pp.29-41
• /
• 2000

As the networks proliferate all over the world and the application of the geographical information increase recently, the importance of effective access and exchange of GIS data is recognized. However, existing GIS data are generated by many different organizations without proper standard methodologies and data exchange facilities such as clearing houses are being operated on different DBMS with their own schemata. It makes difficult for users to access and utilize the GIS data even the data are open to public. In this research, we provide the users a search system that interfaces heterogeneous repository systems. In order to interact heterogeneous DBMS we utilize the metadata interchange standard (XMI) from OMG.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1052-1059
• /
• 2016

A key role in cloud computing systems that is becoming an issue is implementing a database on untrusted cloud servers requiring the complexity of key management. This study proposes a key management system using Self Proxy Servers to minimize key executions and improve the performance of cloud services by generating Self-Creating Algorithms where the data owner is not directly concerned with related keys when a user sends an encrypted database a query. The Self Proxy Server supports active and autonomous key managements as a distributed server if any trouble should arise from a cloud key server and for an efficient cloud key management. Therefore, the key management system provides secure cloud services by supporting confidentiality of a cloud server database.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.1-10
• /
• 1999

A mobile computing environment is one that support user's mobility through the wireless communication technology. Users access the database and get results what they want by running mobile transactions. To run the mobile transaction correctly and to maintain the consistency I database, we need a concurrency control method to schedule transactions, a caching method to manage the cache, and a recovery method to construct a fault tolerant system. A mobile computing system is based on the existing distributed system, but we can't use recovery methods of the existing distributed system directly because of the user's mobility and the features of wireless media. So this paper presents a recovery mechanism to construct a fault tolerant mobile computing systems. Especially. we develop and analyze a recovery algorithm for server failure among types of failure which can arise in mobile computing environments.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.464-475
• /
• 2003

few sample objects and compressed histogram information of image databases. The histogram information is used to estimate the selectivity of spherical range queries and a small number of sample objects is used to compensate the selectivity error due to the difference of the similarity measures between meta server and local image databases. An extensive experiment on a large number of image data demonstrates that our proposed method performs well in the distributed heterogeneous environment.

• The Journal of the Korea Contents Association
• /
• v.8 no.12
• /
• pp.53-62
• /
• 2008

The Election paradigm can be used as a building block in many practical problems such as group communication, atomic commit and replicated data management where a protocol coordinator might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need an election protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile ad hoc computing environment. Mobile ad hoc systems are more prone to failures than conventional distributed systems. Solving election in such an environment requires from a set of mobile nodes to choose a unique node as a leader based on its priority despite failures or disconnections of mobile nodes. In this paper, we describe a solution to the election problem from mobile ad hoc computing systems. This solution is based on the Group Membership Detection algorithm.

• The KIPS Transactions:PartC
• /
• v.17C no.5
• /
• pp.399-406
• /
• 2010

Many problems are arisen due to the weakness in the security and invasion to privacy by malicious attacker or internal users while various data services are available in ubiquitous network environment. The matter of controlling security for various contents and large capacity of data has appeared as an important issue to solve this problem. The allocation methods of Ito, Saito and Nishizeki based on traditional polynomial require all shares to restore the secret information shared. On the contrary, the secret information can be restored if the shares beyond the threshold value is collected. In addition, it has the effect of distributed DBMS operation which distributes and restores the data, especially the flexibility in realization by using parameters t,v,k in combinatorial design which has regularity in DB server and share selection. This paper discuss the construction of new share allocation method and data distribution/storage management with the application of matrix structure of t-(v,k,1) design for allocating share when using secret sharing in management scheme to solve the matter of allocating share.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.605-612
• /
• 2001

In order to solve the overload of academic affairs management system, we propose a method builds a distributed Replication server and uses this server with the present centralized system. Normal query transactions which are not required for data modification are composed of almost all DML sentences. So we construct the distributed replication servers according to the data characteristics and make them perform the query transaction without modification. In this way, we can simultaneously distribute users and data, and cut down processing time for every transaction. Also Replication server has the advantages of implemental efficiency and economical because it uses resources of present centralized system without and additional configurations. Usually, to distribute the overload of server, they can use way, Client-side overload distribution that user program get present overload status then can choose a less overloaded server, and the other way, Server-side overload distribution that make use of Application Layer Scheduling Technique and IP Layer Scheduling Technique. Our Replication server can reduce the overload of centralized system by eliminating or complementing those defects of overload distribution, referred to in the forehead.

• Journal of Internet Computing and Services
• /
• v.1 no.1
• /
• pp.35-46
• /
• 2000

One of the main chalenges in personal communication services (PCS) is to locate many mobile terminals that may move frequently from place to place. Such a system operation is called location management. Many network signaling traffic, and database queries are required to achieve such a task. Several strategies have been proposed to improve the efficiency of location management. These strategies use location register databases to store the current location on mobile terminals, and are vulnerable to failure of the location registers. In this paper, we propose a fault-tolerant pointer forwarding with distributed home location register (FT-RFDHLR) to tolerate the failure of location registers. The performance of the proposed method is evaluated by an analytical model, and is compared with thew pointer forwarding with the single home location register (PFSHLR), the pointer forwarding with distributed home location register (PFDHLR), Biaz's bypass forwarding strategy (BFS) and two-path forwarding strategy (TPFS).

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06c
• /
• pp.103-105
• /
• 2006

최근 기업들은 분산된 조직과 각 조직의 목적에 따라 데이터베이스도 분산되어 있기 때문에 이들 간의 공유 및 협업을 통한 상호 운용성을 지원하기 어려우므로 일관적인 형태로 연동하기 위해서 메타데이터 수준의 표준이 필요하다. 또한 협업적인 거래환경에서의 EAI시스템은 다양한 정보 시스템에서 관리되는 지식들을 유기적으로 통합하고 공유함으로서 효율적인 검색 및 비용절감 등 많은 효과를 기대할 수 있다. 그러나 기존의 시스템은 특정 목적에 따라 관리되고 공유되므로 사실상 통합 외 공유에는 상당한 어려움이 있다. 따라서 본 논문에서 제시하는 XMDR은 온톨로지와 메타데이터 결합된 형태로 각종 표준들을 일관적인 형태로 온톨로지와 시소러스 개념을 도입함으로서 데이터수준의 정보를 통합 하기위한 메타데이터 공유 및 정보 시스템 통합의 일관성을 유지 할 수 있다. 본 논문에서 제시되는 브리지 XMDR 검색시스템은 원시데이터 계층, XMDR 계층. 브리지 XMDR 계층으로 3계층으로 구성된다. XMDR 계층은 분산된 데이터베이스의 속성표현의 표준과 관계성을 정의한 표준 온톨로지, 카테고리 분류 온틀로지, 사이트의 정보를 제공하는 로케이션 온톨로지로 구성되는 XMDR을 정의한다. 브리지 XMDR 계층은 XMDR간의 정보를 공유하기 위한 공유 도메인 속성을 추출한 하이브리드 통합방식으로 업무간의 의미적 통합이 가능하다.