Sciweavers

Share
PVLDB
2010

QSkycube: Efficient Skycube Computation using Point-Based Space Partitioning

9 years 9 months ago
QSkycube: Efficient Skycube Computation using Point-Based Space Partitioning
Skyline queries have gained considerable attention for multicriteria analysis of large-scale datasets. However, the skyline queries are known to return too many results for highdimensional 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 (1) in a bottom-up fashion with the principle of sharing result or (2) in a top-down fashion with the principle of sharing structure. However, we observed further room for optimization in both principles. This paper thus aims to design a more efficient skycube algorithm that shares multiple cuboids using more effective structures. Specifically, we first develop each principle by leveraging multiple parents and a skytree, representing recursive point-based space partitioning. We then design an efficient algorithm exploiting these pr...
Jongwuk Lee, Seung-won Hwang
Added 20 May 2011
Updated 20 May 2011
Type Journal
Year 2010
Where PVLDB
Authors Jongwuk Lee, Seung-won Hwang
Comments (0)
books