基于多线程的不确定移动对象连续k近邻查询.docVIP

基于多线程的不确定移动对象连续k近邻查询 齐建鹏 于彦伟 王创存 曹磊 宋鹏 烟台大学计算机与控制工程学院 麻省理工学院计算机科学与人工智能实验室 X 关注成功！ 加关注后您将方便地在 我的关注中得到本文献的被引频次变化的通知！ 新浪微博 腾讯微博 人人网 开心网 豆瓣网 网易微博 摘????要： 针对不确定数据下的大规模连续k近邻查询请求, 基于不确定移动对象连续k近邻查询的Rate方法, 提出高效的基于多核多线程的并行查询处理框架.根据查询对象的运动速度与相对位置确定查询请求间是否采用查询复用, 确定查询复用时的距离边界.提出密度网格扩展的多线程数据分发方法, 解决了负载均衡问题, 将空间位置相邻的查询请求划分到同一线程, 提高查询复用率.通过多线程间的内存共享机制, 对计算过的移动对象的预测区域实现计算复用.在大规模交通数据集上验证了所提算法的有效性与查询性能, 相比传统的Rate方法, 所提并行算法的加速比可达37. 关键词： k近邻查询; 不确定移动对象; 查询预测; 查询复用; 多线程; 作者简介：齐建鹏 (1992`—) , 男, 硕士生, 从事数据挖掘并行计算研究./0000-0001-6150-9773.E-mail:jianpengqi@126.com 作者简介：于彦伟, 男, 博士, 讲师./0000-0001-6941-2132.E-mail:yuyanwei@ 收稿日期：2017-05-12 基金：国家自然科学基金资助项目 Multi-threading based continuous k-nearest neighbor queries for uncertain moving objects QI Jian-peng YU Yan-wei WANG Chuang-cun CAO Lei SONG Peng School of Computer and Control Engineering, Yantai University; CSAIL, Massachusetts Institute of Technology; Abstract： An efficient multi-core and multi-threading based framework was proposed for searching k-NNs of large-scale queries with uncertain locations based on the continuous k-NN query method called Rate for uncertain moving objects.The velocities and locations of different query objects were used to judge whether employing query reuse and give the bound of reuse distance.The density grid based multi-threaded data partition method was proposed to resolve the problem of load balance, and neighboring queries were grouped into the same thread to improve the reusability.The obtained predicted areas of moving objects can be reused by building shared memory over multi-core and multi-threading.The experiments conducted on large scale datasets demonstrated the effectiveness and efficiency of the proposed methods, and the proposed optimized parallel method reached about 37 speed-up compared with Rate. Keyword： k-nearest neighbor query; uncertain moving object; query prediction; query reuse; multi-threading; Received： 2017-05-12 海量轨迹数据包含了丰富的时