38 search results - page 1 / 8 » Evaluating Complex Queries Against XML Streams with Polynomi... |
68
Voted
BNCOD
2004
15 years 10 days ago
2004
221
click to vote
ICDE
2003
IEEE
16 years 8 days 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...
77
Voted
PLANX
2008
15 years 11 days 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 ...
186
Voted
ICDE
2005
IEEE
16 years 8 days 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...
206
Voted
ICDE
2006
IEEE
16 years 9 days 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 ...