反向Top-k查询算法研究  

Research on Reverse Top-k Queries

作　　者：黄伟国[1] 

机构地区：[1]湖南科技学院电子与信息工程学院,湖南永州425199

出　　处：《软件导刊》2017年第9期75-78,共4页Software Guide

基　　金：湖南科技学院科学研究项目(110391150)

摘　　要：互联网中沉淀了大量可分析利用的数据,如何有效地利用这些海量数据,为不同行业产品制造方提供对新产品的分析,已成为时下的热点。反向Top-k查询技术是一种常用的数据分析及处理技术,并且已经在很多领域得到了应用。研究了已有的基于反向Top-k的查询算法Skyband-based算法和Branch-and-bound算法,针对很多实际应用领域偏好权重向量会出现改变的情况,提出了一种适用于进行"二次计算"的交互式算法,通过实验将交互式算法跟效率高的Branch-and-bound算法对比得出,当用户修改部分偏好权重向量之后,利用交互式算法可以比Branchand-bound算法更加高效率地计算出结果。Among the Internet, a large amount of data can be analyzed and utilized. How to effectively use these vast amounts of data, for different industries, manufacturers of products to provide new product analysis, has become a hot topic, keverse Top- k query technology is a commonly used data analysis and processing technology, and has been applied in many fields. Study of the existing reverse Top-k query algorithm Skyband-based algorithm and Branch-and-bound algorithm based on the preference weight vector in many practical applications will appear to change the situation, a method is presented for the ＂two＂ interactive algorithm by experiment that compared to Branch-and-bound algorithm, interactive algorithm with high efficiency, when part of the user to modify the preference weight vector is calculated by the interactive method can be more efficient than Branch-and- bound algorithm results.

关 键 词：交互式算法 Skyband-based算法 Branch-and-Bound算法 TOP-K查询 

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