首页> 外文会议>Database Systems for Advanced Applications >Twig'n Join: Progressive Query Processing of Multiple XML Streams
【24h】

Twig'n Join: Progressive Query Processing of Multiple XML Streams

机译:Twig'n Join:多个XML流的渐进式查询处理

获取原文
获取原文并翻译 | 示例

摘要

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 multi-way join and a final twig query. The processing is itself accordingly decomposed into three pipelined stages progressively producing streams of XML fragments. Twig'n Join combines the advantages of the recently proposed TwigM algorithm and our previous work on relational result-rate based progressive joins. In addition, we introduce a novel dynamic probing technique, called Result-Oriented Probing (ROP), which determines an optimal probing sequence for the multi-way join. This significantly reduces the amount of redundant probing for results. We comparatively evaluate the performance of Twig'n Join using both synthetic and real-life data from standard XML query processing benchmarks. We show that Twig'n Join is indeed effective and efficient for processing multiple XML streams.
机译:我们提出了一种实用的方法来逐步处理多个XML流上的(FWR)XQuery查询,称为Twig'n Join(或TnJ)。该查询被分解为一个查询计划,该查询计划将各个流上的多个树枝查询组合在一起,然后进行多路联接和最终的树枝查询。因此,处理本身分解为三个流水线阶段,逐步生成XML片段流。 Twig'n Join结合了最近提出的TwigM算法的优势以及我们之前基于关系结果率的渐进式连接的工作。此外,我们介绍了一种新颖的动态探测技术,称为“面向结果的探测”(ROP),它可以确定多路联接的最佳探测顺序。这显着减少了结果的冗余探测量。我们使用标准XML查询处理基准中的合成数据和实际数据对Twig'n Join的性能进行比较评估。我们证明了Twig'n Join对于处理多个XML流确实有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号