首页> 外文会议>Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on >An XML twig approximate query approach based on query fragment relaxation
【24h】

An XML twig approximate query approach based on query fragment relaxation

机译:基于查询片段松弛的XML细枝近似查询方法

获取原文

摘要

To deal with the problem of approximate query over XML documents, this paper proposes an XML twig query relaxation approach. The approach gathers the query history to speculate the user preferences, which is used to calculate the importance for each query fragment of the twig query, and relax the original query according to the sequence of the fragments' importance. Then, the holistic twig algorithm is used to relax the original twig query, based on the number of query fragments we adopt different relax way. The first fragment to be relaxed must be the least important fragment and thus the most relevant query results can be obtained. Finally, ranking the relevant query results based on their satisfaction degree to the original query and the user preferences. The experimental results demonstrate that the XML twig query relaxation approach presented in this paper has the high recall and precision, and can efficiently meet the user's needs and preferences as well.
机译:为了解决基于XML文档的近似查询问题,本文提出了一种XML细枝查询松弛方法。该方法收集查询历史以推测用户偏好,该用户偏好用于计算树枝查询的每个查询片段的重要性,并根据片段重要性的顺序放宽原始查询。然后,基于查询片段的数量,采用不同的松弛方式,采用整体树枝算法对原始的树枝查询进行松弛。要放松的第一个片段必须是最不重要的片段,因此可以获得最相关的查询结果。最后,根据相关查询结果对原始查询的满意度和用户偏好来对相关查询结果进行排名。实验结果表明,本文提出的XML Twig查询松弛方法具有较高的查全率和准确性,并且可以有效满足用户的需求和偏好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号