基于聚集块的多用户连续K最近邻多线程查询 |
| |
引用本文: | 夏妍,郝忠孝.基于聚集块的多用户连续K最近邻多线程查询[J].齐齐哈尔轻工业学院学报,2010(6):16-20. |
| |
作者姓名: | 夏妍 郝忠孝 |
| |
作者单位: | 齐齐哈尔大学计算机与控制学院,黑龙江齐齐哈尔161006 |
| |
摘 要: | 当对城市道路网络中的对象进行查询时,已研究出连续的K近邻查询技术,但在一般情况下服务器会同时收到多个查询请求,为了提高查询效率,降低多查询代价,提出一种聚集块的共享查询算法并建立多用户连续查询处理框架,采用流水线处理策略,将查询分为查询预处理、查询执行及查询结果分发3个执行阶段,利用扩展树存储查询结果。实验结果表明,在目标点分布比较密集的情况下,本算法明显优于其它算法。
|
关 键 词: | K最近临查询 聚类块 多线程 扩展树 多查询 |
Multi-threading processing of concurrent multiple continuous KNN queries based on cluster block |
| |
Authors: | XIA Yan HAO Zhong-xiao |
| |
Affiliation: | (Computer and Control Engineering,Qiqihar University,Heilongjiang Qiqihar 161006,China) |
| |
Abstract: | While search objects in a road network,we have research a continuous KNN neighbor search,but severs often receive a lot of query requests.For raise the efficiency of query and reduce the price of query.The clustering algorithm is proposed.Pipeline strategy and departed the continuous query processing into three simultaneous stages:query processing,query executing and query results dispatching.Experimental analysis proves the algorithm is better than others. |
| |
Keywords: | KNN query cluster block multi-thread tpr-tree multi queries processing |
本文献已被 维普 等数据库收录! |
|