• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.1-10
• /
• 2006

This paper introduces the development XPERT(XML Query Processing Engine using Relational Technologies) which is based on relational model. In our system we have used a decomposed approach to store XML files in relational tables. XML queries are translated to SQLs according to the table schema, and then they are sent to the relational DBMS to get the results back. Our translation scheme produces AST(Abstract Syntax Tree) by analyzing XQuery expressions at first. And on traversing AST proper SQLs are generated. Translated SQLs can reduce the number of joins by using path information and utilize dewey number to preserve document originated orderings among compoments in XML. In addition we propose the efficient algorithms of XPath and XQuery translation. And finally we show the implementation of our prototype system for the functional evaluations.

• Proceedings of the KSPS conference
• /
• 2002.11a
• /
• pp.119-122
• /
• 2002

This paper focuses on building up a database of commercial stocks using XML syntax and looks into a way of building up a system with the combination of XML and XSLT that provides connectivity to client-server databases through vocal means. The use of XSLT has several advantages. Most importantly, it can transform a type of data into different formats. A vocal interface minimizes some space and time limits imposed on users outside premises when they need an instant connection to their database. In this fashion, the users can check information on stock lists without being pressurized by certain limits. PC, PDAs and cellular phones are some examples of mobile connection. The use of VoiceXML creates vocal applications. In VoiceXML servies, users can gain immediate access to data upon the input of their voices and the DTMF signals of the telephone.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2001.08a
• /
• pp.125-130
• /
• 2001

정보 저장 검색 기술의 발달로 여러 개의 데이터베이스를 한꺼번에 검색할 수 있는 분산통합검색 시스템에 관심이 증가하고 있다. 그러나 데이터베이스의 종류 및 검색방식이 다양하기 때문에 분산통합검색 시스템의 구축에는 통합검색의 확장성과 데이터베이스간의 독립 운영성이 떨어지는 문제가 있다. 따라서 본 고에서는 이러한 문제점 해결을 위해 기존 데이터베이스들의 질의 구조를 분석해서 질의 구조의 핵심 요소들과 관련 요소들을 추출한 후, XML을 사용하여 대부분의 데이터베이스의 질의어를 포괄할 수 있는 질의어 Meta Format을 설계한다. 이렇게 작성한 표준화된 XML 질의어 Meta Format(DTD)은 분산통합검색에 적용되어 분산통합검색 시스템과 지역 데이터베이스들간의 독립 운영성 및 확장성을 증대시킬 전망이다.

• Proceedings of the KSPS conference
• /
• 2005.11a
• /
• pp.211-214
• /
• 2005

본고에서는 산업용 음성 DB를 위한 XML 기반 메타데이터의 표준화에 대한 현재 상황과 표준화 활동에 대하여 소개한다. 산업용 음성 DB는 구축에 많은 시간과 비용을 요구하며, 양질의 음성 처리 시스템 (인식/합성/인증)의 개발을 위해서는 가능한 많은 양의 음성 데이터가 필요하다. 산업용 음성 DB 메타데이터 표준화는 서로 다른 기관에서 구축한 음성 DB의 공유와 재사용을 원활히 하기 위하여, 2004년 9월부터 요구사항 분석을 시작하여, 2005년 3월 초안이 완성되었다. 본 표준안은 음성 DB 메타데이터의 구조를 XML 기반으로 정의한 것이며, 음성 파일 이름, 화자 식별자, 음소 기호와 같은 구조 외의 표준화 대상에 대해서는 다루지 않는다. 이미 ETRI와 SiTEC [5]에서 XML 기반의 메타데이터 구조와 내용 표준안을 제안한 바 있으나. [5]에서 제안한 구조는 평면 구조를 취하고 있어 내용의 중복성등의 단점이 있어, 이를 보완하여 음성 DB 데이터 모델을 객체지향 방식으로 설계하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.10-12
• /
• 2004

