Performance evaluation of database management systems

We give formulas for estimating the number of disk accesses when accessing a file randomly with buffering. We present the layered hot set model which quantifies the locality of page references when executing a query using a DBMS. We presented the ABLE buffer management algorithms for DBMS's. We give cost models for both relational DBMS's and network DBMS's. We also give some of the results of our experiments for testing the performance of the ABLE buffer management algorithm and the accuracy of the cost model.U of I OnlyETDs are only available to UIUC Users without author permissio