欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
基于区域编码处理技术的整体的枝条质问被开发了也就是，最小化中间的结果不在最后的枝条结果的那些 root-to-leaf 路径匹配。这些算法不得不在质问模式扫描标签的所有溪流。然而，无用的路径火柴不能完全被避免。基于扩大杜威的标记的计划的 TJFast 被建议了避免无用的中间的结果，；它仅仅需要存取叶询问节点的标签。然而，它不与一样的父母一起关于元素的特征担心，；它不得不合并加入在第一个短语期间被评估的所有中间的结果。我们建议一个新标记计划压缩有一样的特征的 XML 元素。基于压缩标记路径的溪流，整体的枝条质问算法说出 CPJoin 的一篇新小说被设计。最后，实现结果被提供证明 CPJoin 在两个上有好性能真实；合成数据。
英文摘要：
Holistic twig query processing techniques based on region encoding have been developed to minimize the intermediate results, namely, those root-to-leaf path matches that are not in the final twig results. These algorithms have to scan all the streams of tags in query patterns. However, useless path matches cannot be completely avoided. TJFast which is based on the labeling scheme of Extended Dewey has been proposed to avoid useless intermediate results, and it only needs to access the labels of the leaf query nodes. However, it don＇t concern about the characteristics of elements with the same parent, and it has to merge join all the intermediate results which are evaluated during the first phrase. We propose a new labeling scheme to compress the XML elements which have the same characteristic. Based on the compressed path-labeled streams, a new novel holistic twig query algorithm named CPJoin is designed. Finally, implementation results are provided to show that CPJoin has good performance on both real and synthetic data.
同期刊论文项目
同项目期刊论文
期刊信息
位置：