检索结果-内蒙古大学图书馆

7th International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)

作者： Sun, Hailong Jing, Weiping Hu, Boqi Northeast Forestry Univ Coll Informat & Comp Engineer Harbin 150040 Heilongjiang Peoples R China

K-nearest neighbor (knn) query algorithm based on road network plays an important role in location based service, which had been widely used in intelligent transportation, roadside assistance and other fields. However, as road network density increases and the number of points of interest increases, query efficiency decreases *** order to improve the query efficiency, we adopted the MapReduce parallel computing framework to complete the query of K neighbor moving objects by designing Map, Reduce, Combiner and other functions. Before the start of the query, the road network was divided into pieces, and each fragment was calculated. The fmal K-nearest neighbor moving objects were obtained by aggregating the calculated results of each slice to realize the parallel optimization of knn algorithm based on road network. The experimental results showed that the performance of parallel knn algorithm based on MapReduce was better than that of serial knn query algorithm in large-scale road network environment and the larger K value of query request. (C) 2019 The Authors. Published by Elsevier B.V.

关键词： knn query algorithm parallel computing MapReduce moving object road network

来源：评论

学校读者我要写书评

暂无评论

Parallel computing of knn query in road network based on MapReduce

引用

Procedia Computer Science 2019年 147卷 381-388页

作者： Hailong Sun Weipeng Jing Boqi Hu College of Information and Computer Engineer Northeast Forestry University Harbin 150040 China

K-nearest neighbor (knn) query algorithm based on road network plays an important role in location based service, which had been widely used in intelligent transportation, roadside assistance and other fields. However, as road network density increases and the number of points of interest increases, query efficiency decreases *** order to improve the query efficiency, we adopted the MapReduce parallel computing framework to complete the query of K neighbor moving objects by designing Map, Reduce, Combiner and other functions. Before the start of the query, the road network was divided into pieces, and each fragment was calculated. The final K-nearest neighbor moving objects were obtained by aggregating the calculated results of each slice to realize the parallel optimization of knn algorithm based on road network. The experimental results showed that the performance of parallel knn algorithm based on MapReduce was better than that of serial knn query algorithm in large-scale road network environment and the larger K value of query request.

关键词： knn query algorithm parallel computing MapReduce moving object road network

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：