Sciweavers

15 search results - page 1 / 3
» Optimizing The Lazy DFA Approach for XML Stream Processing
Sort
View
ADC
2004
Springer
103views Database» more  ADC 2004»
13 years 10 months ago
Optimizing The Lazy DFA Approach for XML Stream Processing
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...
Danny Z. Chen, Raymond K. Wong
ICDT
2003
ACM
106views Database» more  ICDT 2003»
13 years 9 months ago
Processing XML Streams with Deterministic Automata
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...
Todd J. Green, Gerome Miklau, Makoto Onizuka, Dan ...
ADC
2007
Springer
193views Database» more  ADC 2007»
13 years 10 months ago
Optimizing XPath Queries on Streaming XML Data
XML stream processing has recently become popular for many applications such as selective dissemination of information. Several approaches have been proposed and most of them are ...
Keerati Jittrawong, Raymond K. Wong
SIGMOD
2003
ACM
140views Database» more  SIGMOD 2003»
14 years 4 months ago
Stream Processing of XPath Queries with Predicates
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...
Ashish Kumar Gupta, Dan Suciu
EDBT
2008
ACM
159views Database» more  EDBT 2008»
14 years 4 months ago
Automaton in or out: run-time plan optimization for XML stream processing
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
Hong Su, Elke A. Rundensteiner, Murali Mani