To avoid OID index retrieval becoming a boottleck,efficient buffering strategies are needed to minimize the numbe of disk accesses.In this paper,we develop analyticla cost models which we use to find optimal sizes of the index page bufer and the index entry cache,for different memory sizes,inde sizes,and access patterns.Becusue existing buffer hit estimation modelsw are not applicable for index page buffering in the case of tree basse indexes,we have also deveoepd an analytical model for inde page buffer performance.The cost gain frm using the results in this paper is typically in the order of 200-300
展开▼
