...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>The Journal of Systems and Software >Using compressed index structures for processing moving objects in large spatio-temporal databases
【24h】

Using compressed index structures for processing moving objects in large spatio-temporal databases

机译：使用压缩索引结构处理大型时空数据库中的移动对象

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper develops a novel, compressed B+-tree based indexing scheme that supports the processing of moving objects in one-, two-, and multi- dimensional spaces. The past, current, and anticipated future trajectories of movements are fully indexed and well organized. No parameterized functions and geo metric representations are introduced in our data model so that update operations are not required and the maintenance of index structures can be accomplished by basic insertion and deletion operations. The proposed method has two contributions. First, the spatial and temporal attributes of trajectories are accurately preserved and well organized into compact index structures with very efficient memory space utilization and storage requirement. Second, index maintenance overheads are more economi cal and query performance is more responsive than those of conventional methods. Both analytical and empirical studies show that our proposed indexing scheme outperforms the TPR-tree.
机译：本文开发了一种新颖的，基于压缩B +树的索引方案，该方案支持处理一维，二维和多维空间中的运动对象。过去，现在和将来的运动轨迹已得到充分索引并井井有条。我们的数据模型中未引入参数化函数和几何表示形式，因此不需要更新操作，并且可以通过基本的插入和删除操作来完成索引结构的维护。所提出的方法有两个贡献。首先，轨迹的空间和时间属性被准确地保留并很好地组织成紧凑的索引结构，并具有非常有效的存储空间利用率和存储要求。其次，与传统方法相比，索引维护开销更加经济，并且查询性能响应更快。分析和实证研究都表明，我们提出的索引方案优于TPR树。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号