• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.596-608
• /
• 2004

A lot of work has been done to reduce disk access time in I/O intensive systems, which store and handle massive amount of data, by distributing data across multiple disks and accessing them in parallel. Most of the previous work has focused on an efficient mapping from a grid cell to a disk number on the assumption that data space is regular grid-like partitioned. Although we can achieve good performance for low-dimensional data by grid-like partitioning, its performance becomes degenerate as grows the dimension of data even with a good disk allocation scheme. This comes from the fact that they partition entire data space equally regardless of distribution ratio of data objects. Most of the data in high-dimensional space exist around the surface of space. For that reason, we propose a new declustering algorithm based on the partitioning scheme which partition data space from the surface. With an unbalanced partitioning scheme, several experimental results show that we can remarkably reduce the number of data blocks touched by a query as grows the dimension of data and a query size. In this paper, we propose disk allocation schemes based on the layout of the resultant data blocks after partitioning. To show the performance of the proposed algorithm, we have performed several experiments with different dimensional data and for a wide range of number of disks. Our proposed disk allocation method gives a performance within 10 additive disk accesses compared with strictly optimal allocation scheme. We compared our algorithm with Kronecker sequence based declustering algorithm, which is reported to be the best among the grid partition and mapping function based declustering algorithms. We can improve declustering performance up to 14 times as grows dimension of data.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.390-398
• /
• 2006

The objective of the High Energy Physics(HEP) is to understand the basic properties of elementary particles and their interactions. The CMS(Compact Muon Solenoid) experiment at CERN which will produce a few PetaByte of data and the size of collaboration is around 2000 physicists. We cannot process the amount of data by current concept of computing. Therefore, an area of High Energy Physics uses a concept of Tier and Data Grid. We also apply Data Grid to current High Energy Physics experiments. In this paper, we report High Energy Physics Data Grid System as an application of Grid.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.665-676
• /
• 2001

The most expensive spatial operation in patial database in a spatial join which computes a combined table of which tuple consists of two tuples of the two tables satisgying a spatial predicate. Although the execution time of sequential processing of a spatial join has been so far considerably improved the response time is not tolerable because of not meeting the requiremetns of interactive users. It is usually appropriate to use parallel processing to improve the performance of spatial join processing. in spatial database the fixed grids which consist of the regularly partitioned cells can be employed the previous works on the spatial joins have not studied the parallel processing of spatial joins using fixed grids. This paper has presented an analytical cost model that estimates the comparative performance of a parallel spatial join algorithm based on the fixed grids in terms of the number of MBR comparisons. disk accesses, and message passing, Several experiments on the synthetic and real datasets show that the proposed analytical model is very accurate. This most model is also expected to used for implementing a very important DBMS component, Called the query processing optimizer.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.380-389
• /
• 2006

In this paper, we present the MGrid system and its application for the construction of the Glycoconjugates simulation database called e-Glycoconjugates. The MGrid system is an integrated molecular simulation grid system for computing, databases, and analyses. For e-Glycoconjugates, we have been constructing the simulation database for 2,000 glycan chains and 100 glycoproteins until 2008. In this paper, we present the goal, architecture, and current implementation status of the MGrid system, and e-Glycoconjugates.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2005.11a
• /
• pp.67-73
• /
• 2005

최근 이동체의 위치 데이타를 활용하는 위치 기반 서비스에 대한 관심이 급증하고 있다. 이러한 위치 기반 서비스에서 이용되는 대용량 위치 데이타를 효율적으로 관리하기 위한 아키텍처로서 클러스터 기반 분산 컴퓨팅 구조를 갖는 GALIS(Gracefully Aging Location Information System) 아키텍처가 제안되었다. GALIS는 비균등 2-단계 그리드를 사용하여 노드들의 부하 분산 및 색인을 수행한다. 하지만 비균등 2-단계 그리드의 분할 알고리즘은 이동체가 특정 지역에 편중되는 경우 불필요한 노드를 생성하는 문제를 가지고 있다. 따라서 본 논문에서는 이동체의 다양한 분포에 대하여 더욱 효율적인 노드 분할 알고리즘을 제시한다. 본 논문에서 제시한 노드 분할 알고리즘은 이동체의 현재 위치에 따른 공간적 분포를 고려하기 때문에 이동체가 특정 지역에 편중되는 경우에도 불필요한 노드를 생성하지 않고 효율적인 부하 분산을 수행할 수 있으며, 분산 시스템에서 중요시되는 균형 있는 부하 분산을 수행할 수 있다. 또한, 가상 노드 분할 시뮬레이터를 구현하여 다양한 이동체 데이타 분포 형태에 대해 실험하였으며, 이러한 실험을 통하여 기존의 알고리즘보다 더욱 효율적으로 노드를 분할하는 것을 검증하였다.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.567-576
• /
• 2003

Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exists in spatial databases, is a challenging task due to the huge amounts of spatial data. Clustering algorithms are attractive for the task of class identification in spatial databases. Several methods for spatial clustering have been presented in recent years, but have the following several drawbacks increase costs due to computing distance among objects and process only memory-resident data. In this paper, we propose an efficient grid cell based spatial clustering method for spatial data mining. It focuses on resolving disadvantages of existing clustering algorithms. In details, it aims to reduce cost further for good efficiency on large databases. To do this, we devise a spatial clustering algorithm based on grid ceil structures including cell relationships.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.253-255
• /
• 2005

