Eager XPath evaluation over XML streams

Authors:
Kazuhito Hagio;Takashi Ohgami;Hideo Bannai;Masayuki Takeda
Affiliations:
Department of Informatics, Kyushu University, Japan;Department of Informatics, Kyushu University, Japan;Department of Informatics, Kyushu University, Japan;Department of Informatics, Kyushu University, Japan
Venue:
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Year:
2012

Citing 6
Cited 0

Efficient algorithms for processing XPath queries

ACM Transactions on Database Systems (TODS)
Efficient algorithms for evaluating xpath over streams

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
SPEX: Streamed and Progressive Evaluation of XPath

IEEE Transactions on Knowledge and Data Engineering
Covering indexes for XML queries: bisimulation - simulation = negation

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Worst-case optimal algorithm for XPath evaluation over XML streams

Journal of Computer and System Sciences
Memory lower bounds for XPath evaluation over XML streams

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the XPath evaluation problem over XML streams. We consider a fragment of XPath called Conjunctive XPath (CXP). We present an algorithm that eagerly evaluates a CXP query Q against a streaming XML data D in O((|Q|+n2)|D|) time and O(|Q|height(D)+n·maxcands(Q,D)) space, where n is the number of location steps in Q and maxcands(Q,D) is the maximum number of nodes of D that can be candidates for answer nodes, at any one instant. The result improves the previous work of Ramanan (2009) which lazily evaluates Q against D in O((|Q|+n·height(D))|D|) time using the same space.