Abstract

We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a single deterministic pushdown automata, called the XPush Machine from the given XPath filters. We describe a number of optimization techniques to make the lazy XPush machine more efficient, both in terms of space and time. The combination of these optimizations results in high, sustained throughput. For example, if the total number of atomic predicates in the filters is up to 200000, then the throughput is at least 0.5 MB/sec: it increases to 4.5 MB/sec when each filter contains a single predicate. 1.

Citations

449	M.J.: Efficient string matching: An aid to bibliographic search - Aho, Corasick - 1975
272	Efficient filtering of xml documents for selective dissemination of information - Altinel, Franklin
150	Efficient filtering of XML documents with XPath expressions - Chan, Felber, et al.
79	Alternation - Chandra, Kozen, et al. - 1981
22	More efficient bottom-up multi-pattern matching in trees - Cai, Paige, et al. - 1992
2	Tree pattern matching for linear static terms - Chauve - 2002