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.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Pang, Youlun

Contributors dc:contributor

• Kuck, S.

• Computer Science

Statement dc:rights

• Copyright 1990 Pang, Youlun

Language dc:language

eng

Identifier

AAI9026291
(UMI)AAI9026291

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/23800