×

Computer program product for avoiding complete index tree traversals in sequential and almost sequential index probes

  • US 5,845,274 A
  • Filed: 06/06/1995
  • Issued: 12/01/1998
  • Est. Priority Date: 05/10/1995
  • Status: Expired due to Fees
First Claim
Patent Images

1. A program storage device readable by a machine tangibly embodying a program of instructions executable by the machine to perform method steps for avoiding a root-to-leaf traversal of an index tree having leaf and parent pages, said method steps comprising:

  • a. storing page descriptive information in a LAST information field and a PARENT information field of an index lookaside buffer, said LAST information field identifying the most recent leaf page accessed during an index probe and said PARENT information field identifying a parent node of the most recent leaf page accessed during an index probe;

    b. determining if a search key is located within the leaf page described by said LAST information field; and

    c. determining if said search key is located within one of the leaf pages pointed to by the parent page described in said PARENT information field.

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×