• Title/Summary/Keyword: XQuery

Search Result 108, Processing Time 0.041 seconds

XQuery Query Rewriting for Query Optimization in Distributed Environments (분산 환경에 질의 최적화를 위한 XQuery 질의 재작성)

  • Park, Jong-Hyun;Kang, Ji-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.3
    • /
    • pp.1-11
    • /
    • 2009
  • XQuery query proposed by W3C is one of the standard query languages for XML data and is widely accepted by many applications. Therefore the studies for efficient Processing of XQuery query have become a topic of critical importance recently and the optimization of XQuery query is one of new issues in these studies. However, previous researches just focus on the optimization techniques for a specific XML data management system and these optimization techniques can not be used under the any XML data management systems. Also, some previous researches use predefined XML data structure information such as XML schema or DTD for the optimization. In the real situation, however applications do not all refer to the structure information for XML data. Therefore, this paper analyzes only a XQuery query and optimize by using itself of the XQuery query. In this paper, we propose 3 kinds of optimization method that considers the characteristic of XQuery query. First method removes the redundant expressions described in XQuery query second method replaces the processing order of operation and clause in XQuery query and third method rewrites the XQuery query based on FOR clause. In case of third method, we consider FOR clause because generally FOR clause generates a loop in XQuery query and the loop often rises to execution frequency of redundant operation. Through a performance evaluation, we show that the processing time for rewritten queries is less than for original queries. also each method in our XQuery query optimizer can be used separately because the each method is independent.

W3C XQuery Update facility on SQL hosts (관계형 테이블을 이용한 W3C XQuery 변경 기능의 지원)

  • Hong, Dong-Kweon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.3
    • /
    • pp.306-310
    • /
    • 2008
  • XQuery is a new recommendation for XML query. As an efforts for extending XQuery capabilities XML insertion and deletion are being studied and its standardization are going on. Initially XML databases are developed simply for XML document management. Now their functions are extending to OLTP. In this paper we are adding updating functions to XQuery processing system that is developed only for XQuery retrievals. We suggest the structure of tables, numbering schemes for hierarchical structures, and the methods for SQL translations for XQuery updates.

Normalization of XQuery Queries for Efficient XML Query Processing (효율적인 XML질의 처리를 위한 XQuery 질의의 정규화)

  • 김서영;이기훈;황규영
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.5
    • /
    • pp.419-433
    • /
    • 2004
  • As XML becomes a standard for data representation, integration, and exchange on the Web, several XML query languages have been proposed. World Wide Web Consortium(W3C) has proposed XQuery as a standard for the XML query language. Like SQL, XQuery allows nested queries. Thus, normalization rules have been proposed to transform nested XQuery queries to semantically equivalent ones that could be executed more efficiently. However, previous normalization rules are applicable only to restricted forms of nested XQuery queries. Specifically, they can not handle FLWR expressions having nested expressions in the where clause. In this paper, we propose normalization rules for XQuery queries by extending those for SQL queries. Our proposed rules can handle FLWR expressions haying nested expressions in every clause. The major contributions of this paper are as follows. First, we classily nesting types of XQuery queries according to the existence of correlation and aggregation. We then propose normalization rules for each nesting type. Second, we propose detailed algorithms that apply the normalization rules to nested XQuery queries.

A Global XQuery Query Processing based on Local XQuery Query Generation (지역 질의 생성기반 전역 XQuery 질의 처리 기법)

  • Park, Jong-Hyun;Park, Won-Ik;Kim, Young-Kuk;Kang, Ji-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.11
    • /
    • pp.11-20
    • /
    • 2010
  • XML view is proposed to integrate between XML data and heterogeneous data over distributed environment and global XML view is used to search distributed heterogeneous data. At this time, standard query language for user is XQuery and the method for processing global XQuery queries over distributed environment is one of the new research topics. One of the basic and simple methods to process distributed SQL queries is that generates local queries for processing a global query and constructs the result of the global query from the results of the local queries. However, the syntax of XQuery differs from SQL because the XQuery contains some special expressions like FOR clauses for querying to semi-structured data, of course, FOR clauses are not used in SQL. Therefore, there are some problems to adopt the method for processing global SQL queries for generating local XQuery queries. This paper defines some problems when generates local XQuery queries for processing global XQuery queries and proposes a method for generating local XQuery queries considered these problems. Also we implement and evaluate a Global XQuery Processor which uses our method.

