Browse Prior Art Database

Software Table Look-Up Buffer for B-Tree Implementation

IP.com Disclosure Number: IPCOM000040418D
Original Publication Date: 1987-Nov-01
Included in the Prior Art Database: 2005-Feb-02

Publishing Venue

IBM

Related People

Authors:
Udupa, DKR Ripstra, JR [+details]

Abstract

In simple find operations on an indexed database, providing a Software Table Look-Up Buffer (TLB) reduces page faults. The search for an entry in the index starts first on the TLB. The TLB is resident in main memory after the first access. This eliminates the need for further page faults for entries found in the TLB. Basically, there are two cases of find operations. In one case, the decision involves whether an entry matching an argument is found or not. In the second case, it may be required to search the adjacent entry or entries based upon certain conditions. A TLB is be useful for the find operations which involve deciding whether an entry matching an argument is found or not. The total time during the search phase can be broken down to the time for paging operations and the time for searching nodes.