关键词: 多子空间Skyline查询, 子空间序列, 子空间立方体群, 子空间候选集

Abstract: As Skyline queries are widely used, subspace Skyline query processing has attracted lots of attention. Aiming at meeting the need that users want to evaluate a dataset from multiple perspectives, this paper makes a full study of multiple subspace Skyline queries. Motivated by the deficiency of existing algorithms, this paper proposes the structure of subspace skycube group, and puts forward an efficient method called MSSC (multiple subspace skycube) based on that structure. The MSSC algorithm can efficiently process any number of subspace Skyline queries simultaneously. Firstly, the MSSC algorithm uses subspace candidate sets to share the results of different subspace Skyline queries in the subspace Skycube group. Then it adopts sum filter and max-value filter to cut and filter data, which further improves the performance of the MSSC algorithm. At last, the experiments conducted on both synthetic data sets and a real-life data set demonstrate that the MSSC algorithm can solve the multiple subspace Skyline queries problem efficiently.

Key words: multiple subspace Skyline queries, subspace list, subspace skycube group, subspace candidate set