This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qual-ifiers against XML streams. SPEX proceeds as follows. An expression is translated in linear time into a network of transducers, most of them having 1-DPDT equivalents. Every stream message is then processed once by the entire network and result fragments are output on the fly. In most practical cases SPEX needs a time linear in the stream size and for transducer stacks a memory quadratic in the stream depth. Experiments with a prototype implementation point to a very good efficiency of the SPEX approach.
With the advent of XML as a standard for data representation and exchange on the Internet, storing a...
The important challenge of evaluating XPath queries over XML streams has sparked much interest in th...
Abstract. Whenever queries have to be evaluated on XML data streams- or when the memory that is avai...
AbstractXML data is queried with a limited form of regular expressions, in a language called XPath. ...
The adoption of XML promises to accelerate construction of systems that integrate dis-tributed, hete...
Querying XML streams is receiving much attention due to its growing range of applications from tra#...
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matche...
We propose regular expression pattern matching as a core feature of programming languages for manipu...
We present an e±cient algorithm for evaluating an XPath query Q (involving only child and descendant...
This thesis presents methods for eciently evaluating structural queries over tree-structured data st...
XML is nowadays the de facto standard for electronic data interchange on the Web. Available XML data...
Abstract. We study the problem of streaming regular expression pars-ing: Given a regular expression ...
In this paper we address the problem of evaluating XPath queries over streaming XML data. We conside...
<p>Existing work on XML query evaluation has either focused on algebraic optimization techniques sui...
AbstractThe important challenge of evaluating XPath queries over XML streams has sparked much intere...
With the advent of XML as a standard for data representation and exchange on the Internet, storing a...
The important challenge of evaluating XPath queries over XML streams has sparked much interest in th...
Abstract. Whenever queries have to be evaluated on XML data streams- or when the memory that is avai...
AbstractXML data is queried with a limited form of regular expressions, in a language called XPath. ...
The adoption of XML promises to accelerate construction of systems that integrate dis-tributed, hete...
Querying XML streams is receiving much attention due to its growing range of applications from tra#...
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matche...
We propose regular expression pattern matching as a core feature of programming languages for manipu...
We present an e±cient algorithm for evaluating an XPath query Q (involving only child and descendant...
This thesis presents methods for eciently evaluating structural queries over tree-structured data st...
XML is nowadays the de facto standard for electronic data interchange on the Web. Available XML data...
Abstract. We study the problem of streaming regular expression pars-ing: Given a regular expression ...
In this paper we address the problem of evaluating XPath queries over streaming XML data. We conside...
<p>Existing work on XML query evaluation has either focused on algebraic optimization techniques sui...
AbstractThe important challenge of evaluating XPath queries over XML streams has sparked much intere...
With the advent of XML as a standard for data representation and exchange on the Internet, storing a...
The important challenge of evaluating XPath queries over XML streams has sparked much interest in th...
Abstract. Whenever queries have to be evaluated on XML data streams- or when the memory that is avai...