Patent US 5,845,274

Patent №

US 5,845,274

Granted

Owner

Lab

AI components

1

kr

Assignment

None on record

Dataset

AIPD

2023_r1 edition

Application

08471509

The present invention provides a system and method for utilizing the proximity of keys in sequential or near sequential index probes to avoid complete index tree traversal. Page information from three pages (LAST, PARENT and NEXT) are stored in separate information fields within an Index Lookaside Buffer. The LAST information field contains information on the most recent leaf page accessed during an index probe in a read key or an insert key operation, the PARENT information field contains information on the parent page of the most recently accessed leaf page described in the LAST information field, and the NEXT information field contains information on the most recent leaf page accessed during a fetch-next key or delete key operation. On a subsequent index probe, the LAST, NEXT and PARENT information fields are sequentially analyzed to determine if the search key is contained within the leaf page described by the LAST or NEXT information fields or if the search key is contained within one of the leaf pages pointed to by the parent page described by the PARENT information field. If none of the LAST, NEXT or PARENT information fields identify the leaf page containing the search key then the default root-to-leaf traversal would commence.

Knowledge representationG06F 16/2246Y10S 707/99931Y10S 707/99932Y10S 707/99933Y10S 707/99953

AI classification

Knowledge representation1.00
Planning0.03
Natural language0.01
Machine learning0.00
Evolutionary computation0.00
Vision0.00
AI hardware0.00
Speech0.00
© 2026 NYSGPT2525 LLC