• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1599-1607
• /
• 2015

Recently, researches have been developing efficient techniques for accessing, querying, and managing XML documents which are frequently used in the Internet. In this paper, we propose a parent-child matrix to cluster XML documents efficiently. A parent-child matrix analyzes both the content and structural features of an XML document. Each cell of a parent-child matrix has either the value of a node in an XML tree or the value of a child node, where a parent-child relationship exists in the XML tree. Then, the similarity between two XML documents can be measured by the similarity between two corresponding parent-child matrices. The experiment shows that our proposed method has good performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.288-291
• /
• 2008

전세계 인터넷 사용자 수가 약 12억 6천 만명에 이르며 2012년에는 17억명 이상이 인터넷을 사용할 것이라고 추정되는 가운데 웹 데이터베이스 응용에 대한 수요가 비즈니스를 포함하는 모든 분야에서 급속히 증가되고 있다. [1] 그러나 급증하는 수요에 비해 웹 응용의 생성 및 유지·보수는 대부분 수작업에 의존하기 때문에 많은 시간과 노력이 소요되고 있다. 본 논문에서 소개하는 WebAppGen은 ScriptGen과 InteraceGen으로 구성된 웹 응용 자동 생성기로서 웹 응용을 전자동으로 생성해 생산성을 향상시킨다. ScriptGen은 웹 응용에 필요한 폼들과 이 폼들을 통해 이루어지는 질의에 대해 데이터베이스와 연동하여 처리하는 웹 스크립트들을 자동생성하고 InterfaceGen은 ScriptGen을 통해 생성된 폼들을 엮어 접근하기 쉬운 트리 형태의 인터페이스를 제공한다. 상용 웹 응용 생성기들과 달리, WebAppGen은 웹 응용의 전 과정을 자동화 시킴으로써 생산성을 한 단계 더 향상시키고, 생성된 응용은 직관적인 계층구조를 가지는 트리 형태의 인터페이스를 지원한다. WebAppGen이 생성한 응용에서, 한 개의 폼은 관심의 대상인 엔티티 외에 이 엔티티와 직·간접적으로 연관된 모든 엔티티들에 대한 정보를 표현한다. 또한, WebAppGen은 생성될 응용의 기본 틀인 템플릿을 기반으로 하기 때문에 생성된 응용 및 WebAppGen 자체의 유지·보수를 용이하게 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.227-230
• /
• 2008

본 연구에서는 대용량 궤적 데이터베이스에서 영역 질의를 효과적으로 처리하기 위한 인덱싱 기법에 대하여 논의한다. 먼저, 기존 인덱싱 기법의 문제점을 지적하고, 이러한 문제점을 해결하는 새로운 기법을 제안한다. 제안된 기법에서는 우선 시간 차원을 다수의 시간 구간으로 분할하고, 인덱싱의 대상이 되는 전체 라인 세그먼트들을 시간 구간별로 구분한다. 각 시간 구간에 속하는 라인 세그먼트들에 대하여 별도의 인덱스를 구축한다. 또한, 디스크에서 관리되는 과거 시간 구간에 대한 인덱스들과는 달리 최근 시간 구간에 대한 인덱스는 메인 메모리상에 관리함으로써 삽입과 검색의 성능을 크게 개선할 수 있다. 각 시간 구간에 속하는 라인 세그먼트들은 다음과 같은 방식으로 인덱스를 구축한다. 먼저, 2D-트리를 이용하여 전체 공간 차원을 유사한 수의 라인 세그먼트들이 배정되도록 다수의 셀들로 분할한다. 또한, 분할된 각 셀마다 시공간 차원 (x, y, t)에 대한 별도의 3차원 $R^*$-트리를 두어 보다 상세한 인덱싱을 지원한다. 실험 결과에 의하면, 기존 기법에 비하여 작은 인덱스 구조를 갖으면서도 검색 성능면에서 $300%{\sim}1000%$까지의 성능 향상 효과를 갖는 것으로 나타났다.

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

The shape-based retrieval is defined as the operation that searches for the (sub) sequences whose shapes are similar to that of a query sequence regardless of their actual element values. In this paper, we propose a similarity model suitable for shape-based retrieval and present an indexing method for supporting the similarity model. The proposed similarity model enables to retrieve similar shapes accurately by providing the combination of various shape-preserving transformations such as normalization, moving average, and time warping. Our indexing method stores every distinct subsequence concisely into the disk-based suffix tree for efficient and adaptive query processing. We allow the user to dynamically choose a similarity model suitable for a given application. More specifically, we allow the user to determine the parameter p of the distance function $L_p$ when submitting a query. The result of extensive experiments revealed that our approach not only successfully finds the subsequences whose shapes are similar to a query shape but also significantly outperforms the sequence search.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.65-75
• /
• 2005

