计算机工程2017，Vol.43Issue(6)：195-201,206,8.DOI:10.3969/j.issn.1000-3428.2017.06.031
组合Skyline的求解与更新算法
Algorithm for Solving and Updating Combinatorial 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分类
信息技术与安全科学引用本文复制引用
董雷刚,刘国华..组合Skyline的求解与更新算法[J].计算机工程,2017,43(6):195-201,206,8.基金项目
大庆师范学院青年基金“基于互联网+人脸识别技术的学生身份认定系统”(15ZR07). （15ZR07）
