Sciweavers

13 search results - page 1 / 3
» Expressiveness and complexity of xml publishing transducers
Sort
View
PODS
2007
ACM
120views Database» more  PODS 2007»
14 years 5 months ago
Expressiveness and complexity of xml publishing transducers
Wenfei Fan, Floris Geerts, Frank Neven
DBPL
2007
Springer
115views Database» more  DBPL 2007»
13 years 11 months ago
XML Publishing: Bridging Theory and Practice
Transforming relational data into XML, as known as XML publishing, is often necessary when one wants to exchange data residing in databases or to create an XML interface of a tradi...
Wenfei Fan
PODS
2007
ACM
104views Database» more  PODS 2007»
14 years 5 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...
ICDE
2003
IEEE
209views Database» more  ICDE 2003»
14 years 6 months ago
An Evaluation of Regular Path Expressions with Qualifiers against XML Streams
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...
Dan Olteanu, François Bry, Tobias Kiesling
ICDT
2007
ACM
141views Database» more  ICDT 2007»
13 years 11 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl