基于商立方體的OLAP緩存研究與實(shí)現(xiàn)
[Abstract]:In the era of information explosion, many data-intensive enterprises, such as telecom, bank, online e-commerce website, have accumulated a lot of data. In order to analyze and utilize these data, the cache of client can be used effectively, and the query efficiency of users will be higher. Nowadays, there are many query caching techniques, such as semantic cache, object cache and so on. Semantic cache is to store query results and related query statements in the same cache. In this paper, a new caching technique, OLAP caching model based on quotient cube, is proposed. The advantage of this caching model is that it not only stores query results in cache, but also avoids redundant storage and saves cache space. Compared with other caching techniques, the cache model requires less response time and higher hit ratio. In this paper, a OLAP cache model based on quotient cube is proposed, and then the model is implemented systematically. Finally, the model is used to carry out detailed experiments. The experimental results demonstrate the validity and accuracy of the cache model. The main work of this paper is as follows: (1) according to the different queries submitted by the user, the equivalent classes of the quotient cube are dynamically generated in the cache. The query submitted by the user is first queried in the cache. When there is no matching relation class in the cache, the query is made to the database, and the corresponding aggregation value is obtained according to the aggregation function. Finally, the equivalent classes of quotient cubes are generated in the cache. (2) the equivalence classes of quotient cubes are generated for integral metric functions and non-monotone metric functions. This is the first innovation point of this paper. (3) the relationship between the equivalent classes is studied to further improve the efficiency of cache query through pruning and other methods. Because of the relation between the upper bound of the equivalence class and the bottom drill, these equivalent classes can be combined into an algebraic lattice. This is the second innovation of this paper. (4) the relationship between cache hit rate and response time cache size cache replacement strategy and user submitted query is studied to test and verify the OLAP cache.
【學(xué)位授予單位】:昆明理工大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2013
【分類號(hào)】:TP333
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 李東;袁應(yīng)化;葉友;劉振宇;;基于屬性更新的語義緩存一致性維護(hù)算法[J];華南理工大學(xué)學(xué)報(bào)(自然科學(xué)版);2009年05期
2 梁茹冰;劉瓊;;使用MSS維護(hù)語義緩存一致性的方法[J];華南理工大學(xué)學(xué)報(bào)(自然科學(xué)版);2011年07期
3 吳婷婷,章文嵩,周興銘,徐明;語義緩存的最小權(quán)值項(xiàng)LWI替換策略[J];計(jì)算機(jī)研究與發(fā)展;2003年08期
4 蔡建宇;吳泉源;賈焰;鄒鵬;;語義緩存的聚集查詢匹配研究[J];計(jì)算機(jī)研究與發(fā)展;2006年12期
5 吳恒山,鄧志峰;一種基于移動(dòng)環(huán)境的語義緩存一致性維護(hù)技術(shù)[J];計(jì)算機(jī)工程;2003年07期
6 蔡建宇,楊樹強(qiáng),賈焰,鄒鵬;關(guān)系數(shù)據(jù)庫語義緩存的研究進(jìn)展[J];計(jì)算機(jī)工程與科學(xué);2005年10期
7 郝小衛(wèi),章陶,李磊;基于邏輯規(guī)則的語義緩存查詢處理優(yōu)化技術(shù)[J];計(jì)算機(jī)學(xué)報(bào);2005年07期
8 向陽,楊樹強(qiáng),蔡建宇,賈焰;基于大規(guī)模事務(wù)處理系統(tǒng)的中間層語義緩存技術(shù)的研究[J];計(jì)算機(jī)應(yīng)用;2005年08期
9 李東;葉友;謝芳勇;;語義緩存查詢裁剪優(yōu)化[J];計(jì)算機(jī)應(yīng)用研究;2008年12期
10 李東;葉友;楊小鵬;劉振宇;;基于增量聚類的語義緩存替換策略[J];計(jì)算機(jī)應(yīng)用研究;2008年12期
,本文編號(hào):2181918
本文鏈接:http://sikaile.net/kejilunwen/jisuanjikexuelunwen/2181918.html