• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.103-105
• /
• 2004

최근 바이오 인포매틱스 분야의 발전에 따라 방대한 양의 유전체 데이터에 대한 연구가 진행되고 있으며, 이러한 데이터를 효율적으로 다루기 위해 다양한 형태의 파일과 데이터베이스들이 사용되고 있다. 하지만 표준화의 미비로 인하여 데이터의 관리 및 변환에 어려움이 많다. 따라서 이 논문에서는 시퀀싱을 통해 생성된 유전체 및 단백질 서열 데이터의 통합 저장 관리를 위해 서열 정보의 편집, 저장 및 검색과 서열 파일 포맷 변환을 수행하는 서열 정보관리 시스템의 구현을 목적으로 한다. 이러한 요구사항을 만족시키기 위해 바이오 인포메틱스 데이터를 다루기 위한 표준으로 BSML(Bioinformatic Sequence Markup Language)을 채택하고 이질적 플랫파일들은 DTD를 기반으로 BSML 스키마로 통합 및 저장한다. 그리고 객체 관계 데이터베이스 특성을 적용하여 XML 문서를 보다 쉽게 저장 관리하고 범위 또는 구조적 질의에 효율적인 XPath 질의 처리를 위한 시스템을 개발하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.109-111
• /
• 2003

본 논문에서는 질의응답 시스템에서 질의에 포함된 언어 정보와 검색 대상 문장 사이의 의미 연관성을 참조하여 정확한 결과를 추출 가능하도록 하는 온톨로지의 자동 구축 방법을 제시한다. 검색 대상 문장은 웹에서의 활용과 표준화를 위하여 단어 태그, 품사 정보 및 파싱 구조를 갖는 XML 문서로 변환하고, 이 구조를 이용한 연관성 분석을 위해 의미망을 갖는 온톨로지를 자동으로 생성할 수 있도록 하였다. 온톨로지에서 의미 연관성을 결정하는데 중요하게 활용되는 개념으로써는 동사의 행위, 명사절 그룹 매치, 복합명사 선별, 고유명사 매치, 품사 태깅 등이 있다. 제안한 방법의 성능은 NIST TREC-10의 질의 응답문을 사용해서 단어 패턴 매치 방법과 비교 분석하였으며, 본 논문에서 제안한 방식이 재현율과 정확율 측면에서 우수한 성능을 나타냄을 입증하였다.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.601-616
• /
• 2004

Information retrieval systems for structured documents provide multiple levels of retrieval capability by supporting structure-based queries. In order to process structure-based queries for structured documents, information for structural nesting relationship between elements and for element sequence must be maintained. This paper presents four index structures that can process various query types about structures such as structural relationships between elements or element occurrence order. The proposed algorithms are based on the concept of Global Document Instance Tree.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.737-748
• /
• 2003

With the popularity of digital music contents, querying and retrieving music contents efficiently from database has become essential. In this paper, we propose a Fast Melody Finder (FMF) that can retrieve melodies fast and efficiently from music database using frequently queried tunes. This scheme is based on the observation that users have a tendency to memorize and query a small number of melody segments, and indexing such segments enables fast retrieval. To handle those tunes, FMF transcribes all the acoustic and common music notational inputs into a specific string such as UDR and LSR. We have implemented a prototype system and showed on its performance through various experiments.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.19-30
• /
• 2009

The service that has recently come into the spotlight utilizes the map to first approach the map and then provide various mash-up formed results through the interface. This service can provide precise information to the users but the map is barely reusable. The sketch-map system of this paper, unlike the existing large map system, uses the method of presenting the specific spot and route in XML document and then clustering among sketch-maps. The map service system is designed to show the optimum route to the destination in a simple outline map. It is done by renovating the spot presented by the map into optimum contents. This service system, through the process of analyzing, splitting and clustering of the sketch-map's XML document input, creates a valid form of a sketch-map. It uses the LCS(Longest Common Subsequence) algorithm for splitting and merging sketch-map in the process of query. In addition, the simulation of this system's expected effects is provided. It shows how the maps that share information and knowledge assemble to form a large map and thus presents the system's ability and role as a new research portal.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.145-156
• /
• 2007

