Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

Early Nested Word Automata for XPath Query Answering on XML Streams

Denis Debarbieux 1 Olivier Gauwin 2 Joachim Niehren 1 Tom Sebastian 3, 1 Mohamed Zergaoui 3 
1 LINKS - Linking Dynamic Data
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : Algorithms for answering XPath queries on Xml streams have been studied intensively in the last decade. Nevertheless, there still exists no solution with high efficiency and large coverage. In this paper, we introduce early nested word automata in order to approximate earliest query answering algorithms for nested word automata. Our early query answering algorithm is based on stack-and-state sharing for running early nested word automata on all answer candidates with on-the-fly determinization. We prove tight upper complexity bounds on time and space consumption. We have implemented our algorithm in the QuiXPath system and show that it outperforms all previous tools in coverage on the XPathMark benchmark, while obtaining very high time and space efficiency and scaling to huge Xml streams. Furthermore, it turns out that our early query answering algorithm is earliest in practice on most queries from the XPathMark benchmark.
Document type :
Journal articles
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Inria Links Connect in order to contact the contributor
Submitted on : Friday, February 20, 2015 - 5:52:39 PM
Last modification on : Saturday, June 25, 2022 - 10:35:37 AM
Long-term archiving on: : Thursday, May 28, 2015 - 4:20:26 PM


Files produced by the author(s)




Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui. Early Nested Word Automata for XPath Query Answering on XML Streams. Theoretical Computer Science, Elsevier, 2015, pp.100-125. ⟨10.1016/j.tcs.2015.01.017⟩. ⟨hal-00966625⟩



Record views


Files downloads