Download now Free registration required
As one of the commonly used queries in modern databases, skyline query has received extensive attention from database research community. The uncertainty of the data in wireless sensor networks makes the corresponding skyline uncertain and not unique. This paper investigates the Pr-Skyline problem, i.e., how to compute the skyline with the highest existence probability in a computational and energy-efficient way. The authors formulate the problem and prove that it is NP-Complete and cannot be approximated in a given expression.
- Format: PDF
- Size: 261.42 KB