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| + n 2)|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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. ACM TODS 30(2), 444–491 (2005)
Gou, G., Chirkova, R.: Efficient algorithms for evaluating XPath over streams. In: SIGMOD 2007, pp. 269–280 (2007)
Hagio, K., Ohgami, T., Bannai, H., Takeda, M.: Efficient eager XPath filtering over XML streams. In: PSC 2011, pp. 30–44 (2011)
Kleene, S.: Introduction to Metamathematics. North-Holland, Amsterdam (1952)
Olteanu, D.: SPEX: Streamed and progressive evaluation of XPath. IEEE Transactions on Knowledge and Data Engineering 19(7), 934–949 (2007)
Ramanan, P.: Covering indexes for XML queries: Bisimulation - simulation = negation. In: VLDB 2003, pp. 165–176 (2003)
Ramanan, P.: Worst-case optimal algorithm for XPath evaluation over XML streams. J. Comput. Syst. Sci. 75(8), 465–485 (2009)
Ramanan, P.: Memory lower bounds for XPath evaluation over XML streams. J. Comput. Syst. Sci. 77(6), 1120–1140 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hagio, K., Ohgami, T., Bannai, H., Takeda, M. (2012). Eager XPath Evaluation over XML Streams. In: Calderón-Benavides, L., González-Caro, C., Chávez, E., Ziviani, N. (eds) String Processing and Information Retrieval. SPIRE 2012. Lecture Notes in Computer Science, vol 7608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34109-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-34109-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34108-3
Online ISBN: 978-3-642-34109-0
eBook Packages: Computer ScienceComputer Science (R0)