Efficient Top-k Keyword Search on XML Streams

被引：0

作者：

Li, Lingli ^{[1
]}

Wang, Hongzhi ^{[1
]}

Li, Jianzhong ^{[1
]}

Luo, Jizhou ^{[1
]}

机构：

[1] Harbin Inst Technol, Harbin, Peoples R China

来源：

PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5 | 2008年

关键词：

XML streams; keyword search; top-k;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Keywords can be used to query XML data without schema information. In this paper, a novel kind of query is proposed, top-k keyword search over XML streams. According to the set of keywords and the number of results, such query can retrieve the top-k XML data fragments most related to the keyword set. A novel ranking strategy for search result is proposed to represent the relativity of XML segments and the query. In order to efficiently and effectively process the top-k keyword query on XML streams, based on this ranking strategy,, a stack-based algorithm is proposed to dynamically obtain the top-k results with the highest ranks at any time, with a filtering method to delete redundant elements. Extensive experiments are performed to verify the effectiveness and efficiency of the algorithms presented in this paper.

引用

页码：1041 / 1046

页数：6