Reasoning and identifying relevant matches for XML keyword search
Reasoning and identifying relevant matches for XML keyword search
复制标题
DOI：
10.14778/1453856.1453956
复制
发表时间：
2008-08
期刊：
影响因子：
--
通讯作者：
Ziyang Liu;Yi Chen
中科院分区：
文献类型：
--
作者：
Ziyang Liu;Yi Chen
关键字搜索是一种用户友好的机制，用于在Web和科学应用程序中检索XML数据。一个直观上令人信服但定义模糊的目标是识别与用户相关的查询关键字的匹配。然而，由于搜索语义的内在模糊性，很难直接评估查询结果的相关性。在这项工作中，我们研究了一个公理框架，它包括两个直观和非平凡的属性，XML关键字搜索技术应该理想地满足这些属性：关于数据和查询的单调性和一致性。这是第一个从形式角度对关键词搜索策略进行推理的工作。然后，我们提出了一种识别相关匹配的新语义，据我们所知，这是唯一一种同时满足这两个性质的现有算法。为实现这一语义，设计了一种高效的算法。大量的实验研究验证了这些性质的直观性，并证明了该算法的有效性。
Keyword search is a user-friendly mechanism for retrieving XML data in web and scientific applications. An intuitively compelling but vaguely defined goal is to identify matches to query keywords that are relevant to the user. However, it is hard to directly evaluate the relevance of query results due to the inherent ambiguity of search semantics. In this work, we investigate an axiomatic framework that includes two intuitive and non-trivial properties that an XML keyword search technique should ideally satisfy: monotonicity and consistency, with respect to data and query. This is the first work that reasons about keyword search strategies from a formal perspective. Then we propose a novel semantics for identifying relevant matches, which, to the best of our knowledge, is the only existing algorithm that satisfies both properties. An efficient algorithm is designed for realizing this semantics. Extensive experimental studies have verified the intuition of the properties and shown the effectiveness of the proposed algorithm.