11 search results - page 1 / 3 » Processing XML Streams with Deterministic Automata |
ADC
2004
Springer
13 years 10 months ago
2004
Springer
Lazy DFA (Deterministic Finite Automata) approach has been recently proposed to for efficient XML stream data processing. This paper discusses the drawbacks of the approach, sugge...
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
WWW
2007
ACM
14 years 5 months ago
2007
ACM
We propose the study of visibly pushdown automata (Vpa) for processing XML documents. Vpas are pushdown automata where the input determines the stack operation, and XML documents ...
SIGMOD
2003
ACM
14 years 4 months ago
2003
ACM
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 sin...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de�...