摘要： 针对现有组合Skyline查询算法剪枝效率低、对低维数据集计算速度不理想的问题,提出一种快速求解与更新组合Skyline的算法。定义支配区的相关概念,给出相应剪枝规则裁剪无用的数据组合。对于数据集添加数据点和删除数据点的情况,在原有查询结果的基础上根据数据点所在分区实施不同的操作,从而实现查询结果的快速更新。实验结果表明,该算法可有效提高剪枝效率,加快运算速度。

关键词: 组合轮廓, 多标准决策, 支配区, 剪枝规则, 更新

Abstract: Existing algorithms for querying combinatorial Skyline have low pruning efficiency and unsatisfactory computing speed for low-dimensional data set.Aiming at these problems,this paper proposes a fast algorithm for solving and updating combinatorial Skyline.It defines the related concept of dominant area and presents some pruning rules to prune lots of useless data.For points added or deleted,based on existing result,it takes corresponding operations according to the data partition,so as to update query results quickly.Experimental results show that the proposed algorithm can improve pruning efficiency and computation speed effectively.

Key words: combinatorial Skyline, multi-criteria decision, dominant area, pruning rule, updating

中图分类号: 

• TP311