최근 생물학 문제를 해결하기 위하여 생명 정보 분야에서 많은 컴퓨터 기술들이 응용되고 있다. 플라보노이드 정보는 항암, 항산화 효과가 있는 유용한 물질인 플라보노이드의 연구와 관련된 정보를 분석하고 관리하는 컴퓨터 기술 기반의 응용 기술이다. 현재 플라보노이드 정보 관련 연구는 일부에서 수행되고 있으며 플라보노이드의 다양한 정보를 효율적으로 저장 검색 할 수 있는 시스템은 부족한 실정이다. 플라보노이드 물질에 관한 정보를 더욱 효과적으로 저장 관리하고 관련된 연구자들 간에 정보를 쉽게 공유할 수 있도록 본 논문에서는 플라보노이드 정보를 위한 그리드 웹 포탈 시스템 구조와 관련된 데이타 모델을 제안한다. 본 논문에서 제안한 시스템과 데이타 모델의 유용함을 보이기 위해 웹 기반으로 플라보노이드 정보 그리드 포탈을 구현한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.183-189
• /
• 2009

Recently, PCS, PDA and mobile devices, such as the proliferation of spread, GPS (Global Positioning System) the use of, the rapid development of wireless network and a regular user even images, audio, video, multimedia data, such as increased use is for. In particular, video data among multimedia data, unlike the moving object, text or image data that contains information about the movements and changes in the space of time, depending on the kinds of changes that have sigongganjeok attributes. Spatial location of objects on the flow of time, changing according to the moving object (Moving Object) of the continuous movement trajectory of the meeting is called, from the user from the database that contains a given query trajectory and data trajectory similar to the finding of similar trajectory Search (Similar Sub-trajectory Retrieval) is called. To search for the trajectory, and these variations, and given the similar trajectory of the user query (Tolerance) in the search for a similar trajectory to approximate data matching (Approximate Matching) should be available. In addition, a large multimedia data from the database that you only want to be able to find a faster time-effective ways to search different from the existing research is required. To this end, in this paper effectively divided into a grid to search for the trajectory to the trajectory of moving objects, similar to the effective support of the search trajectory offers a new grid-based search techniques.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.304-314
• /
• 2005

In this paper, we propose a new phantom protection method for multi-dimensional index structures that uses multi-level grid technique. The proposed mechanism is independent of the types of multi-dimensional index structures, i.e., it can be applied to all types of index structures such as tree-based, file-based and hash-based index structures. Also, it achieves low development cost and high concurrency with low lock overhead. It is shown through various experiments that the proposed method outperforms existing phantom protection methods for multi-dimensional index structures.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.363-369
• /
• 2006

It is aware that Bandwidth management with dramatically increasing traffic on account of frequent and large file transmission in a data grid environment is one of essential needs. A this paper we propose new method which guarantees QoS (Quality of Service) by being in control of resources in TCP layer based on existing studies that manage bandwidth over TCP buffer tuning. General QoS solutions manage network resources subsequent to observing them in IP or link layer, but the scheme in the paper is able to control network resources in TCP layer that is network upper layer. Consequently, bandwidth allocation to each user can be efficiently controlled depending on an authority each user is given so that users could be use different bandwidth. It is expected that a new paradigm is supposed in network resource management and the method of levies for users' bandwidth uses.