Transforming XPath Queries for Bottom-Up Query Processing

نویسندگان

  • Yoshiharu Ishikawa
  • Takaaki Nagai
  • Hiroyuki Kitagawa
چکیده

The widespreading of XML as a content-description language on the Web requires advanced processing and management techniques for huge XML databases. XPath is a standard language for extracting the specified elements from XML documents, and its efficient support is one of the key issues in the current XML database technology. In this paper, we propose an XPath query transformation method for the efficient query processing. It transforms top-down, navigation-based XPath queries into equivalent bottom-up query plans by using schema information. Based on this technique, we can achieve efficient set-oriented processing of XPath queries with the support of index mechanisms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Processing of XPath Queries Using Indexes

A number of query languages have been proposed in recent times for processing queries on XML and semistructured data. All these query languages make use of regular path expressions to query XML data. To optimize the processing of query paths a number of indexing schemes have also been proposed recently. XPath provides the basis for processing queries on XML data in the form of regular path expr...

متن کامل

Twig2Stack: Bottom-up Processing of Generalized-Tree-Pattern Queries over XML Documents

Tree pattern matching is one of the most fundamental tasks for XML query processing. Holistic twig query processing techniques [4, 16] have been developed to minimize the intermediate results, namely, those root-to-leaf path matches that are not in the final twig results. However, useless path matches cannot be completely avoided, especially when there is a parent-child relationship in the twig...

متن کامل

Indexing XML documents for XPath query processing in external memory

Existing encoding schemes and index structures proposed for XML query processing primarily target the containment relationship, specifically the parent–child and ancestor–descendant relationship. The presence of preceding-sibling and following-sibling location steps in the XPath specification, which is the de facto query language for XML, makes the horizontal navigation, besides the vertical na...

متن کامل

Embedding Xpath Queries into SPARQL Queries

While XPath is an established query language developed by the W3C for XML, SPARQL is a new query language developed by the W3C for RDF data. Comparisons between the data models of XML and RDF and between the query languages XPath and SPARQL are missing. Since XML and XPath are earlier recommendations of the W3C than RDF and SPARQL, currently more XML data and XPath queries are used in applicati...

متن کامل

Simplifying XPath queries for optimization with regard to the elimination of intersect and except operators

XPath is widely used as an XML query language and is embedded in XQuery expressions and in XSLT stylesheets. In this paper, we propose a rule set which logically simplifies XPath queries by using a heuristic method in order to improve the processing time. Furthermore, we show how to substitute the XPath 2.0 intersect and except operators in a given XPath query with computed filter expressions. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002