Effective XML Keyword Search with Relevance Oriented Ranking

Effective XML Keyword Search with Relevance Oriented Ranking
复制标题

DOI:
10.1109/icde.2009.16
复制
发表时间:
2009-03
期刊:
2009 IEEE 25th International Conference on Data Engineering
影响因子:
--
通讯作者:
Z. Bao;T. Ling;Bo Chen;Jiaheng Lu
Z. Bao;T. Ling;Bo Chen;Jiaheng Lu
中科院分区:
其他
文献类型:
--
作者:
Z. Bao;T. Ling;Bo Chen;Jiaheng Lu

文献摘要

被引文献

相似文献

受Web上信息检索(IR)风格的关键字搜索的巨大成功的启发,最近出现了基于XML的关键字搜索。文本数据库和XML数据库的差异带来了三个新的挑战:(1)识别用户搜索意图,即识别用户想要搜索和搜索的XML节点类型。(2)解决关键字歧义问题:关键字可以同时作为标记名和某个节点的文本值出现;关键字可以作为不同XML节点类型的文本值出现,并具有不同的含义。(3)由于搜索结果是XML文档的子树,需要新的评分函数来估计其与给定查询的相关性。然而,现有的方法不能解决这些挑战,从而返回低的查询相关性方面的结果质量。在本文中,我们提出了一个IR风格的方法,基本上利用底层XML数据的统计数据来解决这些挑战。我们首先提出了具体的准则,搜索引擎应该满足搜索意图识别和相关性为导向的搜索结果排名。在此基础上,设计了一种新的搜索节点识别公式,并提出了一种新的XML TF*IDF排序策略,对所有可能的搜索意图进行排序。最后,在一个XML关键字搜索引擎XReal中实现了所提出的技术,大量的实验表明了我们的方法的有效性。
Inspired by the great success of information retrieval (IR) style keyword search on the web, keyword search on XML has emerged recently. The difference between text database and XML database results in three new challenges: (1) Identify the user search intention, i.e. identify the XML node types that user wants to search for and search via. (2) Resolve keyword ambiguity problems: a keyword can appear as both a tag name and a text value of some node; a keyword can appear as the text values of different XML node types and carry different meanings. (3) As the search results are sub-trees of the XML document, new scoring function is needed to estimate its relevance to a given query. However, existing methods cannot resolve these challenges, thus return low result quality in term of query relevance. In this paper, we propose an IR-style approach which basically utilizes the statistics of underlying XML data to address these challenges. We first propose specific guidelines that a search engine should meet in both search intention identification and relevance oriented ranking for search results. Then based on these guidelines, we design novel formulae to identify the search for nodes and search via nodes of a query, and present a novel XML TF*IDF ranking strategy to rank the individual matches of all possible search intentions. Lastly, the proposed techniques are implemented in an XML keyword search engine called XReal, and extensive experiments show the effectiveness of our approach.