Analysis of XQuery FLWOR expression to SQL translation (XQuery FLWOR 연산의 SQL 변환 기법 분석)

  • Hong, Dong-Kweon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.2
    • /
    • pp.278-283
    • /
    • 2008
  • As the usefulness of internet is kept changing more productively with web 1.0, web 2.0 usage of XML is also increasing very rapidly. In XML environment the most critical function is the ability of effective retrieval of useful information from XML repository. That makes the W3C XQuery more popular XQuery has very complicated structure as a query language due to the semi_structured nature of XML. FLOWOR, which stand for, let. where, order by, return, is the most commonly used expression in XQuery. In this paper we suggest the methods to handle XQuery FLWOR on relational environments. We also analyze and evaluate our approach to prove its correctness.

Research on supporting the group by clause reflecting XML data characteristics in XQuery (XQuery에서의 XML 데이터 특성을 고려한 group by 지원을 위한 질의 표현 기법에 대한 연구)

  • Lee Min-Soo;Cho Hye-Young;Oh Jung-Sun;Kim Yun-Mi;Song Soo-Kyung
    • The KIPS Transactions:PartD
    • /
    • v.13D no.4 s.107
    • /
    • pp.501-512
    • /
    • 2006
  • XML is the most popular platform-independent data expression which is used to communicate between loosely coupled heterogeneous systems such as B2B Applications or Workflow systems. The powerful query language XQuery has been developed to support diverse needs for querying XML documents. XQuery is designed to configure results from diverse data sources into a uniquely structured query result. Therefore, it became the standard for the XML query language. Although the latest XQuery supports heavy search functions including iterations, the grouping mechanism for data is too primitive and makes the query expression difficult and complex. Therefore, this work is focused on supporting the groupby clause in the query expression to process XQuery grouping. We suggest it to be a more efficient way to process grouping for restructuring and aggregation functions on XML data. We propose an XQuery EBNF that includes the groupby clause and implemented an XQuery processing system with grouping functions based on the eXist Native XML Database.

A Study on Processing XML Documents (XML 문서 처리에 관한 연구)

  • Kim, Tae Gwon
    • Journal of KIISE
    • /
    • v.43 no.4
    • /
    • pp.489-496
    • /
    • 2016
  • XML can effectively express structured or semi-structured data as well as relational databases. XQuery is a query language for retrieving information for such an XML document. In this paper, an XQuery composer is designed and implemented, with an API provided for XQuery processors, and a proper processor is registered. This composer shows query results immediately processed by the processor. As this composer contains a parser for XQuery, it can compose XQuery effectively using a diverse dialog box designed for XQuery grammar. A dialog box is affiliated with a clause region, which is a region that algebra operates from the parsing tree. It can compose path expressions for an XML document easily as it shows an element tree from DTD graphically. Path expressions are composed automatically by marking elements in the structural hierarchy and by specifying the predicate of an element partially.

Estimating Join Selectivity of Global XQuery Queries in Distributed Environments (분산 환경에서 전역 XQuery 질의의 조인 선택치 추정 방법)

  • Park, Jong-Hyun;Kang, Ji-Hoon
    • Journal of KIISE:Databases
    • /
    • v.34 no.6
    • /
    • pp.564-571
    • /
    • 2007
  • One of the methods for integrating XML data in distributed environments is using XML view. User can query toward distributed local XML views by using global XQuery queries in XQuery which is a standard query language for searching XML data. The global XQuery queries naturally contain join operations because of integrating and searching distributed heterogeneous data. Since join operations are generally expensive for processing a query, its processing technique is very important for efficient processing of global XQuery queries. Therefore there are some studies on the efficient processing of join operations and one of these studies is that selects minimum join cost by estimating a join selectivity. In case of SQL, there are already some researches for estimating a join selectivity and join cost of global SQL queries. However we can not apply their methods for estimating the selectivity of join operations in SQL queries into XQuery queries because of the structural difference between relational data and XML data. Therefore this paper proposes a method for estimating a selectivity of join operations in XQuery queries using the information of XML views. Our contribution is three threefold. First, we define the difference point for estimating join selectivity between SQL and XQuery. Second, we estimate join selectivity in XQuery queries by referring XML views. Third, we evaluate our estimating method.

