摘要
OLAP通常使用预计算数据立方的方法提高可能的聚集查询的响应速度,在内存实化预计算的数据,可以更进一步加快响应的速度,但是受到内存空间的限制。在浓缩数据立方的环境中,动态地选择一定的数据小方在内存实化,加快响应速度,并更好地适应不同的查询模式。给出了在动态选择模型中,特定存储方式下的查询分解和响应算法。
Pre-computing data cube is an ordinary way to improve the response time of possible aggregate queries. Further more, some cuboids are often materialized in main memory to further speed up queries. But it is limited by the size of main memory. This paper proposes a way to select dynamically some cuboids of condensed cube for materializing in main memory, and gives the way to reduce query to sub-queries and the algorithm of answering queries.
出处
《计算机应用研究》
CSCD
北大核心
2005年第7期14-17,共4页
Application Research of Computers
基金
国家自然科学基金资助项目(60303030)