Recently, the needs for effective real time change detection algorithms for XML/HTML documents and increased in such fields as the detection of defacement attacks to web documents, the version management, and so on. Especially, those applications of real time change detection for large number of XML/HTML documents require fast heuristic algorithms to be used in real time environment, instead of algorithms which compute minimal cost-edit scripts. Existing heuristic algorithms are fast in execution time, but do not provide satisfactory edit script. In this paper, we present existing algorithms XyDiff and X-tree Diff, analyze their problems and propose algorithm X-tree Diff which improve problems in existing ones. X-tree Diff+ has similar performance in execution time with existing algorithms, but it improves matching ratio between nodes from two documents by refining matching process based on the notion of efficiency of matching.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1771-1780
• /
• 2007

The necessity of Information integration has emphasized by advancement of internet and change of enterprise environment. In enterprises, it usually integrates the multi-database constructing by M&A. For this integration of information it must guarantee interpretation and integration which is stabilized with solving heterogeneous characteristic problem. In this paper, we propose the method that change the global XML query to local XML query for interpretation. It is based on XMDR(eXtended Meta-Data Registry) which expresses the connection between the standard and the local for solve the interoperability problem in heterogeneous environment. Thus, we propose the legacy model that can search and modify by one Query with creating global XML Query by XMDR. and for his, we use the 2PC technique which is the distributed transaction control technique of existing.

• Spatial Information Research
• /
• v.20 no.3
• /
• pp.95-106
• /
• 2012

Recently, with increase and development of the wireless access network area, u-GIS Service is supported in various fields. Especially, spatio-temporal data is used in the mobile environment for the u-GIS service. However, there is no standard for the spatio-temporal data used in different spaces, spatio-temporal data processing technology is necessary to makes interoperability among mobile u-GIS services. Furthermore, it is also necessary to develop the system of gathering, storing, and managing the spatio-temporal data in consideration of small capacity and low performance of mobile devices. Therefore, in this paper, we designed and implemented a spatio-temporal query processing system based on GML to manage spatio-temporal data efficiently in the mobile environment. The spatio-temporal query processing system based on GML can offer a structured storage method which maps a GML schema to a storage table and a binary XML storage method which uses the Fast Infoset technique, so as to support interoperability that is an important feature of GML and increase storage efficiency. we can also provide spatio-temporal operators for rapid query processing of spatio-temporal data of GML documents. In addition, we proved that this system can be utilized for the u-GIS service to implement a virtual scenario.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.3
• /
• pp.15-23
• /
• 2008

This paper proposes a CIB framework implementing a ubiquitous smart space. In a ubiquitous smart space, a ubiquitous mobile device recognizes surrounding context, and infers the situation and provides services to users. Ubiquitous mobile devices have a RDF store to manage resources and relevant information efficiently on CIB framework. This store space is flexible on the operations such as addition, modification, deletion of information and response to query by SPARQL. In addition, it provides local information to other ubiquitous mobile devices in the from of XML and stores resource information from other ubiquitous mobile devices into local ubiquitous mobile device for the purpose of discovering external resources.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.971-980
• /
• 2002

As the importance of knowledge management is being recognized, there is a significant amount of increase for interest in data warehousing. On-Line Analytical Processing (OLAP) systems can effectively make use of data warehouses. Although there are many commercial OLAP products, they have been developed without any kind of standard resulting in poor data exchange and difficulty in interfacing among the OLAP products. In this paper we propose an OLAP metadata interchange model that can be used among different OLAP products and have implemented an OLAP metadata interchange system that can interchange the cubes created from the metadata. XML is used for the OLAP metadata model and the user interface is Web-based, which makes it easier to interchange metadata among different OLAP products. Users can experience the different analysis environments of different products without the need to learn the complex cube creation process for each product. By extending this research to design a common query language that can be used among OLAP products, OLAP products should be able to more easily talk to one another.