Efficient Skyline Computation on Uncertain Dimensions

Abstract

The database community has observed in the past two decades, the growth of research interest in preference queries, each of which has its unique techniques, benefits, and drawbacks. One of them is skyline queries. Skyline queries aim to report to users interesting objects based on their preferences. Yet, they are not without their limitations. Hence, this paper focuses on efficiently extending skyline query processing to support the uncertainty in dimensions, which in this paper is defined as uncertain dimension. To process skyline queries on data with uncertain dimensions, we propose SkyQUD algorithm, where it provides a mechanism that will partition the dataset according to the characteristics of each object before skyline dominance tests are performed. In the pruning process, we utilise a probability threshold value $ \tau $ to accommodate the large skyline size reported by SkyQUD due to the computed probabilities. The algorithm has been validated through extensive experiments. Its results exhibit that skyline queries can be performed effectively on uncertain dimensions, and the proposed algorithm is efficient in query answering and capable of handling large datasets.