| 最优有序路径关键词查询 |
| |
| 引用本文： | 梁银,董永权. 最优有序路径关键词查询[J]. 计算机工程与应用, 2015, 51(4): 138-141 |
| |
| 作者姓名： | 梁银 董永权 |
| |
| 作者单位： | 江苏师范大学 计算机科学与技术学院，江苏 徐州 221116 |
| |
| 基金项目： | 江苏省自然科学基金项目(No.BK2011204)。 |
| |
| 摘 要： | 为了实现最优有序路径关键词查询，提出了基于动态阈值的OSRK迭代算法，通过不断缩小阈值来过滤不可能出现在最优有序路径中的空间对象，同时在迭代添加路径时，删除不包含给定关键词的空间对象，能够有效地减少候选空间数据集的大小，提高查询响应性能。通过实验验证了算法的有效性。
|
| 关 键 词： | 最优有序路径查询 关键词查询 空间距离优先 关键词优先 |
Optimal sequenced route keyword query |
| |
| LIANG Yin,DONG Yongquan. Optimal sequenced route keyword query[J]. Computer Engineering and Applications, 2015, 51(4): 138-141 |
| |
| Authors: | LIANG Yin DONG Yongquan |
| |
| Affiliation: | Department of Computer Science and Technology, Jiangsu Normal University, Xuzhou, Jiangsu 221116, China |
| |
| Abstract: | 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. |
| |
| Keywords: | Optimal Sequenced Route Query keyword query spatial distance first key first |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
