...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Systems >Efficient inclusion for a class of XML types with interleaving and counting
【24h】

Efficient inclusion for a class of XML types with interleaving and counting

机译：通过交织和计数有效地包含一类XML类型

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

获取外文期刊封面封底 >>

       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleaving and counting can be decided in polynomial time in the presence of two important restrictions: no element appears twice in the same content model, and Kleene star is only applied to disjunctions of single elements.rnOur approach is based on the transformation of each such content model into a set of constraints that completely characterizes the generated language. We then reduce inclusion checking to constraint implication. We exhibit a quadratic algorithm to perform inclusion checking on a RAM machine.
机译：XML类型之间的包含很重要，但很昂贵，而考虑到无序类型时，则要昂贵得多。我们在这里证明，在存在两个重要限制的情况下，可以在多项式时间内确定具有交织和计数的XML类型的包含：在同一内容模型中没有元素出现两次，并且Kleene star仅应用于单个元素的析取。它基于每个这样的内容模型到一组约束的转换，这些约束完全表征了生成的语言。然后，我们将包含检查减少为约束含义。我们展示了一种二次算法，可以在RAM机器上执行包含检查。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利