A cost-efficient method for continuous top-k processing over data stream

摘要：

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.

作者: Li Zhang Li Tian Peng Zou Aiping Li

作者单位: School of Computer,National University of Defense Technology,Changsha,China 410073

会议类型: 国际会议

会议名称: The Ninth International Conference on Web-Age Information Management(第九届web时代信息管理国际会议)(WAIM 2008)

会议地点: 张家界

会议语种:英文

在线出版日期: 2008-07-20（万方平台首次上网日期，不代表论文的发表时间）