...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Mobile Computing, IEEE Transactions on >A Novel Dual-Index Design to Efficiently Support Snapshot Location-Based Query Processing in Mobile Environments
【24h】

A Novel Dual-Index Design to Efficiently Support Snapshot Location-Based Query Processing in Mobile Environments

机译：在移动环境中有效支持基于快照位置的查询处理的新型双索引设计

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

摘要

Location-based services are increasingly popular recently. Many applications aim to support a large number of users in metro area (i.e., dense networks). To cope with this challenge, we present a framework that supports location-based services on MOVing objects in road Networks (MOVNet, for short) [CHECK END OF SENTENCE]. MOVNet's dual-index design utilizes an on-disk R-tree to store the network connectivities and an in-memory grid structure to maintain moving object position updates. In this paper, we extend the functionality of MOVNet to support snapshot range queries as well as snapshot k nearest neighbor queries. Given an arbitrary edge in the space, we analyze the minimum and maximum number of grid cells that are possibly affected. We show that the maximum bound can be used in snapshot range query processing to prune the search space. We demonstrate via theoretical analysis and experimental results that MOVNet yields excellent performance with various networks while scaling to a very large number of moving objects.
机译：基于位置的服务最近越来越受欢迎。许多应用旨在支持城域（即密集网络）中的大量用户。为了应对这一挑战，我们提出了一个框架，该框架支持道路网络中的MOVing对象上的基于位置的服务（简称MOVNet）[检查句子的结尾]。 MOVNet的双索引设计利用磁盘R-tree存储网络连接性，并使用内存网格结构来维护移动对象的位置更新。在本文中，我们扩展了MOVNet的功能以支持快照范围查询以及快照k最近邻居查询。给定空间中的任意边缘，我们分析可能受影响的网格单元的最小和最大数量。我们显示最大范围可用于快照范围查询处理中以修剪搜索空间。我们通过理论分析和实验结果证明，MOVNet可以在各种网络上产生出色的性能，同时可以缩放到大量移动对象。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号