计算机工程2017，Vol.43Issue(2)：79-84,6.DOI:10.3969/j.issn.1000-3428.2017.02.014
分布式网络下改进的Top-k查询算法
Improved Top-k Query Algorithm in Distributed Networks
摘要
Abstract
Existing Top-k query algorithms are mainly applied in the centralized relational database.However,the algorithms will cause huge communication costs and low efficiency in the distributed networks.In order to solve these problems,an improved Top-k Query Algorithm is proposed.This algorithm sets a Pretreatment Index Table(PIT) to cut the independent data out in the distributed networks,builds candidate subset which contains the correct Top-k results and realizes Top-k query based on it.Experimental result shows that the query results of this algorithm are more accurate,and it has shorter operation time and less network overhead compared with Fagin and Naive Top-k query algorithms.关键词
Top-k查询/分布式网络/数据裁剪策略/预处理索引表/大数据Key words
Top-k query/distributed networks/data cutting strategy/Pretreatment Index Table (PIT)/big data分类
信息技术与安全科学引用本文复制引用
杨浩,林喜军,曲海鹏..分布式网络下改进的Top-k查询算法[J].计算机工程,2017,43(2):79-84,6.基金项目
国家自然科学基金(61379127) （61379127）
国家海洋公益性行业科研专项(201105033). （201105033）
