• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Knowledge-Based Systems for Safety Critical Applications >XR-tree: indexing XML data for efficient structural joins
【24h】

XR-tree: indexing XML data for efficient structural joins

机译：XR树：索引XML数据以进行有效的结构连接

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

摘要

XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating structural relationship, specifically parent-child or ancestor-descendant relationship, between XML element sets has imposed a great challenge on efficient XML query processing. We propose XR-tree, namely, XML region tree, which is a dynamic external memory index structure specially designed for strictly nested XML data. The unique feature of XR-tree is that, for a given element, all its ancestors (or descendants) in an element set indexed by an XR-tree can be identified with optimal worst case I/O cost. We then propose a new structural join algorithm that can evaluate the structural relationship between two XR-tree indexed element sets by effectively skipping ancestors and descendants that do not participate in the join. Our extensive performance study shows that the XR-tree based join algorithm significantly outperforms previous algorithms.
机译：XML文档通常结合值搜索和结构搜索来查询。尽管按值查询可以利用传统的数据库技术，但评估XML元素集之间的结构关系（尤其是父子关系或祖辈关系）对有效的XML查询处理提出了巨大挑战。我们提出了XR树，即XML区域树，这是一种动态外部存储器索引结构，专门用于严格嵌套的XML数据。 XR树的独特之处在于，对于给定元素，可以用最佳的最坏情况I / O成本来标识XR树索引的元素集中其所有祖先（或后代）。然后，我们提出了一种新的结构连接算法，该算法可以通过有效地跳过不参与连接的祖先和后代来评估两个XR树索引元素集之间的结构关系。我们广泛的性能研究表明，基于XR树的联接算法明显优于以前的算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号