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

As demand of XML documents in the Web increases, Web service applications that manage XML documents as their resource are increasing. The view mechanism for XML data could be considered for effective in query processing in these Web service applications. If the XML query results are maintained as XML materialized views and their relevant XML query is processed using them, the query response time could be reduced. There are two types of processing an in path expression, which is one of the core features of XML query languages, using XML materialized views. One is the type where the complete query result is obtained from the materialized view, and the other is the type where some of the result is obtained from the materialized view and the rest is from the underlying XML documents. In this paper, we investigate the second type. An XML query in this paper is an XML path expression which is one of the core features of XML query languages. We first describe the storage structures of the XML materialized views derived from the underlying XML documents in the XML repository. Then, we propose the algorithms to decompose a given XML query into the subquery against the materialized view and the subquery against the underlying XML documents, and to integrate the results of these subqueries. Through performance evaluation, we figure out the condition under which our XML query decomposition using materialized views is more effective than the conventional processing.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.452-472
• /
• 2005

We propose XIR-Branching, a novel method for processing partial match queries on heterogeneous XML documents using information retrieval(IR) techniques and novel instance join techniques. A partial match query is defined as the one having the descendent-or-self axis '//' in its path expression. In its general form, a partial match query has branch predicates forming branching paths. The objective of XIR-Branching is to efficiently support this type of queries for large-scale documents of heterogeneous schemas. XIR-Branching has its basis on the conventional schema-level methods using relational tables(e.g., XRel, XParent, XIR-Linear[21]) and significantly improves their efficiency and scalability using two techniques: an inverted index technique and a novel prefix match join. The former supports linear path expressions as the method used in XIR-Linear[21]. The latter supports branching path expressions, and allows for finding the result nodes more efficiently than containment joins used in the conventional methods. XIR-Linear shows the efficiency for linear path expressions, but does not handle branching path expressions. However, we have to handle branching path expressions for querying more in detail and general. The paper presents a novel method for handling branching path expressions. XIR-Branching reduces a candidate set for a query as a schema-level method and then, efficiently finds a final result set by using a novel prefix match join as an instance-level method. We compare the efficiency and scalability of XIR-Branching with those of XRel and XParent using XML documents crawled from the Internet. The results show that XIR-Branching is more efficient than both XRel and XParent by several orders of magnitude for linear path expressions, and by several factors for branching path expressions.

• Journal of Digital Contents Society
• /
• v.9 no.2
• /
• pp.285-293
• /
• 2008

In Semantic Web, metadata and ontology for representing semantics and conceptual relationships of information resources are essential factors. RDF and RDF Schema are W3C standard models for describing metadata and ontology. Therefore, many studies to store and retrieve RDF and RDF Schema documents are required. In this paper, we focus on some results of analyzing available query patterns considering both RDF and RDF Schema and classify queries on RDF and RDF Schema into the three patterns. RDF and RDF Schema can be represented as graph models. So, we proposed some strategies to store and retrieve using the graph models of RDF and RDF Schema. We can retrieve entities that can be arrived from a certain class or property in RDF and RDF Schema without a loss of performance on account of multiple joins with tables.

• 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.

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

XML 데이터 사용의 증가와 그 응용분야가 다양해짐에 따라 무선 방송 환경에서 효율적으로 XML 데이터를 전송하기 위한 기법이 요구된다. 본 논문에서는 무선으로 방송되는 XML 스트림에 대하여 복합 XPath 표현식으로 구성되는 질의를 처리하기 위한 기법을 제안한다. XML 스트림은 기존의 반구조적인 데이터의 경로요약 기법을 활용하여 생성한다. 성능평가를 통하여 제안하는 기법이 복합 XPath 표현식이 포함된 질의에 대해서도 에너지 효율적임을 보인다.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.157-164
• /
• 2006

Since XML is emerging as the de facto standard for exchanging and representation of data on the web, the amount of XML data has rapidly increased. Thus, the need for effective store and retrieval of U data has arisen. Since the existing techniques such as XRel which is an XML storage and management technique using RDBMS simply record the existing all label paths, diverse classes of label path expressions could not be efficiently supported. In this paper, we present a technique which supports storage and retrieval for XML data using RDBMS efficiently compared with the existing approaches. Since the proposed technique keeps the XML path index on the relational database and replace label paths with path identifiers, diverse XML queries can be evaluated compared with existing approaches. Also, the proposed technique does not require the modification of the relational database engine and consumes the disk space less. Our experimental result demonstrates the better query performance compared with existing techniques.

