作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (10): 67-69. doi: 10.3969/j.issn.1000-3428.2008.10.024

• 软件技术与数据库 • 上一篇    下一篇

基于Caching重用的复杂数据立方体聚集方法

唐培和,王日凤,刘 浩   

  1. (广西工学院计算机工程系,柳州545006)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-05-20 发布日期:2008-05-20

Aggregation Approaches for Complex Data Cube Based on Caching Reusing

TANG Pei-he, WANG Ri-feng, LIU Hao   

  1. (Dept. of Computer Engineering, Guangxi University of Technology, Liuzhou 545006)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-05-20 Published:2008-05-20

摘要: 基于数字立方体的复杂查询是立方体技术的发展方向。该文针对复杂立方体查询中可能存在的3种聚集依赖,分别给出3种基于Caching重用技术的解决方法。在模拟数据集和真实数据集上的实验结果验证了该方法的有效性和正确性。

关键词: 立方体查询, 复杂查询, 粒度计算

Abstract: Complex query based on data cube is the development direction of cube technique. This paper detects three types of the dependent-relationships in complex data cube query, and proposes three methods based on cache reusing accordingly. The experiments on synthetical and real datasets illustrate the approaches proposed are efficient and promising.

Key words: data cube query, complex query, granular computing

中图分类号: