• Journal of KIISE:Databases
• /
• v.28 no.1
• /
• pp.48-56
• /
• 2001

XML은 여러 분야에서 다양한 타입의 데이터를 효과적으로 관리하기 위한 표준으로 사용되고 있다. 이러한 XML의 한 응용으로서 데이터베이스 시스템, 파일 시스템, OLTP시스템, OLAP시스템, 데이터웨어하우징을 위한 ETL 시스템, 데이터마이닝 시스템 등을 포함하는 다양한 타입의 데이터 처리 시스템 사이에서 메타데이터를 교환하기 위하여 XML을 이용하여 메타데이터를 표준화하는 것이다. 본 연구는 MDC(MetaData Coalition)에 제안한 일반적인 데이터 처리 시스템을 위한 메타데이터 교환 스펙인 MDIS(Metadata Interchange Specification)를 따르도록 설계한 관계형 데이터베이스 시스템의 메타데이터 교환을 위한 사양으로서 R-MDIS(MetaData Interchange Specification for RDBs) 모델을 제안하고 이에 따라 표현된 자료를 상호 데이터베이스 시스템 사이에서 교환할 수 있는 Export 함수와 Import 함수를 포함하는 번역기를 개발한다. 이 번역기는 메타데이터의 일관성을 유지하면서도 메타데이터의 양방향 흐름을 지원할 수 있도록 하는 정보를 포함하고 있다. 본 연구는 구체적인 관계형 데이터베이스 시스템에서의 메타데이터 교환을 위한 실제적인 번역기를 구현함으로써 다양한 종류의 데이터 처리 시스템들 사이에서 메타데이터 불일치 문제를 해결할 수 있는 근거를 제시하였다. 둘째, XML을 이용하여 메타데이터 교환 사양을 설정함으로서 구도화된 데이터나 구조화되지 않은 데이터 모두에 대하여 일관된 방법으로 데이터 교환이 가능하도록 하여 효율적인 정보 교환을 할 수 있다는 것을 보여 주었다. 셋째, 본 연구에서 개발한 번역기는 메타데이터 교환에 의해 데이터들을 공유하게 함으로서 효율적으로 관리하지 못하던 데이터들을 효율적으로 사용할 수 있게 함으로서 데이터 관리 문제에 해결책이 될 것이다.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.710-720
• /
• 2004

As XML documents have much richer information than plain texts, we can perform very elaborated, fine-grained search which was difficult in past years. However, as the cost of finer grained element level search is very high, the processing overhead has become a new challenge. We propose an inverted index structure called PIX, which reduces the number of elements processed by partitioning elements according to their match potentiality. We choose a base level and partition elements according to whether they have possibility of having a common ancestor higher than the level. We also propose partition merging technique by which we can get same results as unpartitioned case. Our experimental results show that the index partitioning strategy can reduce processing time considerably.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.441-451
• /
• 2005

HTML is mostly stored in native file systems instead of specialized repositories such as a database. Like HTML, XML, the standard for the exchange and the representation of data in the Internet, is mostly resident on native file systems. However. since XML data is irregular and verbose, the disk space and the network bandwidth are wasted compared to those of regularly structured data. To overcome this inefficiency of XML data, the research on the compression of XML data has been conducted. Among recently proposed XML compression techniques, some techniques do not support querying compressed data, while other techniques which support querying compressed data blindly encode data values using predefined encoding methods without considering the types of data values which necessitates partial decompression for processing range queries. As a result, the query performance on compressed XML data is degraded. Thus, this research proposes an XML compression technique which supports direct and efficient evaluations of queries on compressed XML data. This XML compression technique adopts an encoding method, called dictionary encoding, to encode each tag of XML data and applies proper encoding methods for encoding data values according to the inferred types of data values. Also, through the implementation and the performance evaluation of the XML compression technique proposed in this research, it is shown that the implemented XML compressor efficiently compresses real-life XML data lets and achieves significant improvements on query performance for compressed XML data.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1063-1072
• /
• 2004

In the ASP(Application Service Provider) business, applications using database sometimes require some data from clients' databases. These days such data are extracted from client database using manual database operations as an EXCEL file and the ASP, once receiving this file, transfers it into the application's database using manual database operations. This paper describes how to deal with data transmitting between the client database and ASP database on the web without using database manual operations for data extraction and insertion. We propose a framework which enables to transmit client data in a systematical way, to match different attribute names of each database for sharing same attribute values, and to avoid exposing information about the network path of client database to the ASP. This approach consists of two steps of data processing. The first is extracting data from client database as XML format by using a downloaded client program from ASP site, the second is uploading and storing the XML file into the ASP database. The implemented prototype system shows the suggested data integration paradigm is valid and ASP business needing integration of client database can be activated using it.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.79-88
• /
• 2002

