A new database Adaptive Buffer Replacement Algorithm based on Call Graph Optimization

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Aiming at the existing problem of single buffer replacement policy and the inability of predicting future SQLs execution in current database buffer replacement algorithm, proposed a new database buffer replacement algorithm-CG-ABR(Call Graph Optimizing Adaptive Buffer Replacement Algorithm). CG-ABR could adapt to current SQL's access behavior automatically by getting it through query optimizer, and this algorithm optimized the management method of buffer access information, and generated the Call Graph according to the SQL's execution order of application program's logic, based on this Call Graph, the future SQLs execution can be predicted, and the pages might not be accessed hereafter, would be replaced, which could optimize the buffer space. The experiments and analysis showed that CG-ABR algorithm is effective in buffer replacement, with high hit ratio to real time access types and enormous value in practicing applications. © 2008 IEEE.

Cite

CITATION STYLE

APA

Ya-Dan, D., Ning, J., & Wei, X. (2008). A new database Adaptive Buffer Replacement Algorithm based on Call Graph Optimization. In Proceedings - The 9th International Conference on Web-Age Information Management, WAIM 2008 (pp. 575–582). https://doi.org/10.1109/WAIM.2008.38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free