38 search results - page 1 / 8 » Evaluating Complex Queries Against XML Streams with Polynomi... |
BNCOD
2004
13 years 6 months ago
2004
ICDE
2003
IEEE
14 years 6 months ago
2003
IEEE
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...
PLANX
2008
13 years 6 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
ICDE
2005
IEEE
14 years 6 months ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...