XML关键词检索的查询理解  

Query Understanding for XML Keyword Search

作　　者：李求实[1,2] 王秋月[1,2] 王珊[1,2] 

机构地区：[1]数据工程与知识工程教育部重点实验室(中国人民大学),北京100872 [2]中国人民大学信息学院,北京100872

出　　处：《软件学报》2012年第8期2002-2017,共16页Journal of Software

基　　金："核心电子器件;高端通用芯片及基础软件产品"国家科技重大专项(08XNG040);国家高技术研究发展计划(863)(2009AA012149)

摘　　要：与纯文本文档集相比,使用语义标签标注的半结构化的XML文档集,有助于信息检索系统更好地理解待检索文档.同样,结构化查询,比如SQL,XQueFy和Xpath,相对于纯关键词查询更加清晰地表达了用户的查询意图.这二者都能够帮助信息检索系统获得更好的检索精度.但关键词查询因其简单和易用性,仍被广泛使用.提出了XNodeRelation算法,以自动推断关键词查询的结构化信息(条件/目标节点类型).与已有的推断算法相比,综合了XML文档集的模式和统计信息以及查询关键词出现的上下文及其关联关系等推断用户的查询意图.大量的实验验证了该算法的有效性.Compared with flat textual documents, XML documents are annotated with many meaningful tags, which give information retrieval systems a clearer understanding on queried documents. In addition to structured query languages, such as SQL, XQuery and XPath, keyword queries are widely used for XML retrieval because of their simplicity and ease of use. Although a single keyword and its query intention may be ambiguous, two or more keywords can clarify the query intention if possible occurring contexts and interrelationships are considered. This paper proposes the XNodeRelation algorithm to understand users＇ keyword queries in XML retrieval. In contrast to existing approaches, the study infers users＇ query intention by taking into account both schematic and statistical information of the XML data and considering the possible occurring contexts and interrelationships of query keywords. Extensive experiments verify the effectiveness of this algorithm.

关 键 词：XML关键词检索 查询理解 目标节点类型 条件节点类型 

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