• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Twenty-Seventh International Conference on Very Large Data Bases, 27th, Sep 11-14th, 2001, Roma, Italy >Dynamic Update Cube for Range-Sum Queries
【24h】

Dynamic Update Cube for Range-Sum Queries

机译：范围和查询的动态更新多维数据集

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

摘要

A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the selected cells of an OLAP data cube where target cells are decided by the specified query ranges. The direct method to access the data cube itself forces too many cells to be accessed, therefore it incurs a severe overhead. The response time is very crucial for OLAP applications which need interactions with users. In the recent dynamic enterprise environment, data elements in the cube are frequently changed. The response time is affected in such an environment by the update cost as well as the search cost of the cube. In this paper, we propose an efficient algorithm to reduce the update cost significantly while maintaining reasonable search efficiency, by using an index structure called the Δ-tree. In addition, we propose a hybrid method to provide either an approximate result or a precise one to reduce the overall cost of queries. It is useful for various applications that need a quick approximate answer rather than an accurate one, such as decision support systems.
机译：范围和查询非常流行，对于发现趋势和发现各种数据库应用程序中的属性之间的关系非常重要。它对OLAP数据多维数据集的选定单元格求和，其中目标单元格由指定的查询范围决定。访问数据多维数据集本身的直接方法迫使要访问的单元过多，因此会产生严重的开销。对于需要与用户进行交互的OLAP应用程序，响应时间至关重要。在最近的动态企业环境中，多维数据集中的数据元素经常更改。在这种环境中，响应时间受更新成本以及多维数据集的搜索成本影响。在本文中，我们提出了一种有效的算法，即通过使用称为Δ树的索引结构，在保持合理的搜索效率的同时，显着降低更新成本。此外，我们提出了一种混合方法来提供近似结果或精确结果，以减少查询的总体成本。对于需要快速近似答案而不是准确答案的各种应用（例如决策支持系统）很有用。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号