article · 2008

Lightweight XPath Processing of XML Stream with Deterministic Automata

Cited by 0Abstract and details only

Abstract

Several applications based on XML stream processing have recently emerged, such as those for air traffic control and the selective dissemination of information (SDI). Their common need is to process a large number of XPath expressions in continuous XML streams at high throughput. This paper proposes four techniques for XPath expression processing based on Deterministic Finite Automata (DFA) for two purposes: to improve the memory usage efficiency of the automata and to support the processing of branching XPath expressions. The first technique, called n-DFA, clusters the given XPath expressions into n clusters to reduce the number of DFA states. The second, called shared NFA state table, lets the Non-Deterministic Finite Automata (NFA) state set be shared among the DFA states. Our experiments show that memory usage in an 8-DFA can, with the shared NFA state table, be reduced to 1/40th that of the original 1-DFA. The optimized NFA conversion and general XPath expression processing algorithm techniques contribute to the processing of branching XPath expressions efficiently; overall performance is better than is possible with earlier approaches.

Cite this paper

APA 7

(2008). Lightweight XPath Processing of XML Stream with Deterministic Automata.

MLA 9

“Lightweight XPath Processing of XML Stream with Deterministic Automata.” 2008.

Chicago

2008. “Lightweight XPath Processing of XML Stream with Deterministic Automata.”

Harvard

(2008) ‘Lightweight XPath Processing of XML Stream with Deterministic Automata’.

BibTeX

@article{anon2008lightweight,
  title = {{Lightweight XPath Processing of XML Stream with Deterministic Automata}},
  year = {2008}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.