XQuery query Refinement Based on Query Rewriting (질의 재구성 기반의 XQuery 질의 정제)

  • Choi, Seong-Il;Park, Jong-Hyun;Kang, Ji-Hoon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10c
    • /
    • pp.62-65
    • /
    • 2006
  • XML은 웹 상에서 데이터의 표현과 교환을 위한 표준이다. XQuery는 XML 질의를 위한 W3C 표준으로서 XML 문서를 효율적으로 검색하기 위해서 W3C에서 제안한 표준질의어이다. XQuery가 등장하면서, 이를 빠르게 처리하기 위한 연구가 많이 진행 중이며, 이 연구 중 한 분야는 XQuery 질의를 정제하는 것이다. 사용자에 따라 다양하게 작성되는 XQuery 질의들은 정제되어 있지 않을 수 있다. 질의의 불필요한 연산이나 표현을 제거하여 간결하게 만드는 것은 질의를 효율적으로 처리하게 하여 성능을 향상시키는데 도움을 준다. 이에 대한 이전의 연구들은 XML 데이터의 저장구조나 시스템에 의존적인 질의 정제방법을 사용하므로 이들 방법을 일반적인 XQuery 질의 정제로 볼 수는 없다. 그러나 우리의 정제방법은 XQuery 질의를 기반으로 하여 일반적인 상황에서도 질의의 정제가 가능하므로 XQuery를 입력으로 하는 다른 시스템에서 우리의 방법으로 입력 질의를 정제하여 효율적으로 질의를 처리할 수 있다. 본 논문에서는 XQuery 질의를 효율적으로 처리하기 위하여 두가지 정제방법을 제안한다. 첫째는 불필요한 연산이나 표현을 제거하는 방법이고, 둘째는 질의의 순서를 재배치하는 방법이다. 이 방법들을 통하여 질의를 보다 빠르고 효율적으로 처리하도록 한다. 끝으로, 우리는 성능평가를 통하여 우리의 정제방법의 효율성을 입증한다.

  • PDF

An XQuery Engine for MPEG-7 Based Digital Library Systems (MPEG-7 기반 디지털도서관 시스템을 위한 XQuery Engine)

  • 고은정;김철수;강지훈
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04c
    • /
    • pp.546-548
    • /
    • 2003
  • MPEC-7 메타데이타는 이미지의 칼라 히스토그램과 같은 멀티미디어 객체의 속성을 기술할 수 있어서, MPEG-7을 사용하는 멀티미디어 디지털도서관 시스템은 멀티미디어 객체에 대한 내용기반 검색을 가능하게 해준다. MPEC-7 메타데이타는 XML 데이터이며, 이애 대한 질의를 위해서는 XQuery와 같은 XML 데이터를 위한 질의어가 필요하다. 본 논문에서는 MPEG-7 데이터에 대한 XQuery 질의를 처리할 수 있는 XQuery 엔진을 제안한다. 엔진은 XQuery를 입력받아 정보검색을 위한 POT(Primitive Operation Tree)를 생성한다. 우리의 방식은 표준질의어인 XQuery를 처리함으로써 디지털도서관 시스템 사이의 상호 운영성을 확보할 수 있으며, XQuery 엔진과 정보검색기 사이의 표준 인터페이스로 사용할 수 있는 POT를 위한 primitive operation 집합을 정의하였으며, 또한 POT 상에서의 질의 최적화를 수행하여 검색 성능 향상을 도모하였다.

  • PDF