首页> 外文会议>International Conference on Database Systems for Advanced Applications >Q+Rtree: efficient indexing for moving object databases
【24h】

Q+Rtree: efficient indexing for moving object databases

机译:q + rtree:移动对象数据库的高效索引

获取原文

摘要

Moving object environments contain large numbers of queries and continuously moving objects. Traditional spatial index structures do not work well in this environment because of the need to frequently update the index which results in very poor performance. In this paper; we present a novel indexing structure, namely the Q+Rtree, based on the observation that i) most moving objects are in quasi-static state most of time, and ii) the moving patterns of objects are strongly related to the topography of the space. The Q+Rtree is a hybrid tree structure which consists of both an R *tree and a QuadTree. The R *tree component indexes quasi-static objects - those that are currently moving slowly and are often crowded together in buildings or houses. The Quadtree component indexes fast moving objects which are dispersed over wider regions. We also present the experimental evaluation of our approach.
机译:移动对象环境包含大量查询和持续移动的对象。传统的空间索引结构在这种环境中不适用于良好,因为需要经常更新导致性能非常差的索引。在本文中;我们提出了一种新颖的索引结构,即Q + Rtree,基于I)大多数移动物体的Q + Rtree大多数时间都在准静态状态下,并且II)对象的移动模式与空间的地形强烈相关。 Q + Rtree是一个混合树结构,由r *树和四叉树组成。 R *树组件索引准静态物体 - 当前缓慢移动的人,并且通常在建筑物或房屋中挤在一起。 Quadtree组件索引快速移动物体,它们分散在更宽的区域上。我们还介绍了我们对方法的实验评价。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号