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

基于划分的数据仓库查询归并缓冲算法
引用本文:冯建华,张季,周立柱,邓敏. 基于划分的数据仓库查询归并缓冲算法[J]. 计算机应用, 2001, 21(9): 8-11
作者姓名:冯建华  张季  周立柱  邓敏
作者单位:清华大学计算机科学与技术系
基金项目:国家“973”重点基础研究发展项目 (G1 9980 30 4 1 4 )
摘    要:在数据仓库中存在着大量的数据。联机分析处理包含着对大量数据的复杂的查询过程。在对这些数据的存储与查询中都遇到了许多困难。解决这一问题的有效办法就是先将数据划分成便于处理的数据块,再分别对每个数据块进行处理,最后将个数据块的处理结果归并在一起。对几种常用的归并算法进行了比较,并讨论了归并中的缓冲区分配问题。

关 键 词:磁盘缓冲 数据划分 数据仓库 数据库 数据查询归并缓冲算法
文章编号:1001-9081(2001)09-0008-04

MERGING AND BUFFERING ALGORITHM INQUIRY IN PARTITION BASED DATA WAREHOUSE QUERY TECHNOLOGY
FENG Jian hua,ZHANG Ji,ZHOU Li zhu,DENG Min. MERGING AND BUFFERING ALGORITHM INQUIRY IN PARTITION BASED DATA WAREHOUSE QUERY TECHNOLOGY[J]. Journal of Computer Applications, 2001, 21(9): 8-11
Authors:FENG Jian hua  ZHANG Ji  ZHOU Li zhu  DENG Min
Abstract:Data warehouses contain large amounts of information and on-line analytical processing(OLAP), involve hundreds of complex aggregate queries over large volumes of data. In the process of storing and querying on these data, we are faced with many difficulties. One effective access to solve this problem is to partition these data into data blocks, which are easy to process and process these data blocks individually. Then merge the results together. In this paper, We compared several typical merging algorithms, and discussed the assignment of data buffer in the process of merging.
Keywords:merging  buffering  data partition  data warehouse  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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