• 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 the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.31-41
• /
• 2009

In the Semantic Web, it is possible to provide intelligent information retrieval and automated web services by defining a concept of information resource and representing a semantic relation between resources with meta data and ontology. It is very important to manage semantic data such as ontology and meta data efficiently for implementing essential functions of the Semantic Web. Thus we propose an index structure to support more accurate search results and efficient query processing by considering semantic and structural features of the semantic data. Especially we use a graph data model to express semantic and structural features of the semantic data and process various type of queries by using graph model based path expressions. In this paper the proposed index aims to distinguish our approach from earlier studies and involve the concept of the Semantic Web in its entirety by querying on primarily extracted structural path information and secondary extracted one through semantic inferences with ontology. In the experiments, we show that our approach is more accurate and efficient than the previous approaches and can be applicable to various applications in the Semantic Web.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.19-24
• /
• 2007

웹 리소스에 대한 메타 데이타 표현을 위해 RDF가 표준안으로 제정됨에 따라 RDF 데이타 저장 및 질의 처리 등의 연구가 많이 진행되어 왔다. 전통적인 저장 시스템을 기반으로 하는 저장 구조는 단순한 트리플 패턴 기반의 질의 처리에는 효율적이다. 그러나 여러 개의 트리플 패턴들이 결합된 질의 즉, 경로 기반의 질의 처리는 많은 조인 연산이 요구된다. 한편, 경로 질의의 효율적인 처리를 위해 접미사 배열을 응용한 인덱싱 기법이 제안되었다. 그러나 이 연구에서는 부분 경로식을 포함한 단순 경로 기반 질의 처리의 성능이 향상됨을 보여주었으나 다양한 경로 질의 유형에 대한 처리는 고려하지 않았다. 본 논문에서는 접미사 배열을 응용한 인덱싱 기법을 기반으로 한 경로 기반의 RDF 질의 처리 방안을 기술 한다. 특히, 단순 경로 질의처리 이외에 다양한 질의 유형의 처리를 위한 방안들을 예제를 통해 설명한다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 1986.07a
• /
• pp.131-145
• /
• 1986

흐름수역에서 연직상향으로 방류되는 평면부력\ulcorner의 거동이 연속방정식, 운동량방정식 및 추적물수송식의 기본방정식에 의하여 수치적으로 해석된다. 난류확산에는 Prandtld의 혼합거리이론을 도입한 난류수송모형이 이용된다. 수치해 과정은 기본방정식을 유함수(stream function)식, 와도수송(vorticity transport)식으로 변환한 후, \ulcorner방류속도와, 방류구폭 등으로 표현되는 변수와 흐름을 지배하는 무차원 매개변수를 도입하여 무차원 형태로 표현하는 부분과 successive under-relaxation과 Gauss-Seidel반복법으로 수행하는 부분으로 이루어진다. 적절한 relaxation 계수를 선정하므로써 안정되고 수렴성이 좋은 계산이 수행된다. \ulcorner방류 속도와 가로흐름 속도의 비가 속도비(Velocity ratio)로 정의되며 속도비가 8 - 15의 범위에서 부력\ulcorner으로 인한 주변흐름수역의 속도변화 온도상승범위, 흐름상태(유선) 및 와도가 조사되었으며 \ulcorner의 경로에 대하여 속도비와 방류밀도후르드수의 영향이 또한 조사되었다. \ulcorner중심선의 속도와 온도변화, 국부밀도후르드수의 변화가 구해지며 퍼짐율(dispersion ratio), 확산비(spreading rate)가 방류밀도후르드수, 국부밀도후르드수 및 방류구로부터의 경로의 항으로 해석되었다. 또한 속도와 온도 분포에 상사(similarity)가 존재함이 밝혀졌으며 본 연구와 같은 조건의 범위에서는 Gaussian분포를 이용한 적분형해석(intergal type analysis)이 가능한 것으로 사료된다.