Stabbing the Sky: Efficient Skyline Computation over Sliding Windows

We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; that is, computing the skyline for the most recent n (n N) elements. Firstly, we developed an effective pruning technique to minimize the number of elements to be kept. It can be shown that on average storing only O(logd N) elements from the most recent N elements is sufficient to support the precise computation of all n-of-N skyline queries in a d-dimension space if the data distribution on each dimension is independent. Then, a novel encoding scheme is proposed, together with efficient update techniques, for the stored elements, so that computing an n-of-N skyline query in a d-dimension space takes O(log N + s) time that is reduced to O(d log log N + s) if the data distribution is independent, where s is the number of skyline points. Thirdly, a novel trigger based technique is provided to process continuous ...

• Type: Conference
• Year: 2005
• Where: ICDE
• Authors: Xuemin Lin, Yidong Yuan, Wei Wang 0011, Hongjun Lu
• Keywords: Database, ICDE 2005, N-of-N Skyline Queries, N-of-N Skyline Query, Skyline Query Computation