首页> 外文会议>Database and Expert Systems Applications; Lecture Notes in Computer Science; 4080 >A Forced Transplant Algorithm for Dynamic R-tree Implementation
【24h】

A Forced Transplant Algorithm for Dynamic R-tree Implementation

机译:动态R-tree实现的强制移植算法

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

摘要

Spatial access methods play a crucial role in spatial database management and manipulation. The R-tree and its variations have been widely accepted as some of the most efficient spatial indexing structures in recent years. However, neither considers storage utilization and the global optimization of a R-tree structure. Presented in this paper is a new optimization technique named forced transplant algorithm, which can improve the node storage utilization and optimize the R-tree overall structures at the same time. Our experiments show that the R-tree with our new optimization technique achieves almost 100% storage utilization and excellent query performance for all types of data.
机译:空间访问方法在空间数据库的管理和操纵中起着至关重要的作用。近年来,R树及其变体已被广泛接受为一些最有效的空间索引结构。但是,都没有考虑存储利用率和R树结构的全局优化。本文提出了一种新的优化技术,称为强制移植算法,可以提高节点存储利用率并同时优化R树的整体结构。我们的实验表明,采用我们新的优化技术的R树可实现几乎100%的存储利用率以及对所有类型数据的出色查询性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号