Counting distinct objects over sliding windows

Publication Type:
Conference Proceeding
Proceedings of the Twenty-First Australasian Conference on Database Technologies, 2010, 104 pp. 75 - 84
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013005474OK.pdf363.24 kB
Adobe PDF
Aggregation against distinct objects has been involved in many real applications with the presence of duplicates, including real-time monitoring moving objects. In this paper, we investigate the problem of counting distinct objects over sliding windows with arbitrary lengths. We present novel, time and space efficient, one scan algorithms to continuously maintain a sketch so that the counting can be approximately conducted with a relative error guarantee e in the presence of object duplicates. Efficient query algorithms have also been developed by effectively utilizing the skyband property. Moreover, the proposed techniques may be immediately applied to the range counting aggregation and heavy hitter problem against distinct elements. A comprehensive performance study demonstrates that our algorithms can support real-time computation against high speed data streams.
Please use this identifier to cite or link to this item: