• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Iberian Conference on Information Systems and Technologies >I2B+tree: Interval B+ tree variant towards fast indexing of time-dependent data
【24h】

I2B+tree: Interval B+ tree variant towards fast indexing of time-dependent data

机译：I2B + tree：间隔B +树变体，可快速建立与时间相关的数据的索引

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

摘要

Index structures are fast-access methods. In the past, they were often used to minimise fetch operations to external storage devices (secondary memory). Nowadays, this also holds for increasingly large amounts of data residing in main-memory (primary memory). Examples of software that deals with this fact are in-memory databases and mobile device applications. Within this scope, this paper focuses on index structures to store, access and delete interval-based time-dependent (temporal) data from very large datasets, in the most efficient way. Index structures for this domain have specific characteristics, given the nature of time and the requirement to index time intervals. This work presents an open-source time-efficiency focused variant of the original Interval B+ tree. We designate this variant Improved Interval B+ tree (I2B+ tree). Our contribution adds to the performance of the delete operation by reducing the amount of traversed nodes to access siblings. We performed an extensive analysis of insert, range queries and deletion operations, using multiple datasets with growing volumes of data, distinct temporal distributions and tree parameters (time-split and node order). Results of the experiments validate the logarithmic performance of these operations and propose the best-observed tree parameter ranges.
机译：索引结构是快速访问的方法。过去，它们通常用于最大程度地减少对外部存储设备（辅助存储器）的读取操作。如今，这也适用于越来越多的驻留在主内存（主内存）中的数据。解决此问题的软件示例包括内存数据库和移动设备应用程序。在此范围内，本文重点研究索引结构，以最有效的方式从非常大的数据集中存储，访问和删除基于时间间隔的时间相关（时间）数据。给定时间的性质和对时间间隔进行索引的要求，该域的索引结构具有特定的特征。这项工作提出了一个原始的Interval B +树的开放源代码，以时间效率为重点。我们指定此变体改进间隔B +树（I2B +树）。通过减少遍历访问同级节点的节点数量，我们的贡献增加了删除操作的性能。我们使用数据量不断增长，不同的时间分布和树形参数（时间分割和节点顺序）的多个数据集对插入，范围查询和删除操作进行了广泛的分析。实验结果验证了这些操作的对数性能，并提出了最佳观察的树参数范围。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号