Twig'n Join: Progressive Query Processing of Multiple XML Streams
| dc.contributor.author | TOK, Wee Hyong | en_US |
| dc.contributor.author | BRESSAN, Stephane | en_US |
| dc.contributor.author | LEE, Mong-Li | en_US |
| dc.date.accessioned | 2007-09-03T08:58:02Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:25Z | |
| dc.date.available | 2007-09-03T08:58:02Z | en_US |
| dc.date.available | 2017-01-23T07:00:25Z | |
| dc.date.issued | 2007-09-03T08:58:02Z | en_US |
| dc.description.abstract | We propose a practical approach to the progressive processing of (FWR) XQuery queries on multiple XML streams, called Twig.n Join (or TnJ). The query is decomposed into a query plan combining several Twig queries on the individual streams, followed by a join and a final Twig query. The processing is itself accordingly decomposed into three pipelined stages progressively producing streams of XML fragments. We use the recently proposed TwigM algorithm for the progressive evaluation of Twig queries. We devise an original progressive join algorithm for the XML fragments leveraging our previous work on relational result-rate based progressive joins. In addition, we propose a multi-way XML value join algorithm, which uses a result-oriented approach to determine the probing sequence for multiple XML streams. We comparatively evaluate the performance of the Twig.n Join variants using both synthetic and real-life data from standard XML query processing benchmarks. We show that Twig.n Join with a result-rate based approach is most effective and efficient. | en_US |
| dc.format.extent | 356831 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/2572 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRA9/07 | en_US |
| dc.title | Twig'n Join: Progressive Query Processing of Multiple XML Streams | en_US |
| dc.type | Technical Report | en_US |