...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Information Technology,Communications and Convergence >Unordered Tree Matching And Ordered Tree Matching: The Evaluation Of Tree Pattern Queries
【24h】

Unordered Tree Matching And Ordered Tree Matching: The Evaluation Of Tree Pattern Queries

机译：无序树匹配和有序树匹配：树模式查询的评估

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we study the twig pattern matching in XML document databases. Two algorithms Al and A2 are discussed according to two different definitions of tree embedding. By the first definition, only the ancestor-descendant relationship is considered. By the second one, we take not only the ancestor-descendant relationship, but also the order of siblings into account. Both Al and A2 are based on a subtree reconstruction technique, by which a tree structure is reconstructed according to a given set of data streams. More importantly, by revealing an interesting property of tree encoding, we show that the subtree reconstruction can be easily extended to a strategy (i.e., Al) for checking subtree matching according to the first definition with any kind of path join or join-like operations being completely avoided. A2 needs more time and space since it deals with a more difficult problem, but without join operations involved, either. The computational complexities of both algorithms are analysed, showing that they have a better performance than any existing strategy for this problem.
机译：在本文中，我们研究了XML文档数据库中的树枝模式匹配。根据树嵌入的两个不同定义，讨论了两种算法A1和A2。根据第一个定义，仅考虑祖先后代关系。在第二篇文章中，我们不仅考虑了祖先后裔的关系，还考虑了兄弟姐妹的顺序。 A1和A2都基于子树重构技术，通过子树重构技术，根据给定的一组数据流来重构树结构。更重要的是，通过揭示树编码的有趣特性，我们表明子树重构可以轻松地扩展到一种策略（即Al），该策略根据第一种定义使用任何类型的路径联接或类似联接操作来检查子树匹配被完全避免。 A2需要处理更多的时间和空间，因为它处理了一个更困难的问题，但是也没有涉及联接操作。分析了两种算法的计算复杂性，表明它们比任何现有策略都具有更好的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号