XQuery streaming by Forest Transducers

Hakuta, Shizuya; Maneth, Sebastian; Nakano, Kazushi; Iwasaki, Hideya

doi:10.1109/icde.2014.6816714

Cited by 15 publications

(11 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They have also solved problems of the recursion in XML document and same node-labels in XPath expression. StreamTX is presented to supports tree pattern query with multiple output nodes [14]. In this method, the authors adapt the holistic twig joins for tuple-extraction queries on streaming with block-and trigger mechanism and pruning techniques.…”

Section: Stream-querying Algorithmsmentioning

confidence: 99%

“…Figure 5 shows the running time performance for three datasets. In this figure, for every dataset, there are two queries are processed which are added the prefix whit FTP (our method of Forest Transducer for XPath), FTX [14] and GCX to distinguish the results. DBLP has reached the size of 1GB, we chose the data size range from 50MB to 1024MB.…”

Section: Running Time Performancementioning

confidence: 99%

See 1 more Smart Citation

An XML Streaming Data Processing Method based on Forest Transducer

He¹

2017

IJPE

View full text Add to dashboard Cite

XML is the de facto standard for data representation and exchanging on web. The query processing technique of XML streaming data is a hotspot in current research. Focused on the characteristics of processing semi-structure XML streaming data such as the stream arriving continuously, requiring to be read sequentially and only once into memory, the querying must be processed on the fly, a method of processing XPath query based on forest transducer is proposed. Firstly, conversion rules of forest transducer are defined for XPath query. And then the transducer is driven by input streaming data nodes. Stack and abstract syntax tree are applied to implement match and state transformation in running procedure. The relationships between state functions and intermediate results are kept by the abstract syntax tree, and the query results are output in reducing process. Finally, the experimental results show that our approach is effective and efficient on this problem, and outperforms about 30 percent of the state-of-the-art algorithms especially for large processed data. At the same time, memory usage is nearly constant. This method resolves the balance between time and space complexity, and it is a useful reference for other methods.

show abstract

Section: Stream-querying Algorithmsmentioning

confidence: 99%

Section: Running Time Performancementioning

confidence: 99%

An XML Streaming Data Processing Method based on Forest Transducer

He¹

2017

IJPE

View full text Add to dashboard Cite

show abstract

“…Note that only very restricted transformations can be formulated through the stream primitives of XSLT 3.0. For XQuery there are several best-effort systems: Raindrop [27], GCX [14], the BEA streaming processor [6], and XTISP [11]. Note that XTISP is based on a more general model that our top-down tree transducers, namely, on macro forest transducers (MFTs) [20].…”

Section: Related Workmentioning

confidence: 99%

Transforming XML Streams with References

Maneth

Ordóñez

Seidl³

2015

String Processing and Information Retrieval

Self Cite

View full text Add to dashboard Cite

Many useful XML transformations can be formulated through deterministic top-down tree transducers. As soon as transducers process parts of the input repeatedly or in an order deviating from the document order, such transductions cannot be realized over the XML document stream with constant or even depthbounded memory. Here we show that by enriching streams by forward references every such transformation can be compiled into a stream processor with a space consumption depending only on the transducer and the depth of the XML document. This is remarkable because tree transducers have rich restructuring capabilities and can process copies of input subdocuments independently. Also, references allow one to produce output in a compressed form which is guaranteed to be linear in the size of the input (up to the space required for labels). Our model is designed so that without decompression, the output may again serve as the input of a subsequent transducer. In order to reduce the extra overhead incurred by references, we investigate three optimizations: (i) reference reuse to save space, (ii) multi-labels to avoid chains of references and (iii) inlining to limit the use of references to deviations of the document order.

show abstract

“…They are being applied in many fields of computer science, such as syntax-directed translation [13], databases [22,15], linguistics [19,4], programming languages [27,21], and security analysis [16]. The most essential feature of tree transducers is their good balance between expressive power and decidability.…”

mentioning

confidence: 99%

Decision Problems of Tree Transducers with Origin

Filiot

Maneth

Reynier

et al. 2015

Automata, Languages, and Programming

Self Cite

View full text Add to dashboard Cite

Abstract. A tree transducer with origin translates an input tree into a pair of output tree and origin info. The origin info maps each node in the output tree to the unique input node that created it. In this way, the implementation of the transducer becomes part of its semantics. We show that the landscape of decidable properties changes drastically when origin info is added. For instance, equivalence of nondeterministic top-down and MSO transducers with origin is decidable. Both problems are undecidable without origin. The equivalence of deterministic topdown tree-to-string transducers is decidable with origin, while without origin it is a long standing open problem. With origin, we can decide if a deterministic macro tree transducer can be realized by a deterministic top-down tree transducer; without origin this is an open problem.Tree transducers were invented in the early 1970's as a formal model for compilers and linguistics [24,23]. They are being applied in many fields of computer science, such as syntax-directed translation [13], databases [22,15], linguistics [19,4], programming languages [27,21], and security analysis [16]. The most essential feature of tree transducers is their good balance between expressive power and decidability.Bojańczyk [3] introduces (string) transducers with origin. For "regular" stringto-string transducers with origin he presents a machine independent characterization which admits Angluin-style learning and the decidability of natural subclasses. These results indicate that classes of translations with origin are mathematically better behaved than their origin-less counter parts.We initiate a rigorous study of tree transducers with origin by investigating the decidability of equivalence, injectivity and query determinacy on the following models: top-down tree-to-tree transducers [24,23], top-down tree-to-string transducers [11], and mso definable tree-to-string transducers (see, e.g., [10]).The authors are grateful to Joost Engelfriet for its remarks for improvements and corrections on a preliminary of this work.

show abstract

XQuery streaming by Forest Transducers

Cited by 15 publications

References 39 publications

An XML Streaming Data Processing Method based on Forest Transducer

An XML Streaming Data Processing Method based on Forest Transducer

Transforming XML Streams with References

Decision Problems of Tree Transducers with Origin

Contact Info

Product

Resources

About