Abstract
With the rapid growth of uncertain data available in many real life applications, a probabilistic skyline query, namely P-skyline query, has been developed and received widespread concern. However, the P-skyline query usually reports results, which have dominant relationship. This contradicts with the incomparable property of skyline queries. Motivated by this, we extend the P-skyline query and formulate an EP-skyline (EPS) query. Thereafter, to develop the processing performance of EPS query, we utilize an index, PR-tree, to organize uncertain datasets and employ efficient pruning strategies to reduce the search space. Moreover, an effective algorithm is developed for the EPS query. Extensive experiments verify that our EPS query could always return better query results than P-skyline query with much less CPU cost, I/O cost and memory cost.
Get full access to this article
View all access options for this article.
