By Topic

Efficient Top-k Keyword Search on XML Streams

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Lingli Li ; Harbin Inst. of Technol., Harbin ; Hongzhi Wang ; Jianzhong Li ; Jizhou Luo

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.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008