一种基于压缩策略的高维空间子空间skyline查询算法.pdfVIP

计算机研究与发展 ISSN 1000-1239jCN 1l-1777jTP Journal of Computer Research and Development 50(Suppl.): 101-108 , 2013 一种基于压缩策略的高维空间子空间 skyline 查询算法 孟熠刘玉藻李启睿 (中山大学信息科学与技术学院 广州 510006) (grace2011meng@163. com) A Compression Method ßased Algorithm for Subspace Skyline Computation in High Dimensional Space 岛1eng Yi , Liu Yubao , and Li Qirui (Schoolof Information Science and Technology , Sun Yat-sen University , Guangzhou 510006) Abslract The sky1ine computaion is to find the points that are not dominated by any other points in the data set. However , with the growing number of dimensions of the data attributes , usually peop1e are on1y interested in a few attributes of the data set. The subspace sky1ine computation for high dimensiona1 space is to find a set of points that are not dominated by any other points on a few specific dimensions in the data set. When dea1 with the 1arge amount of data , the sky1ine computation can consume a 10t of time , but return result fa.. st is which users can accept. In this paper , we proposed an improved a1gorithm called RSky which is based on the existing CSky to address the prob1em of sky1ine computations high time comp1exity. In particu1ar , we pointed out three shortcomings of CSky and proposed a compression method to reduce the points to be processed based on the characters of the InvertS index. The number of comparisons between point and point can be reduced by the 10wer bounds of each dimension. With the 10wer bounds , RSky can a1so remove the unnecessary buckets and the points which are impossib1e to be sky1ine points. The experimenta1 resu1ts have show the efficiency of the proposed RSky a1gorithm. Key words subs