Moving-objects databases should efficiently support database queries that refer to the trajectories and positions of continuously moving objects. To improve the performance of these queries. an efficient indexing scheme for continuously moving objects is required. To my knowledge, range queries on current positions cannot be handled by the 3D R-tree and the TB-tree. In order to handle range queries on current and past positions. I modified the original 3D R-tree to keep the now tags. Most of spatio-temporal index structures suffer from the fact that they cannot efficiently process range queries past positions of moving objects. To address this issue. we propose an access method, called the Tagged Adaptive 3DR-tree (or just TA3DR-tree), which is based on the original 3D R-tree method. The results of our extensive experiments show that the Tagged Adaptive 3DR-tree outperforms the original 3D R-tree and the TB-tree typically by a big margin.

• Journal of the Korean Chemical Society
• /
• v.29 no.5
• /
• pp.516-521
• /
• 1985

Ethylenediamine-triacetatocobalt (III) complexes with an ammine, an ethylene-diamine, and a trimethylenediamine as the unidentate ligand were prepared, and were isolated as only one isomer for each case by the Dowex 50W-X8, cation exchange resin in $H^+$ form. The geometrical isomer of these complexes have been assigned cis-equatorial form in the three possible geometrical isomers from the elemental analysis, pH titration, IR, NMR, and electronic absorption spectrum. It was found that $[CoN_3O_3]$ system of the meridional form with multidentate ligand have the first absorption band of the largely splitting pattern, and that the diamines (ethylenediamine, trimethylenediamine) have coordinated to the central cobalt (III) ion as a unidentate ligand.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.387-398
• /
• 2002

As whole genome sequences of many organisms have been revealed by small-scale genome projects, the intensive research on individual genes and their functions has been performed. However on-memory algorithms are inefficient to analysis of whole genome sequences, since the size of individual whole genome is from several million base pairs to hundreds billion base pairs. In order to effectively manipulate the huge sequence data, it is necessary to use the indexed data structure for external memory. In this paper, we introduce a workbench system for analysis and visualization of whole genome sequence using string B-tree that is suitable for analysis of huge data. This system consists of two parts : analysis query part and visualization part. Query system supports various transactions such as sequence search, k-occurrence, and k-mer analysis. Visualization system helps biological scientist to easily understand whole structure and specificity by many kinds of visualization such as whole genome sequence, annotation, CGR (Chaos Game Representation), k-mer, and RWP (Random Walk Plot). One can find the relations among organisms, predict the genes in a genome, and research on the function of junk DNA using our workbench.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.87-96
• /
• 2006

Selectivity estimation is one of the query optimization techniques. It is difficult for the previous selectivity estimation techniques for moving objects to apply the position change of moving objects to synopsis. Therefore, they result in much error when estimating selectivity for queries, because they are based on the extended spatial synopsis which does not consider the property of the moving objects. In order to reduce the estimation error, the existing techniques should often rebuild the synopsis. Consequently problem occurs, that is, the whole database should be read frequently. In this paper, we proposed a moving object histogram method based on quad tree to develop a selectivity estimation technique for moving object queries. We then analyzed the performance of the proposed method through the implementation and evaluation of the proposed method. Our method can be used in various location management systems such as vehicle location tracking systems, location based services, telematics services, emergency rescue service, etc in which the location information of moving objects changes over time.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.29-43
• /
• 2008

Although RDF ontologies might be expressed in XML tree model, existing methods for protection of XML documents are not suitable for securing RDF ontologies. The graph style and inference feature of RDF demands a new security model development. Driven by this goal, this paper proposes a new query-oriented model for the RDF ontology access control. The proposed model rewrites a user query using a three-layered ontology view. The proposal resolves the problem that the existing approaches should generate inference models depending on inference rules. Accessible ontology concepts and instances which a user can visit are defined as ontology views, and the inference view defined for controling an inference query enables a controlled inference capability for the user. This paper defines the three-layered view and describes algorithms for query rewriting according to the views. An implemented prototype with its system architecture is shown. Finally, the experiment and comparative evaluation result of the proposal and the previous approach is described.

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

Motif databases are used in the function and structure prediction of proteins which appear on new and rapid release of raw data from genome sequencing projects. Recently, the frequency of use about these databases increases continuously. However, existing motif databases were developed and extended independently and were integrated mainly by using a web-based cross-reference, thus these databases have a heterogeneous search result problem, a complex query process problem and a duplicate database entry handling problem. Therefore, in this paper, we suppose physical motif resource integration and describe the integrated search method about a family-based protein prediction for solving above these problems. Finally, we estimate our implementation of the motif integration database and prediction system for predicting protein motifs.