• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.449-457
• /
• 2001

As XML has become an emerging standard for information exchange on the World Wide Web, it has gained attention in database communities to extract information from XML seen as a database model. XML queries are based on regular path queries, which find objects reachable by given regular expressions. To answer many kinds of user queries, it is necessary to evaluate queries that have multiple regular path expressions. However, previous work such as query rewriting and query optimization in the frame work of semistructured data has dealt with a single regular expression. For queries that have multiple regular expressions we suggest a two phase optimizing technique: 1. query rewriting using views by finding the mappings from the view's body to the query's body and 2. for rewritten queries, evaluating each query conjunct and combining them. We show that our rewriting algorithm is sound and our query evaluation technique is more efficient than the previous work on optimizing semistructured queries.

• Journal of KIISE:Databases
• /
• v.34 no.3
• /
• pp.206-216
• /
• 2007

With respect to the Semantic Web proposed to overcome the limitation of the Web, OWL has been recommended as the ontology language used to give a well-defined meaning to diverse data. OWL is the representative ontology language suggested by W3C. An efficient retrieval of OWL data requires a well-constructed storage schema. In this paper, we propose a storage schema construction technique which supports more efficient query processing. A retrieval technique corresponding to the proposed storage schema is also introduced. OWL data includes inheritance information of classes and properties. When OWL data is extracted, hierarchy information should be considered. For this reason, an additional XML document is created to preserve hierarchy information and stored in an XML database system. An existing numbering scheme is utilized to extract ancestor/descendent relationships, and order information of nodes is added as attribute values of elements in an XML document. Thus, it is possible to retrieve subclasses and subproperties fast and easily. The improved query performance from experiments shows the effectiveness of the proposed storage schema construction and retrieval method.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.540-552
• /
• 2004

We propose XIR-Linear, a novel method for processing partial match queries on large-scale heterogeneous XML documents using information retrieval (IR) techniques. XPath queries are written in path expressions on a tree structure representing an XML document. An XPath query in its major form is a partial match query. The objective of XIR-Linear is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Linear has its basis on the schema-level methods using relational tables and drastically improves their efficiency and scalability using an inverted index technique. The method indexes the labels in label paths as key words in texts, and allows for finding the label paths that match the queries far more efficiently than string match used in conventional methods. We demonstrate the efficiency and scalability of XIR-Linear by comparing it with XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Linear is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions as the number of XML documents increases.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.754-765
• /
• 2006

In XML keyword search, a search result is defined as a set of the smallest elements (i.e., least common ancestors) containing all query keywords and a granularity of indexing is an XML element instead of a document. Under the conventional index structure, all least common ancestors produced by the combination of the elements, each of which contains a query keyword, are considered as a search result. In this paper, to avoid unnecessary operations of producing the least common ancestors and reduce query process time, we describe a way to construct a partitioned index composed of several partitions and produce a search result by merging those partitions if necessary. When a search result is restricted to be composed of the least common ancestors whose depths are higher than a given minimum depth, under the proposed partitioned index structure, search systems can reduce the query process time by considering only combinations of the elements belonging to the same partition. Even though the minimum depth is not given or unknown, search systems can obtain a search result with the partitioned index, which requires the same query process time to obtain the search result with non-partitioned index. Our experiment was conducted with the XML documents provided by the DBLP site and INEX2003, and the partitioned index could reduce a substantial amount of query processing time when the minimum depth is given.

• Genomics & Informatics
• /
• v.7 no.3
• /
• pp.168-170
• /
• 2009

The explosion in biological data resulting from high-throughput experiments requires new software tools to manipulate and display pathways in a way that can integrate disparate sources of information. A visual Java-based CAD tool for drawing and annotating biological pathways with semiautomatic image-processing features is described in this paper. The result of the image-editing process is an XML file for the appropriate links. This tool integrates the pathway images and XML file sources. The system has facilities for linking graphical objects to external databases and is capable of reproducing existing visual representations of pathway maps.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.1132-1141
• /
• 2005

We must have a schema conflict resolution method for integrating local schema on content integration and management system. But The Past method is inconsistent and depends on local and global databases. In this paper, we propose the management method of schema confilct using XML that can represent and interchange the structual information of schema.

• Journal of Internet Computing and Services
• /
• v.3 no.3
• /
• pp.31-38
• /
• 2002

A method of DID generating step is suggested for applying the XML technology to the information data extracted from the Legacy databases. The IDREF-ID attribute reference modeling is used for representing the complex relationship between tables and excluding the prearranged step of ID insertion. ID Insertion procedure is performed in parallel with investigating the relationship between the tables and the frequent search direction between the table data. As a result, ID insertion procedure can be performed simultaneously with understanding of the IDREF-ID relationship between tables, and DID are also generated.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.593-595
• /
• 2003

TV-Anytime은 차세대 디지털 방송을 위한 메타데이타 표준으로 XML 형식으로 기술된다. TV-Anytime 메타데이타는 그 특성상 단일 스키마를 따르며, 규모에 있어서 대용량이다. 그러므로 데이터베이스를 이용하여 메타데이타를 저장하고 관리할 필요가 있다. 본 논문에서는 대용량 TV-Anytime 메타데이타를, 데이터베이스를 이용하여 저장하고 관리하기 위한 저장 엔진을 제안한다. 단일 스키마에 기반을 두고 있다는 점을 고려하여 TV-Anytime 메타데이타의 구조에 적합한 데이터베이스 스키마를 설계하였다. 문서 재조합을 효율적으로 할 수 있도록 노드 번호를 위하여 Dewey 방법을 사용하였으며, 조인 연산을 줄이기 위하여 Path 테이블을 두었다. 저장 엔진은 TV-Anytime 관리 시스템에서 XQuery 엔진과 같은 XML 질의처리기와 연동될 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.704-706
• /
• 2003

본 논문에서는 3차원 그래픽 데이터베이스를 위한 효과적인 질의 처리 시스템을 제안한다. 이 질의 처리 시스템은 3차원 그래픽 객체나 3차원 이미지 객체(이하 3D 객체)에 대한 모양 특징 기반(feature-based) 질의를 지원한다. 제안하는 시스템은 3D 객체 에 대한 특징 중 모양 모양에 초점을 맞춘다. 객체간의 유시도 검색을 위해 객체의 모양 특징은 단순화되고 추상화 되어 사용된다. 3D 객체 데이타베이스 구성을 위해 XML을 확장한 3DGML 시스템을 이용하고 질의 처리 언어로는 XML-QL을 이용한다. 본 논문에서 제안하는 질의 처리 시스템은 3D 객체를 포함한 멀티미디어 데이터의 효율적인 검색에 활용될 수 있으며 다양한 그래픽 응용 분이 등에서 활용될 수 있을 것이다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.370-373
• /
• 2004

We must have management method of schema conflict for integrating local schema on content integration and management system. But The past method is inconsistent and depends on local and global databases. In this paper, we propose the management method of schema confilct using XML that can represent and interchange the structual information of schema