By Topic

A Cost-Efficient Method for Continuous Top-k Processing over Data Stream

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
$31 $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)
Li Zhang ; Sch. of Comput., Nat. Univ. of Defense Technol., Changsha ; Li Tian ; Peng Zou ; Aiping Li

Continuous top-k query over data stream is very important for several on-line applications, including network monitoring, communication, sensor networks and stock market trading, etc. In this paper, we propose an effective pruning technique, which minimizes the number of tuples that need to be stored and manipulated. Based on it, a cost-efficient method for continuous top-k processing over single data stream is proposed, whose computation complex and memory requirements are greatly decreased. The data structure we use is able to support preference function whether it is or not monotonic and the running time is hardly effected by dimensions. Theoretical analysis and experimental evidences show the efficiency of proposed approaches both on storage reduction and performance improvement.

Published in:

Web-Age Information Management, 2008. WAIM '08. The Ninth International Conference on

Date of Conference:

20-22 July 2008