Efficient eager XPath filtering over XML streams

Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (Scopus)

抄録

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.

元の言語英語
ホスト出版物のタイトルProceedings of the Prague Stringology Conference 2011
ページ30-44
ページ数15
出版物ステータス出版済み - 12 1 2011
イベントPrague Stringology Conference 2011, PSC 2011 - Prague, チェコ共和国
継続期間: 8 29 20118 31 2011

出版物シリーズ

名前Proceedings of the Prague Stringology Conference 2011

その他

その他Prague Stringology Conference 2011, PSC 2011
チェコ共和国
Prague
期間8/29/118/31/11

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

フィンガープリント 「Efficient eager XPath filtering over XML streams」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル