Early nested word automata for XPath query answering on XML streams

Authors:
Denis Debarbieux;Olivier Gauwin;Joachim Niehren;Tom Sebastian;Mohamed Zergaoui
Affiliations:
Inria Lille, France,LIFL, France;LaBRI, France,University of Bordeaux, France;Inria Lille, France,LIFL, France;Innovimax, France,LIFL, France;Innovimax, France
Venue:
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Year:
2013

Citing 16
Cited 0

Model Checking of Safety Properties

Formal Methods in System Design
Stream processing of XPath queries with predicates

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
SPEX: Streamed and Progressive Evaluation of XPath

IEEE Transactions on Knowledge and Data Engineering
XPath satisfiability in the presence of DTDs

Journal of the ACM (JACM)
Stream firewalling of xml constraints

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
How big must complete XML query languages be?

Proceedings of the 12th International Conference on Database Theory
Adding nesting structure to words

Journal of the ACM (JACM)
Query Automata for Nested Words

MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Efficient and expressive tree filters

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Earliest query answering for deterministic nested word automata

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Queries on Xml streams with bounded delay and concurrency

Information and Computation
Streamable fragments of forward XPath

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
A native and adaptive approach for unified processing of linked streams and linked data

ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
XPathMark: an XPath benchmark for the XMark generated data

XSym'05 Proceedings of the Third international conference on Database and XML Technologies
High-performance complex event processing over XML streams

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data

Quantified Score

Hi-index	0.00

Visualization

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 in a highly efficient manner. We show that this approximation can be made tight in practice for automata obtained from XPath expressions. We have implemented an XPath streaming algorithm based on early nested word automata in the Fxp tool. Fxp outperforms most previous tools in efficiency, while covering more queries of the XPathMark benchmark.