多样k-支配轮廓查找方法  

Algorithms for finding multi-k-dominant skyline

作　　者：唐军军[1] 赵威[1] 刘国华[1] 祁瑞丽[1] 郗君甫[1] 

机构地区：[1]燕山大学信息科学与工程学院,河北秦皇岛066004

出　　处：《燕山大学学报》2009年第5期422-425,432,共5页Journal of Yanshan University

基　　金：国家自然科学基金资助项目(60773100);国家"十一五"科技支撑计划(2006BAK05BO2);河北省自然科学基金资助项目(F2009000475)

摘　　要：现有的k-支配轮廓查询算法难以保证查询结果的多样性,限制了结果的选取空间。如何求出一个点的全部k-支配属性,是k-支配轮廓查询领域的一个新问题。针对这一问题,提出了多样k-支配轮廓点的概念,分析了多样k-支配轮廓的性质,给出了两种不同的查找算法,并证明了算法的有效性和正确性。It is difficult for the existing k-dominate algorithms to ensure the diversity of the results, as a result, the selective space is restricted. How to find out the all k-dominate attributes is a new problem in the domain of the k-dominant skyline. Focusing on this, a new concept, called multi-k-dominant skyline, is proposed. And the properties of multi-k-dominant skyline is proved. Then two different new algorithms for finding the multi-k-dominant skyline are presented. The validity and correctness of the algorithms are proved.

关 键 词：高维空间 多样k-支配轮廓 k-支配轮廓 

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