[1]胡孔法,董逸生,徐立臻,等.基于OLAP查询的数据集市系统的研究[J].东南大学学报(自然科学版),2002,32(6):875-878.[doi:10.3969/j.issn.1001-0505.2002.06.011]
 Hu Kongfa,Dong Yisheng,Xu Lizhen,et al.Research on data mart system based on OLAP queries[J].Journal of Southeast University (Natural Science Edition),2002,32(6):875-878.[doi:10.3969/j.issn.1001-0505.2002.06.011]
点击复制

基于OLAP查询的数据集市系统的研究()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
32
期数:
2002年第6期
页码:
875-878
栏目:
计算机科学与工程
出版日期:
2002-11-20

文章信息/Info

Title:
Research on data mart system based on OLAP queries
作者:
胡孔法 董逸生 徐立臻 杨科华
东南大学计算机科学与工程系,南京 210096
Author(s):
Hu Kongfa Dong Yisheng Xu Lizhen Yang Kehua
Department of Computer Science and Engineering, Southeast University, Nanjing 210096,China
关键词:
数据集市 数据仓库 联机分析处理 最小项谓词
Keywords:
data mart data warehouse on-line analytical processing minterm predicates
分类号:
TP311
DOI:
10.3969/j.issn.1001-0505.2002.06.011
摘要:
研究了通过对数据仓库视图进行水平分割来建立数据集市系统,提高OLAP查询效率的方法和技术.提出了根据OLAP查询中的选择谓词构造其最小项谓词,选择数据仓库立方体视图进行水平分割,利用视图分割后的裂片建立的数据集市来回答查询,达到减少访问的视图元组数和加快查询响应时间,从而提高OLAP查询效率,削减维护费用.
Abstract:
The method and technology to improve the efficiency of the OLAP queries with data mart system by horizontally partitioning the data warehouse views are studied. A method is proposed for selecting and efficiently horizontally partitioning warehouse cube views based on the minterm predicates of selection predicates in OLAP queries. the queries can be answered with those data marts by these fragments of partitioned warehouse views to reduce the visited rows and query response time. The efficiency of the OLAP queries is also improved and the maintenance cost reduced.

参考文献/References:

[1] 王能斌.数据库系统原理[M].北京:电子工业出版社,2000.310-330.
[2] Gupta A,Mumick I S.Maintenance of materialized views:problems,techniques,and applications[A].In:Data Engineering Bulletin[C].1995.3-18.http://www.cise.ufl.edu/~jgreenbe/research/papers/.1999-03-20.
[3] 胡孔法,宋爱波,董逸生,等.数据仓库中实视图聚集函数的增量更新[J].东南大学学报(自然科学版),2002,32(1):11-14.
  Hu Kongfa,Dong Yisheng.Incremental updates of aggregate functions of materialized view in the data warehouse[J]. Journal of Southeast University(Natural Science Edition),2002,32(1):11-14.(in Chinese)
[4] Neil P O,Quass D.Improved query performance with variant indexes[A].In:Proceedings of the ACM SIGMOD International Conference on Management of Data[C].1997.38-49.http://www.cs.wisc.edu/~ramasamay./ 1999-08-15.
[5] Datta A,Moon B,Thomas H.A case for parallelism in data warehousing and OLAP[A].In:The 9th International Workshop on Database and Expert Systems Application[C].1998.226-231.http://www.scout.cs.arizona.edu/people/bkmoon/parpers./ 2000-08-15.
[6] Chaudhuri S,Narasayya V.Index merging[A].In:Proceedings of the International Conference on Data Engineering[C].1999.296-303.http://citeseer.nj.nec.com/cs./ 2000-08-15.
[7] Datta A,Ramamritham K,Thomas H.A novel solution for efficient storage and indexing in data warehouses[A].In:Proceedings of the International Conference on Very Large Databases[C].1999.730-733.http://ccs-www.cs.umass.edu/db/parpers./ 2000-08-30.
[8] Noamam A Y,Barker K.A horizontal fragmentation algorithm for the fact relation in a distributed data warehouse[A].In:The 8th International Conference on Information and Knowledge Management[C].Missouti,1999.154-161.
[9] Bellatreche L,Karlapalem K,Mohania M.What can partitioning do for your data warehouses and data marts[A].In:The International Symposium on Database Engineering and Applications[C].2000.437-445.http://www.cs.wmich.edu/~mohania/parpers./ 2001-07-20.
[10] Bellatreche L,Karlapalem K,Mohania M.OLAP query processing for partitioned data warehouses[A].In:The International Symposium on Database Applications in Non-Traditional Environments[C].2000.35-42.http://www.cs.wmich.edu/~mohania/parpers./ 2001-07-20.

备注/Memo

备注/Memo:
基金项目: 江苏省“九五”重点攻关课题资助项目(BG98017—1)、江苏省“十五”高科技资助项目(BG2001013).
作者简介: 胡孔法(1970—),男,博士生,kfhu@seu.edu.cn; 董逸生(联系人),男,教授,博士生导师,Dongys@seu.edu.cn.
更新日期/Last Update: 2002-11-20