• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>VDE VERLAG GMBH;International Conference on Mechanical, Electronic and Information Technology Engineering >Research on Optimization of Top-k algorithm for continuous query ofspatial objects in road network
【24h】

Research on Optimization of Top-k algorithm for continuous query ofspatial objects in road network

机译：道路网络中 r n空间对象连续查询的Top-k算法优化研究

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In the network environment, the query efficiency of spatial object Top-k queryrnalgorithm is an important index to measure the performance of the query. Because in the practicalrnapplication of query location is often mobile, using the traditional snapshot query to deal with thernefficiency of mobile query point Top-k query is poor. The server often receive a large number ofrnquery requests, the traditional query algorithm to deal with this situation is also relatively lowrnefficiency. Due to the above reasons, this paper based on the traditional snapshot query methodrnbased on Top-k spatial data based on continuous query method is improved, in the algorithm usedrnbottom snapshot query algorithm to solve the problem of space on a single keyword query, use thernexpansion tree T to traverse the network edge. Finally, through experiments in real road networkrndata set.Finally, through experiments in real road network data set, the efficiency of the proposedrnalgorithm is verified under different parameter conditions.
机译：在网络环境中，空间对象Top-k查询算法的查询效率是衡量查询性能的重要指标。由于在实际应用中查询位置通常是移动的，因此使用传统的快照查询来处理移动查询点的效率不高。服务器经常收到大量查询请求，传统的查询算法在处理这种情况时效率也相对较低。由于以上原因，本文对基于传统快照查询方法的基于Top-k空间数据的连续查询方法进行了改进，在该算法中采用了底部快照查询算法来解决单关键字查询空间的问题，使用扩展树T遍历网络边缘。最后，通过真实道路网络数据集的实验。最后，通过真实道路网络数据集的实验，验证了所提出算法在不同参数条件下的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号