Data on the Internet are usually represented and transfered as XML. the XML data is represented as a tree and therefore, object repositories are well-suited to store and query them due to their modeling power. XML queries are represented as regular path expressions and evaluated by traversing each object of the tree in object repositories. Several indexes are proposed to fast evaluate regular path expressions. However, in some cases they may not cover all possible paths because they require a great amount of disk space. In order to efficiently evaluate the queries in such cases, we propose an optimized traversing which combines the signature method and block traversing. The signature approach shrink the search space by using the signature information attached to each object, which hints the existence of a certain label in the sub-tree. The block traversing reduces disk I/O by early evaluating the reachable objects in a page. We conducted diverse experiments to show that the hybrid approach achieves a better performance than the other naive ones.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.27-40
• /
• 2003

The inverted index widely used in the existing information retrieval field should be extended for XML documents to support containment queries by XML information retrieval systems. In this paper, we consider that there are two methods in storing the inverted index and processing containment queries for XML documents as the previous work suggested: using a RDBMS or using an inverted lift engine. It has two drawbacks to extend the inverted index in the previous work. One is that using a RDBMS is moth worse in the performance than using an inverted list engine. The other is that when containment queries are processed in a RDBMS, there is an increase in the number of a join operation as the path length of a query increases and a join operation always happens between large fables. In this paper. we extend the inverted index in a different way to solve these problems and show the effectiveness of using a RDBMS.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.183-194
• /
• 2004

As XML is a do facto standard for a data exchange language, there have been several researches on efficient processing XML queries. The most important thing to consider when processing XML queries is how efficiently we can process path expressions in queries. Some previous works make results by performing a sequence of join operations on all records corresponding to labels in the path expression. Others works check the existence of paths in the query using an RDBMS's string comparison operator and make results by extracting the records corresponding to the paths. In this paper we suggested a new query planning algorithm based on path containment relationships and two join operators supporting the planning algorithm. The join operators use only the records related to the paths in a query as input data, scan them only once, and generate result data using a pipelining mechanism. By analysis and experiments, we confirmed that our techniques(a new query planning algorithm and two join operators) achieved significantly higher performance than other previous works.

• Journal of Information Technology and Architecture
• /
• v.10 no.1
• /
• pp.123-135
• /
• 2013

This paper presents a two-dimensional grouping index(2DG-index) for efficient processing of XML filtering queries. Recently, many index techniques have been suggested for the efficient processing of structural relationships among the elements in the XML database such as an ancestor- descendant and a parent-child relationship. However, these index techniques focus on simple path queries, and don't consider the path queries that include a condition value for filtering. The 2DG-index is an index structure that deals with the problem of clustering index entries in the twodimensional domain space that consists of a XML path identifier domain and a filtering data value domain. For performance evaluation, we have compared our proposed 2DG-index with the conventional one dimensional index structure such as the data grouping index (DG-index) and the path grouping index (PG-index). As the result of the performance evaluations, we have verified that our proposed 2DG-index can efficiently support the query processing in XML databases according to the query types.

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.235-246
• /
• 2009

As demands intending to treat an access control on a client side that was conventionally controlled at a server are surged. it needs a way to treat query processing in effective and secure manners in an environment that has limited resources. Because the access control having been previously performed was only focused on safety, there was little effort to consider the access control in terms of efficiency. Researches about security including access control are started as the security issues are cropped up in a recent stream environment. This paper proposes a method for efficient and secure query processing of XML data streams like a PDA and a portable terminal at the client that is in limited resources. Specifically, this study suggests (1) an access control processing that possesses small overhead for attaining a secure result in a limited memory and (2) a way to enhance the performance, finding the parts being capable of optimizing in each processing step for offsetting the overhead caused by an addition of the access control processing. Superiority of the new method was analyzed by experiment.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.5
• /
• pp.416-426
• /
• 2005

A B2Bi system needs a message storage subsystem that efficiently logs and searches XML messages which have been sent from orreceived by it. XML database systems and XML enabled relational databases systems are not adequate as a message storage system because of their expensiveness and excessiveness in functionality. Storage schemes that split XML messages into database records are also unacceptable because of either low performance or implementation hardness. In this paper, we propose a storage scheme that can be applied to implement a message storage system based on a relational database system. In this scheme, messages are examined only through the index fields that have been registered for each message types. Therefore, the proposed storage scheme cannot support such a powerful search facility like XQL, but it provides high performance message legging and restricted search facility. There are three alternative database schemas to store the index fields. This paper compares the advantages and disadvantages of the three schemas through experimental tests.