Streamable fragments of forward XPath

Authors:
Olivier Gauwin;Joachim Niehren
Affiliations:
University of Mons;INRIA & LIFL, CNRS, UMR
Venue:
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Year:
2011

Citing 22
Cited 3

Validating streaming XML documents

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Model Checking of Safety Properties

Formal Methods in System Design
Locating Matches of Tree Patterns in Forests

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Buffering in query evaluation over XML streams

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the memory requirements of XPath evaluation over XML streams

Journal of Computer and System Sciences
Visibly pushdown automata for streaming XML

Proceedings of the 16th international conference on World Wide Web
Efficient algorithms for evaluating xpath over streams

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Machine models and lower bounds for query processing

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SPEX: Streamed and Progressive Evaluation of XPath

IEEE Transactions on Knowledge and Data Engineering
Schema-based scheduling of event processors and buffer minimization for queries on structured data streams

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
Evaluating partial tree-pattern queries on XML streams

Proceedings of the 17th ACM conference on Information and knowledge management
Adding nesting structure to words

Journal of the ACM (JACM)
Bounded Delay and Concurrency for Earliest Query Answering

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Worst-case optimal algorithm for XPath evaluation over XML streams

Journal of Computer and System Sciences
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
Memory lower bounds for XPath evaluation over XML streams

Journal of Computer and System Sciences
Streamable fragments of forward XPath

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Consistent query answering: five easy pieces

ICDT'07 Proceedings of the 11th international conference on Database Theory
Tight lower bounds for query processing on streaming and external memory data

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Streamable fragments of forward XPath

CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Early nested word automata for XPath query answering on XML streams

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
High-performance complex event processing over hierarchical data

ACM Transactions on Database Systems (TODS) - Invited papers issue

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a query answering algorithm for a fragment of Forward XPath on XML streams that we obtain by compilation to deterministic nested word automata. Our algorithm is earliest and in polynomial time. This proves the finite streamability of the fragment of Forward XPath with child steps, outermost-descendant steps, label tests, negation, and conjunction (aka filters), under the reasonable assumption that the number of conjunctions is bounded. We also prove that finite streamability fails without this assumption except if P=NP.