𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The design and evaluation of a buffer algorithm for database machines

✍ Scribed by Cai, F. F.; Hull, M. E. C.; Bell, D. A.

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
368 KB
Volume
10
Category
Article
ISSN
1040-3108

No coin nor oath required. For personal study only.

✦ Synopsis

This paper reports on the design, development and evaluation of a buffer algorithm named RESBAL, which exploits parallelism in order to provide high query execution performance in relational database systems. The algorithm aims to provide both predictive and efficient data buffering by exploiting the use of advance knowledge of query reference behaviour. Designed to offer a high level of flexibility, RESBAL employs a multiple buffering strategy both on page fetch level and page replacement level in order to improve buffer performance. The evaluation of RESBAL has been carried out in a parallel database system environment based on a transputer architecture. The results of this performance assessment allow comparison to be made between different buffer algorithms, and demonstrate the feasibility and effectiveness of the RESBAL algorithm.

πŸ“œ SIMILAR VOLUMES

Critical evaluation of search algorithms
Critical evaluation of search algorithms for automated molecular docking and database screening
✍ Ewing, Todd J. A.; Kuntz, Irwin D. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 263 KB πŸ‘ 1 views

The DOCK program explores possible orientations of a molecule within a macromolecular active site by superimposing atoms onto precomputed site points. Here we compare a number of different search methods, including an exhaustive matching algorithm based on a single docking graph. We evaluate the per

An exact algorithm for the batch sequenc
An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
✍ A. Agnetis; F. Rossi; G. Gristina πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 295 KB πŸ‘ 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.

Evaluation of the basic remote backup an
Evaluation of the basic remote backup and replication methods for high availability databases
✍ Lars Frank πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 104 KB πŸ‘ 1 views

In this paper, we describe the properties of two 0-safe backup/replication methods and compare them with the traditional 1-safe and 2-safe backup/replication methods. The 1-safe and 2-safe backup/replication methods have been analyzed for many years, and their problems are well known. The properties

A regional genetic algorithm for the dis
A regional genetic algorithm for the discrete optimal design of truss structures
✍ A. A. Groenwold; N. Stander; J. A. Snyman πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 2 views

A regional genetic algorithm (R-GA) is used for the discrete optimal design of truss structures. The chromosomes are selected from a sub-region centred on the continuous optimum. This approach replaces genetic rebirth as previously proposed by other authors, thereby signiΓΏcantly reducing computation