Issue No.03 - March (2006 vol.18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.48
The skyline of a multidimensional data set contains the "best” tuples according to any preference function that is monotonic on each dimension. Although skyline computation has received considerable attention in conventional databases, the existing algorithms are inapplicable to stream applications because 1) they assume static data that are stored in the disk (rather than continuously arriving/expiring), 2) they focus on "one-time” execution that returns a single skyline (in contrast to constantly tracking skyline changes), and 3) they aim at reducing the I/O overhead (as opposed to minimizing the CPU-cost and main-memory consumption). This paper studies skyline computation in stream environments, where query processing takes into account only a "sliding window” covering the most recent tuples. We propose algorithms that continuously monitor the incoming data and maintain the skyline incrementally. Our techniques utilize several interesting properties of stream skylines to improve space/time efficiency by expunging data from the system as early as possible (i.e., before their expiration). Furthermore, we analyze the asymptotical performance of the proposed solutions, and evaluate their efficiency with extensive experiments.
Skyline, stream, database, algorithm.
Yufei Tao, Dimitris Papadias, "Maintaining Sliding Window Skylines on Data Streams", IEEE Transactions on Knowledge & Data Engineering, vol.18, no. 3, pp. 377-391, March 2006, doi:10.1109/TKDE.2006.48