基于离散度分析的Top-k组合Skyline查询算法  

TOP-K COMBINATION SKYLINE QUERY ALGORITHM BASED ON DISCRETE ANALYSIS

作　　者：董雷刚 刘国华[2] 王鑫[3] 崔晓微[1,4] Dong Leigang;Liu Guohua;Wang Xin;Cui Xiaowei(College of Computer Science and Technology,Baicheng Normal University,Baicheng 137000,Jilin,China;College of Computer Science and Technology,Donghua University,Shanghai 201620,China;School of Artificial Intelligence,Tianjin University,Tianjin 300354,China;College of Computer Science and Information Technology,Daqing Normal University,Daqing 163712,Heilongjiang,China)

机构地区：[1]白城师范学院计算机科学学院,吉林白城137000 [2]东华大学计算机科学与技术学院,上海201620 [3]天津大学人工智能学院,天津300354 [4]大庆师范学院计算机科学与信息技术学院,黑龙江大庆163712

出　　处：《计算机应用与软件》2025年第2期72-80,共9页Computer Applications and Software

基　　金：吉林省教育厅科研项目(JJKH20210005KJ);黑龙江省自然科学基金项目(LH2019F039)。

摘　　要：现有的组合Skyline查询算法不能区分组合中数据的离散度,且输出结果集很大。针对这种情况,提出基于数据离散度分析的Top-k组合Skyline查询算法。提出基于权重的组合离散系数概念及其计算方法;设置分类器将组合划分至不同的组合队列;采用并行处理方式对各组合队列进行计算。实验结果表明,该算法可以根据用户自定义条件准确有效地返回结果,能满足实际应用的需要。The existing combined Skyline query algorithm cannot distinguish the discretization of data in the combination,and the output result set is very large.Aimed at this situation,a TOP-K combination Skyline query algorithm based on data dispersion analysis is proposed.The concept of combined dispersion coefficient based on weight and its calculation method were proposed.A classifier was set to divide the combinations into different combination queues.The parallel processing method was used to calculate each combination queue.The experimental results show that the algorithm can accurately and effectively return results according to user-defined conditions,which can meet the needs of practical application.

关 键 词：组合Skyline 离散度分析 TOP-K 离散系数 分类器 并行处理 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]