Efficient eager XPath filtering over XML streams

Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We address the embedding existence problem (often referred to as the filtering problem) over streaming XML data for Conjunctive XPath (CXP). Ramanan (2009) considered Downward CXP, a fragment of CXP that involves downward navigational axes only, and presented a streaming algorithm which solves the problem in O(|P||D|) time using only O(|P|height(D)) bits of space, where |P| and |D| are the sizes of a query P and an XML data D, respectively, and height(D) denotes the tree height of D. Unfortunately, the algorithm is lazy in the sense that it does not necessarily report the answer even after enough information has been gathered from the input XML stream. In this paper, we present an eager streaming algorithm that solves the problem with same time and space complexity. We also show the algorithm can be easily extended to Backward CXP a larger fragment of CXP.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2011
Pages30-44
Number of pages15
Publication statusPublished - Dec 1 2011
EventPrague Stringology Conference 2011, PSC 2011 - Prague, Czech Republic
Duration: Aug 29 2011Aug 31 2011

Publication series

NameProceedings of the Prague Stringology Conference 2011

Other

OtherPrague Stringology Conference 2011, PSC 2011
CountryCzech Republic
CityPrague
Period8/29/118/31/11

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Efficient eager XPath filtering over XML streams'. Together they form a unique fingerprint.

  • Cite this

    Hagio, K., Ohgami, T., Bannai, H., & Takeda, M. (2011). Efficient eager XPath filtering over XML streams. In Proceedings of the Prague Stringology Conference 2011 (pp. 30-44). (Proceedings of the Prague Stringology Conference 2011).