首页> 外文会议>Web-age information management >An Efficient Hybrid Index Structure for Temporal Marine Data
【24h】

An Efficient Hybrid Index Structure for Temporal Marine Data

机译:一种有效的时间海洋数据混合索引结构

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

摘要

Marine data is a typical big data that features multi-source, multi-class, multi-dimension and massiveness. Rapid query to big marine data is the fundamental request in vast marine applications. To improve query performance, we should devise a complete index structure. In this paper we propose a multi-layer index (ML-index, for short) with regarding to Time Interval B~+-tree and Hybrid Space Partition Tree (HSP-tree, for short). It employs Marine data value function that consists of data time length, data access frequency etc. to optimize the primary key index (i.e. B~+-tree). Moreover, we propose an adaptive space partition method on the basis of data characters, user query habits and data unit capacity particularly. Furthermore we build a secondary index, namely, the HSP-tree over the above partition result. We show the results of experiment that compares ML-index with two state-of-the-art index methods on the real marine data. These suggest that the ML-index enable user to perform marine data query in about 2/3 the time needed by the state-of-the-art tools.
机译:海洋数据是典型的大数据,具有多源,多类,多维和海量的特征。快速查询大海洋数据是广泛的海洋应用的基本要求。为了提高查询性能,我们应该设计一个完整的索引结构。本文针对时间间隔B〜+树和混合空间分区树(HSP树)提出了一种多层索引(简称ML索引)。它采用了海洋数据值功能,该功能由数据时间长度,数据访问频率等组成,以优化主键索引(即B〜+-树)。此外,我们提出了一种基于数据特征,用户查询习惯和数据单元容量的自适应空间划分方法。此外,我们在上面的分区结果上建立了一个二级索引,即HSP树。我们展示了在实际海洋数据上将ML-index与两种最新索引方法进行比较的实验结果。这些表明,ML-index使用户能够在最先进的工具所需时间的大约2/3内执行海洋数据查询。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号