By Topic

Database access characterization for buffer hit prediction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. Dan ; IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA ; P. S. Yu ; J. -Y. Chung

Presents a database access characterization method that first distinguishes three types of access pattern from a trace-locality within a transaction, random accesses by transactions, and sequential accesses by long queries. The authors describe a concise way to characterize the access skew across the randomly accessed pages by assuming that the large number of data pages may be logically grouped into a small number of partitions, such that the frequency of accessing each page within a partition can be treated as equal. They present an extensive validation of the buffer hit predictions, both for single-node as well as multiple-node systems, based on access characterization using production database traces. This approach can be applied to predict the buffer hit probability of a composite workload from those of its component files

Published in:

Data Engineering, 1993. Proceedings. Ninth International Conference on

Date of Conference:

19-23 Apr 1993