【24h】

On the Query Evaluation in Document DBs

机译:关于文档数据库中的查询评估

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

摘要

In this paper, we study the query evaluation in document databases. First, we show that a query represented in an XML language can be generally considered as a labeled tree, and the evaluation of such a query is in fact a tree embedding problem. Then, we propose a strategy to solve this problem, based on dynamic programming. For the ordered tree embedding, the proposed algorithm needs only O(|T|·|P|) time and O(|T|·|P|) space, where |T| and |P| stands for the numbers of the nodes in the target tree T and the pattern tree P, respectively. This computational complexity is better than any existing method on this issue. In addition, how to adapt this method to the general tree embedding is also discussed.
机译:在本文中,我们研究了文档数据库中的查询评估。首先,我们证明以XML语言表示的查询通常可以视为标记树,而对这种查询的评估实际上是一个树嵌入问题。然后,我们提出了一种基于动态规划的解决方案。对于有序树嵌入,所提出的算法仅需要O(| T |·| P |)时间和O(| T |·| P |)空间,其中| T |和| P |分别代表目标树T和模式树P中的节点数。在此问题上,此计算复杂性优于任何现有方法。此外,还讨论了如何将这种方法应用于一般的树嵌入。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号