Buffer Management System With Binary Tree Organization of Active Buffers for Fast Search and With Queue for Buffer Reclaim
Original Publication Date: 1983-Nov-01
Included in the Prior Art Database: 2005-Feb-07
A limited number of buffer spaces are available in main memory for holding blocks of data that each contain one or more records of several data sets. Each of these records has information and pointers that form a conventional search tree. Blocks that contain the root of a search tree and a few blocks that form a subtree of records that are most actively being processed are kept in the main store buffers. These buffers are linked in a binary tree that permits fast searching for the records in these buffers. In addition, the buffers are linked in a chain of least recent use. For reclaiming buffer space, the root buffers of each data set are linked to an index control block (ICB) and the ICBs are connected in a queue that is headed by a queue control block (QCB).