首页 | 本学科首页   官方微博 | 高级检索  
     

基于OLAP查询的数据仓库视图的水平分割
引用本文:胡孔法,董逸生,徐立臻,赵庆建. 基于OLAP查询的数据仓库视图的水平分割[J]. 应用科学学报, 2003, 21(4): 362-366
作者姓名:胡孔法  董逸生  徐立臻  赵庆建
作者单位:1.东南大学计算机科学与工程系 江苏 南京 210096;2.东南大学经济管理学院 江苏 南京 210096
基金项目:国家863/CIMS基金(6409002012);江苏省九五重点攻关课题(BG98017-1);江苏省十五高科技(BG2001013)资助项目
摘    要:选择数据仓库视图进行有效的水平分割,使OLAP查询通过访问较少的分割裂片以及较少的元组就可以完成,从而加快查询响应时间,削减维护费用.提出根据OLAP查询中的选择谓词构造其最小项谓词,选择数据仓库立方体视图,进行水平分割和实体化,来提高OLAP查询效率.

关 键 词:OLAP查询  实视图  数据仓库  元数据  
文章编号:0255-8297(2003)04-0362-05
收稿时间:2002-10-11
修稿时间:2002-12-31

Horizontally Partitioning the Data Warehouse Views Based on OLAP Queries
HU Kong-fa,DONG Yi-sheng,XU Li-zhen,ZHAO Qing-jian. Horizontally Partitioning the Data Warehouse Views Based on OLAP Queries[J]. Journal of Applied Sciences, 2003, 21(4): 362-366
Authors:HU Kong-fa  DONG Yi-sheng  XU Li-zhen  ZHAO Qing-jian
Affiliation:1. Department of Computer Science and Engineering, Southeast Universtity, Nanjing 210096, China;2. School of Economics & Management, Southeast University, Nanjing 210096, China
Abstract:OLAP querying is a complex process and the volume of data involved is so large that query response time has become an important warehousing issue. We can select data warehouse views to parttion horizontally in an efficient manner so that OLAP queries will scan fewer fragments and in turn scan fewer rows in the original view. Based on the minterm predicates of OLAP queries, the paper proposes a method for selecting and efficient horizontal partitioning of warehouse cube views in order to improve the efficiency of the OLAP queries.
Keywords:data warehouse  OLAP queries  materialized views  metadata  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《应用科学学报》浏览原始摘要信息
点击此处可从《应用科学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号