期刊文献+

一种基于访问图优化的缓存替换算法 被引量:2

A BUFFER REPLACEMENT ALGORITHM BASED ON CALL GRAPH OPTIMISATION
下载PDF
导出
摘要 针对目前数据库缓存替换算法替换策略单一,无法预测即将执行SQL语句的不足,提出了一种基于访问图优先的缓存替换算法CG-ABR(CallGraph Optimizing Adaptive Buffer Replacement)。该算法通过查询优化器获得当前数据访问类型,自动调整缓存替换算法以适应实时变化的访问类型,改进了缓存访问的管理方法,并根据SQL语句的应用逻辑执行顺序来构造访问图CallGraph,基于CallGraph以预测将要执行的SQL语句,替换出未来不会被访问的页面缓存,以达到缓存空间优化的目的。实验结果与分析表明,CG-ABR算法是有效的,对实时变化的访问类型有较好的缓存命中率,具有良好的应用价值。 Aiming at existing problems of single buffer replacement policy and the inability in predicting future SQL sentences execution of which the current database buffer replacement algorithm has, this paper proposed a new database buffer replacement algorithm CG-ABR (Call graph optimising adaptive buffer replacement). CG-ABR automatically adjusts butter replacement algorithm in order to adapt to data access types with timely variation by obtaining current type through query optimiser, this has optimised the management method of buffer access infor- mation. For achieving the goal of optimising the buffer space, this algorithm constructs Call Graph according to the applied logic execution or- der of SQL sentences,predicts future SQL sentences to be executed based on the Call Graph, and replaces the pages which might not be ac- cessed afterwards. Experiment results and analyses show that the CG-ABR algorithm is effective in buffer replacement with high hit ratio on timely varying access types and has good applicable value.
出处 《计算机应用与软件》 CSCD 2010年第9期46-48,共3页 Computer Applications and Software
基金 国家高技术研究发展计划(2007AA12Z208)
关键词 缓存替换 CALL GRAPH CG-ABR 性能分析 Buffer replacement Call graph CG-ABR Performance analysis
  • 相关文献

参考文献11

  • 1Elizabeth J O'Neil,Patrick E O'Neil,Gerhard Weikum.The LRU-K Page Replacement Algorithm For Database Disk Buffering.SIGMOD,Washington,DC,USA,April 1993.
  • 2Coffman E G,Denning P J.Operating Systems Theory.Englewood Cliffs,New jersey:Prentic-Hall,1973.
  • 3Spirn J R.Program Behavior:Models and Measurements.New York:Elsevier-North Holland,1977.
  • 4Cao P,Felten E W,Li K.Application-Controlled File Caching Policies[C] //Proc.USENIX Summer 1994 Technical Conf,1994:171-182.
  • 5Patterson R H,Gibson G A,Ginting E,et al.Informed Prefetching and Caching[C] //Proc.15th Symp.Operating System Principles,1995:1-16.
  • 6Yifeng Zhu,Hong Jiang.RACE:A Robust Adaptive Caching Strategy for Buffer Cache[C] //Proceedings of 4th Workshop on Memory Performance Issues (WMPI-2006),in conjunction with the 12th International Symposium on High-Performance Computer Architecture (HPCA),Austin,Texas,February 11-15,2006:26-34.
  • 7Song Jiang,Xiaodong Zhang.Making LRU Friendly to Weak Locality Workloads:A Novel Replacement Algorithm to Improve Buffer Cache Performance,IEEE TRANSACTIONS ON COMPUTERS,2005,54(8).
  • 8Sacco,Giovanni Maria,Mario Schkolnick.A Mechanism For Managing the Buffer Pool In A Relational Database System Using the Hot Set Model[C] //Proceedings of the 8th International Conference on Very Large Data Bases,Mexico City,September,1982:257-262.
  • 9Taichou Hong,David J Dewitt.An Evaluation Buffer Management Strategies for Relation Database Systems[C] //Proceedings of VLDB 1985.
  • 10Mary W Hall,Ken Kennedy.Efficient Call Graph Analysis.ACM Letters on Programming Languages and System,1992,1(3):227-242.

同被引文献20

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部