1Fiat A, Rosen Z. Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard?[C]//Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms Archive. New Orleans, Louisiana, USA: [s. n.], 1997.
2Hall M W, Kennedy K. Efficient Call Graph Analysis[J]. ACM Letters on Programming Languages and System, 1992, 1(3): 227-242.
3Annavaram M, Patel J M, Davidson E S. Call Graph Prefetching for Database Application[J]. ACM Transaction on Computer Systems, 2003, 21(4): 412-444.
