Problem Statement In this paper, we study the problem ofefficiently retrieving skyline elements from themost recent N elements for a sequence ofuncertain elements in a d-dimensionalnumeric space, with the skylineprobabilities not smaller than a giventhreshold q (0 < q ≤ 1)
Problem Statement ⚫ In this paper, we study the problem of efficiently retrieving skyline elements from the most recent N elements for a sequence of uncertain elements in a d-dimensional numeric space, with the skyline probabilities not smaller than a given threshold q (0 < q ≤ 1)
Dominating ProbabilitiesPsky(a) = P(a) X Pold(a) XPnew(a)Pnew(a4) = 1 - P(as) = 0.9Pold(a4) =9= 0.5aa42p(ai)=0.9O(1-P(a2))(1-P(a3))(1-P(a1)p(a2)=0.4)= 0.042p(a3)=0.3aaasoasp(a4)=0.9Psky(a4) =+x p(as)=0.1XP(a4)xPnew(a4)xPold(a4) =(a)(b)0.034Fig.1.A Sequence of Data Elements
Dominating Probabilities ⚫ Psky(a) = P(a) × Pold(a) × Pnew(a) ⚫ Pnew(a4) = 1 − P(a5) = 0.9 ⚫ Pold(a4) = (1−P(a2))(1−P(a3))(1−P(a1) ) = 0.042 ⚫ Psky(a4) = P(a4)xPnew(a4)xPold(a4) = 0.034
Algorithm
Algorithm