Evaluating partial tree-pattern queries on XML streams

Document Type

Conference Proceeding

Publication Date

12-1-2008

Abstract

The streaming evaluation is a popular way of evaluating queries on XML documents. Besides its many advantages, it is also the only option for a number of important XML applications. Unfortunately, existing algorithms focus almost exclusively on tree-pattern queries (TPQs). Requirements for flexible querying of XML data have motivated recently the introduction of query languages that are more general and flexible than TPQs. We consider a partial tree-pattern query (PTPQ) language which generalizes and strictly contains TPQs. PTPQs can express a fragment of XPath which comprises reverse axes and the node identity equality (is) operator, in addition to forward axes, wildcards and predicates. We outline an original streaming algorithm for PTPQs. Our algorithm is the first one to support the streaming evaluation of such a broad fragment of XPath.

Identifier

70349236006 (Scopus)

ISBN

[9781595939913]

Publication Title

International Conference on Information and Knowledge Management Proceedings

External Full Text Location

https://doi.org/10.1145/1458082.1458305

First Page

1409

Last Page

1410

This document is currently not available here.

Share

COinS