• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Twenty-Seventh International Conference on Very Large Data Bases, 27th, Sep 11-14th, 2001, Roma, Italy >The MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
【24h】

The MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries

机译：MV3R-树：时间戳和间隔查询的时空访问方法

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

摘要

Among the various types of spatio-temporal queries, the most common ones involve window queries in time. In particular, timestamp (or timeslice) queries retrieve all the objects that intersect a window at a specific timestamp. Interval queries include multiple consecutive timestamps. Although several indexes have been developed for either type, currently there does not exist a structure that can efficiently process both query types. This is a significant problem due to the fundamental importance of these queries in any spatio-temporal system that deals with historical information retrieval. Our paper addresses the problem by proposing the MV3R-tree, a structure that utilizes the concepts of multi-version B-trees and 3D R-trees. Extensive experimentation proves that MV3R-trees compare favorably with specialized structures aimed at timestamp and interval window queries, both in terms of time and space requirements.
机译：在各种时空查询类型中，最常见的时空查询涉及时间查询。特别是，时间戳（或时间戳）查询检索在特定时间戳下与窗口相交的所有对象。间隔查询包括多个连续的时间戳。尽管已经针对这两种类型开发了几种索引，但是目前尚不存在可以有效处理两种查询类型的结构。由于这些查询在处理历史信息检索的任何时空系统中都具有根本重要性，因此这是一个重大问题。我们的论文通过提出MV3R树来解决这个问题，该树利用了多版本B树和3D R树的概念。大量的实验证明，MV3R树与针对时间戳和间隔窗口查询的专用结构在时间和空间需求方面均具有优势。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号