Resource Sharing in Continuous Extreme Values Monitoring on Sliding Windows

摘要：

We address the problem of resource sharing in continuous extreme values monitoring (MAX or MIN) over sliding windows. Firstly, we develop an effective pruning technique called key points (KP) to minimize the number of elements to be kept for all queries. It can be shown that on average the cardinality of KP satisfies M=O(logN), where N is the number of points contained in the widest window. An efficient algorithm called MCEQP is proposed for continuously monitor K queries with different sliding window width. Analytical analysis and experimental evidences show the efficiency of proposed approach both on storage reduction and efficiency improvement.

作者: Li Zhang Li Tian Peng Zou Yan Jia

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

会议类型: 国际会议

会议名称: 2007年第三届语义和知识网格国际会议(Third International Conference on Semantics,Knowledge,and Grid)(SKG 2007)

会议地点: 西安

会议语种:英文

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