QSkycube: Efficient Skycube Computation Using Point-Based Space Partitioning
Skyline queries have gained considerable attention for multi-criteria analysis of large-scale datasets. However, the skyline queries are known to return too many results for high-dimensional data. To address this problem, a skycube is introduced to efficiently provide users with multiple skylines with different strengths. For efficient skycube construction, state-of-the-art algorithms amortized redundant computation among subspace skylines, or cuboids, either; in a bottom-up fashion with the principle of sharing result or in a top-down fashion with the principle of sharing structure. However, the authors observed further room for optimization in both principles.