基于查询片段松弛的XML小枝近似查询方法  

The XML Twig Approximate Query Approach Based on Query Fragment Relaxation

作　　者：魏珂[1] 任建华[1] 孟祥福[1] 

机构地区：[1]辽宁工程技术大学电子与信息工程学院

出　　处：《小型微型计算机系统》2013年第3期508-514,共7页Journal of Chinese Computer Systems

基　　金：国家青年科学基金项目(61003162)资助

摘　　要：为了解决普通用户对XML文档的近似查询问题,提出一种基于查询片段松弛的XML小枝近似查询方法.该方法利用查询历史推测用户偏好,进而根据用户偏好为原始小枝查询中的每个查询片段分配重要程度,然后基于查询片段重要程度对原始小枝查询条件进行松弛处理,最不重要的查询片段最先松弛,从而确保获取最为相关的查询结果;最后,根据对原始查询和用户偏好的满足程度,将得到的满足松弛查询条件的结果进行排序.实验结果表明,本文提出的查询松弛和结果排序方法能够获得较高的查全率和准确率,并且能较好地满足用户需求和偏好.To deal with the problem of approximate query against XML documents,based on the query fragment relaxation,this paper proposes a XML twig approximate querying approach.The approach leverages the query history to speculate the user preferences,which is used to assign the importance for each query fragment of the given twig query.Then,the query fragment importance is used to relax the original twig query.The first query fragment to be relaxed must be the least important query fragment and thus the most relevant query results can be obtained.Finally,the relevant query results are ranked according to their satisfaction degree to the original query and the user preferences.The experimental results demonstrate that the query relaxation and results ranking approach presented in this paper has the high recall and precision,and can efficiently meet the user′s needs and preferences as well.

关 键 词：XML小枝查询 查询松弛 用户偏好 排序 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]