Nowadays, with the rapid emergence of XML as a standard for data exchange over the Internet had led to considerable interest In the problem of data management requirements such as the need to store and query XML documents in which the location path languages Xpath is of particular important for XML application since it is a core component of many XML processing standards such as XSLT or XQuery, This parer gives a brief overview about method and design by applying a new spatial-based indexing method namely Xp-free that used for supporting Xpath. Spatial indexing technique has been proved its capacity on searching in large databases. Based on accelerating a node using planar as combined with the numbering schema, we devise efficiently derivative algorithms, which are simple, but useful. Besides that, it also allows to trace all Its relative nodes of context node In a manner supporting queries natural to the types especially Xpath queries with predicates.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11c
• /
• pp.1785-1788
• /
• 2002

웹상의 데이터베이스 간의 서로 다른 속성 이름이 동일한 속성 값을 가진 경우에, 속성값의 전송이 필요한 경우가 있다. 본 논문은 이를 위해 XSL 스타일시트를 자동 생성하여 이용하며, XSL 스타일시트의 생성은 규칙 기반의 지능형 방법을 이용한다. 이 방법을 통하여 서로 다른 속성 이름을 갖는 다양한 데이터베이스 간의 데이터 전송이 유연하게 처리될 수 있다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.3
• /
• pp.430-433
• /
• 2007

There have been several researches to manipulate XML Queries efficiently since XML has been accepted in many areas. Among the many of the researches majority of them adopt relational databases as underlying systems because relational model which is used the most widely for managing large data efficiently. In this paper we develop XQuery to SQL Translation Algorithms called XSTAR that can efficiently handle XPath, XQuery FLWORs with nested iteration expressions, element constructors and keywords retrieval on relational database as well as constructing XML fragments from the transformed SQL results. The entire algorithms mentioned in XSTAR have been implemented as the XQuery processor engine in XML management system, XPERT, and we can test and confirm it's prototype from "http ://dblab.kmu.ac.kr/project.jsp".

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.331-339
• /
• 2004

XML has got to be a new standard for data representation and exchanging by its many good points, and the core part of many new researches and emerging technologies. However, the self-describing characteristic, which is one of XML's good points, caused the spreading of XML documents with different structures, and so the need of the research for the effective XML-document search has been proposed. This paper is for the analysis of the problem in BitCube, which is a bitmap indexing that shows high performance grounded on its fast retrieval. In addition, to resolve the problem of BitCube, we did design and implement xPlaneb(XML Plane Web) which it a new 3-dimensional bitmap indexing made of linked lists. We propose an effective information retrieval technique by replacing BitCube operations with new ones and reconstructing 3-dimensional array index of BitCube with effective nodes. Performance evaluation shows that the proposed technique is better than BitCube, as the amount of document increases, in terms of memory consumptions and operation speed.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.727-740
• /
• 2006

Schema matching is important as a prerequisite to the transformation of XML documents. This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: preliminary matching relationships between leaf nodes in the two XML schemas are computed based on proposed ontology and leaf node similarity, and final matchings are extracted based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method is superior to previous works, resulting in a precision of 97% and a recall of 83 % on the average. Furthermore, the dynamic ontology increased by 9 percent overall.

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.180-188
• /
• 2009

Recently, the needs for an efficient and secure access control method of dynamic XML data in a ubiquitous data streams environment have become an active research area. In this paper, we proposed an improved role-based prime number labeling scheme for an efficient and secure access control labeling method in dynamic XML data streams. And we point out the limitations of existing access control and labeling schemes for XML data assuming that documents are frequently updated. The improved labeling method where labels are encoded ancestor-descendant and sibling relationships between nodes but need not to be regenerated when the document is updated. Our improved role-based prime number labeling scheme supports an infinite number of updates and guarantees the arbitrary nodes insertion at arbitrary position of the XML tree without label collisions. Also we implemented an efficient access control using a role-based prime number labeling. Finally, we have shown that our approach is an efficient and secure through experiments.