By Topic

Tree-based buffer management in real-time database systems

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
$31 $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

1 Author(s)
Brinkschulte, U. ; Inst. for Microcomput. & Autom., Karlsruhe Univ., Germany

This paper deals with buffer management for tree-based access-path structures in real-time database system kernels. A predictable and efficient buffer replacement strategy for B- and B/sup +/-trees is introduced. The strategy called LC (Level Control) uses the structural information known about the trees and the tree search to determine a node to be replaced. The basic idea is to use the level of a node as replacement criteria. This allows a certain prediction of buffer hits and misses for tree search operations, even if the item's value searched for is unknown. A small prediction interval can be calculated for search operations and a larger interval for update operations. Simulations show the correctness of these calculations and the efficiency of LC for B- and B/sup +/-trees compared to common other replacement strategies.

Published in:

Database and Expert Systems Applications, 1997. Proceedings., Eighth International Workshop on

Date of Conference:

1-2 Sept. 1997