最优有序路径关键词查询  

Optimal sequenced route keyword query

作　　者：梁银[1] 董永权[1] 

机构地区：[1]江苏师范大学计算机科学与技术学院,江苏徐州221116

出　　处：《计算机工程与应用》2015年第4期138-141,169,共5页Computer Engineering and Applications

基　　金：江苏省自然科学基金项目(No.BK2011204)

摘　　要：为了实现最优有序路径关键词查询,提出了基于动态阈值的OSRK迭代算法,通过不断缩小阈值来过滤不可能出现在最优有序路径中的空间对象,同时在迭代添加路径时,删除不包含给定关键词的空间对象,能够有效地减少候选空间数据集的大小,提高查询响应性能。通过实验验证了算法的有效性。In order to solve problem of optimal sequenced route keyword query, dynamic thresholds based OSRK iterative algorithm is proposed, that shrink threshold to filter out the spatial objects that cannot be in the optimal sequenced route in each iterative, and cut out the spatial objects that cannot include all given keywords. The algorithm can shrink size of candidate spatial dataset and improve query performance. Experimental results indicate that the algorithm is efficient and effective.

关 键 词：最优有序路径查询 关键词查询 空间距离优先 关键词优先 

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